Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth. Minimum Convex Partitions and Maximum Empty Polytopes. In Fedor V. Fomin, Petteri Kaski, editors, Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Volume 7357 of Lecture Notes in Computer Science, pages 213-224, Springer, 2012. [doi]
@inproceedings{DumitrescuHT12,
title = {Minimum Convex Partitions and Maximum Empty Polytopes},
author = {Adrian Dumitrescu and Sariel Har-Peled and Csaba D. Tóth},
year = {2012},
doi = {10.1007/978-3-642-31155-0_19},
url = {http://dx.doi.org/10.1007/978-3-642-31155-0_19},
researchr = {https://researchr.org/publication/DumitrescuHT12},
cites = {0},
citedby = {0},
pages = {213-224},
booktitle = {Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings},
editor = {Fedor V. Fomin and Petteri Kaski},
volume = {7357},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-31154-3},
}