@InProceedings{bonnet_et_al:LIPIcs.FSTTCS.2020.17,
author = {Bonnet, \'{E}douard and Grelier, Nicolas and Miltzow, Tillmann},
title = {{Maximum Clique in Disk-Like Intersection Graphs}},
booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
pages = {17:1--17:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-174-0},
ISSN = {1868-8969},
year = {2020},
volume = {182},
editor = {Saxena, Nitin and Simon, Sunil},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.17},
URN = {urn:nbn:de:0030-drops-132587},
doi = {10.4230/LIPIcs.FSTTCS.2020.17},
annote = {Keywords: Disk Graphs, Intersection Graphs, Maximum Clique, Algorithms, NP-hardness, APX-hardness}
}