Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Jared Espenant, J. Mark Keil, and Debajyoti Mondal. Finding a Maximum Clique in a Disk Graph. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 30:1-30:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{espenant_et_al:LIPIcs.SoCG.2023.30, author = {Espenant, Jared and Keil, J. Mark and Mondal, Debajyoti}, title = {{Finding a Maximum Clique in a Disk Graph}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.30}, URN = {urn:nbn:de:0030-drops-178803}, doi = {10.4230/LIPIcs.SoCG.2023.30}, annote = {Keywords: Maximum clique, Disk graph, Time complexity, APX-hardness} }
Feedback for Dagstuhl Publishing