We give an algorithmic and lower bound framework that facilitates the construction of
subexponential algorithms and matching conditional complexity bounds. It can be applied to …

We consider subexponential algorithms finding weighted homomorphisms from intersection
graphs of curves (string graphs) with n vertices to a fixed graph H. We provide a complete …

We give an algorithmic and lower-bound framework that facilitates the construction of
subexponential algorithms and matching conditional complexity bounds. It can be applied to …

In a disk graph, every vertex corresponds to a disk in $\mathbb {R}^ 2$ and two vertices are
connected by an edge whenever the two corresponding disks intersect. Disk graphs form an …

Two of the most widely used approaches to obtain polynomial-time approximation schemes
(PTASs) on planar graphs are the Lipton-Tarjan separator-based approach and Baker's …

We prove a structural theorem for unit-disk graphs, which (roughly) states that given a set of
unit disks inducing a unit-disk graph and a number, one can partition into subsets such that …

Planar graphs are known to allow subexponential algorithms running in time 2^ O (n) 2 O (n)
or 2^ O (n\log n) 2 O (n log n) for most of the paradigmatic problems, while the brute-force …

We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in d-
dimensional hyperbolic space, which we denote by ℍ d. Using a new separator theorem, we …

We give a new decomposition theorem in unit disk graphs (UDGs) and demonstrate its
applicability in the fields of Structural Graph Theory and Parameterized Complexity. First, our …

Bidimensionality is the most common technique to design subexponential-time
parameterized algorithms on special classes of graphs, particularly planar graphs. The core …