Jared Espenant, J. Mark Keil, Debajyoti Mondal. Finding a Maximum Clique in a Disk Graph. In Erin W. Chambers, Joachim Gudmundsson, editors, 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA. Volume 258 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]
@inproceedings{EspenantKM23,
title = {Finding a Maximum Clique in a Disk Graph},
author = {Jared Espenant and J. Mark Keil and Debajyoti Mondal},
year = {2023},
doi = {10.4230/LIPIcs.SoCG.2023.30},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.30},
researchr = {https://researchr.org/publication/EspenantKM23},
cites = {0},
citedby = {0},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA},
editor = {Erin W. Chambers and Joachim Gudmundsson},
volume = {258},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-273-0},
}