8 citations · 12 across the 6 of their papers we have counts for
3 papers · 1 filter
An Experimental Evaluation of a Bounded Expansion Algorithmic Pipeline
Michael P. O'Brien, Blair D. Sullivan
Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with…
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…
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…