@InProceedings{bonnet_et_al:LIPIcs.STACS.2020.31,
author = {Bonnet, \'{E}douard and Cabello, Sergio and Mulzer, Wolfgang},
title = {{Maximum Matchings in Geometric Intersection Graphs}},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
pages = {31:1--31:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-140-5},
ISSN = {1868-8969},
year = {2020},
volume = {154},
editor = {Paul, Christophe and Bl\"{a}ser, Markus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.31},
URN = {urn:nbn:de:0030-drops-118926},
doi = {10.4230/LIPIcs.STACS.2020.31},
annote = {Keywords: computational geometry, geometric intersection graph, maximum matching, disk graph, unit-disk graph}
}