
A tight local algorithm for the minimum dominating set problem in outerplanar graphs
We show that there is a deterministic local algorithm (constanttime dis...
read it

Parameterized Complexities of Dominating and Independent Set Reconfiguration
We settle the parameterized complexities of several variants of independ...
read it

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space
Let XNLP be the class of parameterized problems such that an instance of...
read it

Asymptotic Dimension of MinorClosed Families and AssouadNagata Dimension of Surfaces
The asymptotic dimension is an invariant of metric spaces introduced by ...
read it

Optimal labelling schemes for adjacency, comparability and reachability
We construct asymptotically optimal adjacency labelling schemes for ever...
read it

Approximating pathwidth for graphs of small treewidth
We describe a polynomialtime algorithm which, given a graph G with tree...
read it

The Curse of Ties in Congestion Games with Limited Lookahead
We introduce a novel framework to model limited lookahead in congestion ...
read it

Hcolouring P_tfree graphs in subexponential time
A graph is called P_tfree if it does not contain the path on t vertices...
read it
Carla Groenland
is this you? claim profile