121 citations · 181 across the 38 of their papers we have counts for
48 papers
New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
Afrouz Jabal Ameli, Tomohiro Koana, Jesper Nederlof +1
The Strongly Connected Steiner Subgraph (SCSS) problem is a well-studied network design problem that asks for a minimum subgraph that strongly connects a given set of terminals. In…
Weighted -Path and Other Problems in Almost Deterministic Time via Dynamic Representative Sets
Jesper Nederlof
We present a data structure that we call a Dynamic Representative Set. In its most basic form, it is given two parameters and allows us to maintain a representation of a…
Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
Andreas Björklund, Petteri Kaski, Tomohiro Koana +1
We show that sufficiently low tensor rank for the balanced tripartitioning tensor for a large enough constan…
A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a -Minor
Carla Groenland, Jesper Nederlof, Tomohiro Koana
We study a special case of the Steiner Tree problem in which the input graph does not have a minor model of a complete graph on 4 vertices for which all branch sets contain a termi…
Parameterized Algorithms for Covering by Arithmetic Progressions
Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
An arithmetic progression is a sequence of integers in which the difference between any two consecutive elements is the same. We investigate the parameterized complexity of two pro…
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters
Carla Groenland, Isja Mannens, Jesper Nederlof +2
A homomorphism from a graph to a graph is an edge-preserving mapping from to . In the graph homomorphism problem, denoted by , the graph is fixed a…