- Conference Paper
In the 90’s Clark, Colbourn and Johnson wrote a seminal paper, where they proved that maximum clique can be solved in polynomial time in unit disk graphs. Since then, the complexity of maximum clique in intersection graphs of (unit) d-dimensional balls has been investigated. For ball graphs, the problem is NP-hard, as shown by Bonamy et al. (FOCS ’18). They also gave an efficient polynomial time approximation scheme (EPTAS) for disk graphs, however the complexity of maximum clique in this setting remains unknown. In this paper, we show the existence of a polynomial time algorithm for solving maximum clique in a geometric superclass of unit disk graphs. Moreover, we give partial results toward obtaining an EPTAS for intersection graphs of convex pseudo-disks. Show more
Book titleComputing and Combinatorics
Journal / seriesLecture Notes in Computer Science
Pages / Article No.
SubjectPseudo-disks; Line transversals; Intersection graphs
Organisational unit03457 - Welzl, Emo / Welzl, Emo
171681 - Arrangements and Drawings (ArrDra) (SNF)
NotesDue to the Coronavirus (COVID-19) the conference was conducted virtually.
MoreShow all metadata