@InProceedings{harpeled_et_al:LIPIcs.SoCG.2022.47,
author = {Har-Peled, Sariel and Yang, Everett},
title = {{Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs}},
booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)},
pages = {47:1--47:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-227-3},
ISSN = {1868-8969},
year = {2022},
volume = {224},
editor = {Goaoc, Xavier and Kerber, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.47},
URN = {urn:nbn:de:0030-drops-160555},
doi = {10.4230/LIPIcs.SoCG.2022.47},
annote = {Keywords: Matchings, disk intersection graphs, approximation algorithms}
}