121 citations · 181 across the 38 of their papers we have counts for
4 papers · 1 filter
Tight bounds for counting colorings and connected edge sets parameterized by cutwidth
Carla Groenland, Jesper Nederlof, Isja Mannens +1
We study the fine-grained complexity of counting the number of colorings and connected spanning edge sets parameterized by the cutwidth and treewidth of the graph. While decomposit…
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
Isja Mannens, Jesper Nederlof, Céline Swennenhuis +1
We study a variant of Min Cost Flow in which the flow needs to be connected. Specifically, in the Connected Flow problem one is given a directed graph , along with a set of dema…
Isolation schemes for problems on decomposable graphs
Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis +1
The Isolation Lemma of Mulmuley, Vazirani and Vazirani [Combinatorica'87] provides a self-reduction scheme that allows one to assume that a given instance of a problem has a unique…
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof +1
Let XNLP be the class of parameterized problems such that an instance of size n with parameter k can be solved nondeterministically in time and space (…