8 citations · 12 across the 6 of their papers we have counts for
7 papers
Polynomial Treedepth Bounds in Linear Colorings
Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk +1
Low-treedepth colorings are an important tool for algorithms that exploit structure in classes of bounded expansion; they guarantee subgraphs that use few colors have bounded treed…
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…
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models
Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien +3
Growing interest in modeling large, complex networks has spurred significant research into generative graph models. Kronecker-style models (SKG and R-MAT) are often used due to the…
Locally Estimating Core Numbers
Michael P. O'Brien, Blair D. Sullivan
Graphs are a powerful way to model interactions and relationships in data from a wide variety of application domains. In this setting, entities represented by vertices at the "cent…