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 …

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three
decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit …

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 …

A k-star colouring of a graph G is a function f: V (G)→{0, 1,…, k− 1} such that f (u)≠ f (v) for
every edge uv of G, and every bicoloured connected subgraph of G is a star. The star …

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 propose a polynomial-time algorithm which takes as input a finite set of points of R^ 3
and computes, up to arbitrary precision, a maximum subset with diameter at most 1. More …

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 …

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 …