activity
20232026
most citedTight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths

1 citations · 1 across the 9 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.DS2026

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach

Many problems are known to be solvable in subexponential parameterized time when the input graph is planar. The bidimensionality framework of Demaine, Fomin, Hajiaghay, and Thiliko…