Minimum Convex Partitions and Maximum Empty Polytopes. Dumitrescu, A., Har-Peled, S., & Tóth, C. D. In Proceedings of Scandinavian Workshop on Algorithm Theory (SWAT), pages 213-224, 2012. Paper bibtex @inproceedings{ dblp2631930,
title = {Minimum Convex Partitions and Maximum Empty Polytopes},
author = {Adrian Dumitrescu and Sariel Har-Peled and Csaba D. Tóth},
author_short = {Dumitrescu, A. and Har-Peled, S. and Tóth, C. D.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2012},
key = {dblp2631930},
id = {dblp2631930},
biburl = {http://www.dblp.org/rec/bibtex/conf/swat/DumitrescuHT12},
url = {http://dx.doi.org/10.1007/978-3-642-31155-0_19},
conference = {SWAT},
pages = {213-224},
text = {SWAT 2012:213-224},
booktitle = {Proceedings of Scandinavian Workshop on Algorithm Theory (SWAT)}
}
Downloads: 0
{"_id":"GvqvHfo7kJk65pXcP","bibbaseid":"dumitrescu-harpeled-tth-minimumconvexpartitionsandmaximumemptypolytopes-2012","downloads":0,"creationDate":"2016-02-19T04:14:21.520Z","title":"Minimum Convex Partitions and Maximum Empty Polytopes","author_short":["Dumitrescu, A.","Har-Peled, S.","Tóth, C. D."],"year":2012,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/swat/DumitrescuHT12","bibdata":{"title":"Minimum Convex Partitions and Maximum Empty Polytopes","author":["Adrian Dumitrescu","Sariel Har-Peled","Csaba D. Tóth"],"author_short":["Dumitrescu, A.","Har-Peled, S.","Tóth, C. D."],"bibtype":"inproceedings","type":"inproceedings","year":"2012","key":"dblp2631930","id":"dblp2631930","biburl":"http://www.dblp.org/rec/bibtex/conf/swat/DumitrescuHT12","url":"http://dx.doi.org/10.1007/978-3-642-31155-0_19","conference":"SWAT","pages":"213-224","text":"SWAT 2012:213-224","booktitle":"Proceedings of Scandinavian Workshop on Algorithm Theory (SWAT)","bibtex":"@inproceedings{ dblp2631930,\n title = {Minimum Convex Partitions and Maximum Empty Polytopes},\n author = {Adrian Dumitrescu and Sariel Har-Peled and Csaba D. Tóth},\n author_short = {Dumitrescu, A. and Har-Peled, S. and Tóth, C. D.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2012},\n key = {dblp2631930},\n id = {dblp2631930},\n biburl = {http://www.dblp.org/rec/bibtex/conf/swat/DumitrescuHT12},\n url = {http://dx.doi.org/10.1007/978-3-642-31155-0_19},\n conference = {SWAT},\n pages = {213-224},\n text = {SWAT 2012:213-224},\n booktitle = {Proceedings of Scandinavian Workshop on Algorithm Theory (SWAT)}\n}","bibbaseid":"dumitrescu-harpeled-tth-minimumconvexpartitionsandmaximumemptypolytopes-2012","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/978-3-642-31155-0_19"},"downloads":0},"search_terms":["minimum","convex","partitions","maximum","empty","polytopes","dumitrescu","har-peled","tóth"],"keywords":[],"authorIDs":[],"dataSources":["3Y5hRARuWmXMePn6H"]}