default search action
Search dblp for Publications
export results for "Kimberly Crosbie"
@article{DBLP:journals/algorithmica/BiniazBCCEMS19, author = {Ahmad Biniaz and Prosenjit Bose and Kimberly Crosbie and Jean{-}Lou De Carufel and David Eppstein and Anil Maheshwari and Michiel H. M. Smid}, title = {Maximum Plane Trees in Multipartite Geometric Graphs}, journal = {Algorithmica}, volume = {81}, number = {4}, pages = {1512--1534}, year = {2019}, url = {https://doi.org/10.1007/s00453-018-0482-x}, doi = {10.1007/S00453-018-0482-X}, timestamp = {Wed, 10 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BiniazBCCEMS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BiniazBCCEMS17, author = {Ahmad Biniaz and Prosenjit Bose and Kimberly Crosbie and Jean{-}Lou De Carufel and David Eppstein and Anil Maheshwari and Michiel H. M. Smid}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Maximum Plane Trees in Multipartite Geometric Graphs}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {193--204}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_17}, doi = {10.1007/978-3-319-62127-2\_17}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/BiniazBCCEMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.