QPTAS and subexponential algorithm for maximum clique on disk graphs (2018)
Attributed to:
Fixed-parameter tractability for geometric optimization problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.4230/lipics.socg.2018.12
Publication URI: http://dx.doi.org/10.4230/lipics.socg.2018.12
Type: Other
Volume: 99
Parent Publication: Leibniz International Proceedings in Informatics, LIPIcs
ISSN: 18688969