DROPS

Document

DOI: 10.4230/LIPIcs.SoCG.2026.77

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs

Authors: Malory Marin, Jean-Florent Raymond, and Rémi Watrigant

Published in: LIPIcs, Volume 367, 42nd International Symposium on Computational Geometry (SoCG 2026)

Abstract

We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in ℝ^d. In this setting, each vertex corresponds to a geometric object, and two vertices are adjacent if and only if their objects intersect. We introduce a new tool for designing such algorithms, which we call a λ-linked partition. This is a partition of the vertex set into groups of highly connected vertices. Crucially, such a partition can be computed in polynomial time and does not require access to the geometric representation of the graph. We apply this framework to problems related to paths and cycles in graphs. First, we obtain the first robust ETH-tight algorithms for Hamiltonian Path and Hamiltonian Cycle, running in time 2^O(n^{1-1/d}) on intersection graphs of similarly sized fat objects in ℝ^d. This resolves an open problem of de Berg et al. [STOC 2018] and completes the study of these problems on geometric intersection graphs from the viewpoint of ETH-tight exact algorithms. We further extend our approach to the parameterized setting and design the first robust subexponential parameterized algorithm for Long Path in any fixed dimension d. More precisely, we obtain a randomized robust algorithm running in time 2^O(k^{1-1/d} log² k) n^O(1) on intersection graphs of similarly sized fat objects in ℝ^d, where k is the natural parameter. Besides λ-linked partitions, our algorithm also relies on a low-treewidth pattern covering theorem that we establish for geometric intersection graphs, which may be viewed as a refinement of a result of Marx-Pilipczuk [ESA 2017]. This structural result may be of independent interest.

Cite as

Malory Marin, Jean-Florent Raymond, and Rémi Watrigant. Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs. In 42nd International Symposium on Computational Geometry (SoCG 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 367, pp. 77:1-77:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{marin_et_al:LIPIcs.SoCG.2026.77,
  author =	{Marin, Malory and Raymond, Jean-Florent and Watrigant, R\'{e}mi},
  title =	{{Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs}},
  booktitle =	{42nd International Symposium on Computational Geometry (SoCG 2026)},
  pages =	{77:1--77:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-418-5},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{367},
  editor =	{Ahn, Hee-Kap and Hoffmann, Michael and Nayyeri, Amir},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.77},
  URN =		{urn:nbn:de:0030-drops-258842},
  doi =		{10.4230/LIPIcs.SoCG.2026.77},
  annote =	{Keywords: Robust algorithms, geometric intersection graphs, subexponential FPT algorithms}
}

Document

DOI: 10.4230/LIPIcs.MFCS.2025.74

Subcoloring of (Unit) Disk Graphs

Authors: Malory Marin and Rémi Watrigant

Published in: LIPIcs, Volume 345, 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025)

Abstract

A subcoloring of a graph is a partition of its vertex set into subsets (called colors), each inducing a disjoint union of cliques. It is a natural generalization of the classical proper coloring, in which each color must instead induce an independent set. Similarly to proper coloring, we define the subchromatic number of a graph as the minimum integer k such that it admits a subcoloring with k colors, and the corresponding problem k-Subcoloring which asks whether a graph has subchromatic number at most k. In this paper, we initiate the study of the subcoloring of (unit) disk graphs. One motivation stems from the fact that disk graphs can be seen as a dense generalization of planar graphs where, intuitively, each vertex can be blown into a large clique-much like subcoloring generalizes proper coloring. Interestingly, it can be observed that every unit disk graph admits a subcoloring with at most 7 colors. We first prove that the subchromatic number can be 3-approximated in polynomial-time in unit disk graphs. We then present several hardness results for special cases of unit disk graphs which somehow prevents the use of classical approaches for improving this result. We show in particular that 2-Subcoloring remains NP-hard in triangle-free unit disk graphs, as well as in unit disk graphs representable within a strip of bounded height. We also solve an open question of Broersma, Fomin, Nešetřil, and Woeginger (2002) by proving that 3-Subcoloring remains NP-hard in co-comparability graphs (which contain unit disk graphs representable within a strip of height √3/2). Finally, we prove that every n-vertex disk graph admits a subcoloring with at most O(log³(n)) colors and present a O(log²(n))-approximation algorithm for computing the subchromatic number of such graphs. This is achieved by defining a decomposition and a special type of co-comparability disk graph, called Δ-disk graphs, which might be of independent interest.

Cite as

Malory Marin and Rémi Watrigant. Subcoloring of (Unit) Disk Graphs. In 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 345, pp. 74:1-74:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{marin_et_al:LIPIcs.MFCS.2025.74,
  author =	{Marin, Malory and Watrigant, R\'{e}mi},
  title =	{{Subcoloring of (Unit) Disk Graphs}},
  booktitle =	{50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025)},
  pages =	{74:1--74:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-388-1},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{345},
  editor =	{Gawrychowski, Pawe{\l} and Mazowiecki, Filip and Skrzypczak, Micha{\l}},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.74},
  URN =		{urn:nbn:de:0030-drops-241811},
  doi =		{10.4230/LIPIcs.MFCS.2025.74},
  annote =	{Keywords: subcoloring, algorithms, disk graphs, unit disk graphs}
}

Search Results

Documents authored by Marin, Malory

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs

Abstract

Cite as

Subcoloring of (Unit) Disk Graphs

Abstract

Cite as

Thanks for your feedback!

Could not send message