collaborators

1 paper

cs.DS2025

A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees

Lars Jaffke, Paloma T. de Lima, Wojciech Nadara +1

Computing bounded depth decompositions is a bottleneck in many applications of the treedepth parameter. The fastest known algorithm, which is due to Reidl, Rossmanith, Sánchez Vil…