Go to the corresponding LIPIcs Volume Portal 
Bonnet, Édouard ; Giannopoulos, Panos ; Kim, Eun Jung ; Rzazewski, Pawel ; Sikora, Florian
pdfformat: 

@InProceedings{bonnet_et_al:LIPIcs:2018:8725, author = {{\'E}douard Bonnet and Panos Giannopoulos and Eun Jung Kim and Pawel Rzazewski and Florian Sikora}, title = {{QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {12:112:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770668}, ISSN = {18688969}, year = {2018}, volume = {99}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8725}, URN = {urn:nbn:de:0030drops87259}, doi = {10.4230/LIPIcs.SoCG.2018.12}, annote = {Keywords: disk graph, maximum clique, computational complexity} }
Keywords:  disk graph, maximum clique, computational complexity  
Seminar:  34th International Symposium on Computational Geometry (SoCG 2018)  
Issue Date:  2018  
Date of publication:  24.05.2018 