Jesper Nederlof

activity

20242026

collaborators

4 papers

cs.DS2026

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…

cs.DS2025

Weighted $k$ -Path and Other Problems in Almost $O^{*} (2^{k})$ 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 $0 < k < n$ and allows us to maintain a representation of a…

cs.DS2025

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 $P_{d} (x, y, z) = \sum_{A, B, C \in (d [ 3 d ]) : A \cup B \cup C = [3 d]} x_{A} y_{B} z_{C}$ for a large enough constan…

cs.DS2024

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_{4}$ -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…

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph

Weighted k-Path and Other Problems in Almost O∗(2k) Deterministic Time via Dynamic Representative Sets

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a K4​-Minor

Weighted $k$ -Path and Other Problems in Almost $O^{*} (2^{k})$ Deterministic Time via Dynamic Representative Sets

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_{4}$ -Minor