13 citations · 48 across the 26 of their papers we have counts for
4 papers · 1 filter
A practical fpt algorithm for Flow Decomposition and transcript assembly
Kyle Kloster, Philipp Kuinke, Michael P. O'Brien +4
The Flow Decomposition problem, which asks for the smallest set of weighted paths that "covers" a flow on a DAG, has recently been used as an important computational step in transc…
Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials
Gregory Gutin, Felix Reidl, Magnus Wahlström +1
In recent years, several powerful techniques have been developed to design {\em randomized} polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of…
Being even slightly shallow makes life hard
Irene Muzi, Michael P. O'Brien, Felix Reidl +1
We study the computational complexity of identifying dense substructures, namely -shallow topological minors and -subdivisions. Of particular interest is the case when $r=1…
Path-contractions, edge deletions and connectivity preservation
Gregory Gutin, M. S. Ramanujan, Felix Reidl +1
We study several problems related to graph modification problems under connectivity constraints from the perspective of parameterized complexity: {\sc (Weighted) Biconnectivity Del…