@InProceedings{dumitrescu_et_al:LIPIcs.STACS.2011.637,
author = {Dumitrescu, Adrian and Schulz, Andre and Sheffer, Adam and Toth, Csaba D.},
title = {{Bounds on the maximum multiplicity of some common geometric graphs}},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)},
pages = {637--648},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-25-5},
ISSN = {1868-8969},
year = {2011},
volume = {9},
editor = {Schwentick, Thomas and D\"{u}rr, Christoph},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.637},
URN = {urn:nbn:de:0030-drops-30505},
doi = {10.4230/LIPIcs.STACS.2011.637},
annote = {Keywords: combinatorial geometry, matching, triangulation, spanning tree, spanning cycle, weighted structure, non-crossing condition}
}