Parameterized algorithms on geometric intersection graphs

Jie Xue; Meirav Zehavi

doi:10.1016/j.cosrev.2025.100796

Parameterized algorithms on geometric intersection graphs

Jie Xue
, Meirav Zehavi

Institute for the Theory of Computing

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs. Specifically, we consider: (i) vertex-deletion, packing and pattern detection problems; (ii) Independent Set and Dominating Set ; (iii) cut and connectivity problems; (iv) obstacle-removal problems. The discussions include introductions of some of the proof ideas and directions for future research.

Original language	English
Article number	100796
Journal	Computer Science Review
Volume	58
DOIs	https://doi.org/10.1016/j.cosrev.2025.100796
State	Published - 1 Nov 2025

Keywords

Disk graph
Geometric intersection graph
Parameterized complexity
Unit disk graph

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.cosrev.2025.100796

Cite this

@article{78887ff4d90340ebbbf3e187e69bf711,

title = "Parameterized algorithms on geometric intersection graphs",

abstract = "We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs. Specifically, we consider: (i) vertex-deletion, packing and pattern detection problems; (ii) Independent Set and Dominating Set ; (iii) cut and connectivity problems; (iv) obstacle-removal problems. The discussions include introductions of some of the proof ideas and directions for future research.",

keywords = "Disk graph, Geometric intersection graph, Parameterized complexity, Unit disk graph",

author = "Jie Xue and Meirav Zehavi",

note = "Publisher Copyright: {\textcopyright} 2025 Elsevier Inc.",

year = "2025",

month = nov,

day = "1",

doi = "10.1016/j.cosrev.2025.100796",

language = "English",

volume = "58",

journal = "Computer Science Review",

issn = "1574-0137",

publisher = "Elsevier Ireland Ltd",

}

TY - JOUR

T1 - Parameterized algorithms on geometric intersection graphs

AU - Xue, Jie

AU - Zehavi, Meirav

PY - 2025/11/1

Y1 - 2025/11/1

N2 - We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs. Specifically, we consider: (i) vertex-deletion, packing and pattern detection problems; (ii) Independent Set and Dominating Set ; (iii) cut and connectivity problems; (iv) obstacle-removal problems. The discussions include introductions of some of the proof ideas and directions for future research.

AB - We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs. Specifically, we consider: (i) vertex-deletion, packing and pattern detection problems; (ii) Independent Set and Dominating Set ; (iii) cut and connectivity problems; (iv) obstacle-removal problems. The discussions include introductions of some of the proof ideas and directions for future research.

KW - Disk graph

KW - Geometric intersection graph

KW - Parameterized complexity

KW - Unit disk graph

UR - https://www.scopus.com/pages/publications/105022718224

U2 - 10.1016/j.cosrev.2025.100796

DO - 10.1016/j.cosrev.2025.100796

M3 - Article

AN - SCOPUS:105022718224

SN - 1574-0137

VL - 58

JO - Computer Science Review

JF - Computer Science Review

M1 - 100796

ER -

Parameterized algorithms on geometric intersection graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this