Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. - Alex J. Chin; Timothy D. Goodrich; Michael P. O'Brien; Felix Reidl; Blair D. Sullivan; Andrew van der Poel (ICDM, 2016)

A Fast Parameterized Algorithm for Co-Path Set. - Blair D. Sullivan; Andrew van der Poel (IPEC, 2016)

A practical fpt algorithm for Flow Decomposition and transcript assembly. - Kyle Kloster; Philipp Kuinke; Michael P. O'Brien; Felix Reidl; Fernando Sánchez Villaamil; Blair D. Sullivan; Andrew van der Poel (ALENEX, 2018)

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. - Erik D. Demaine; Timothy D. Goodrich; Kyle Kloster; Brian Lavallee; Quanquan C. Liu; Blair D. Sullivan; Ali Vakilian; Andrew van der Poel (ESA, 2019)

Mining Maximal Induced Bicliques using Odd Cycle Transversals. - Kyle Kloster; Blair D. Sullivan; Andrew van der Poel (SDM, 2019)

Faster Biclique Mining in Near-Bipartite Graphs. - Blair D. Sullivan; Andrew van der Poel; Trey Woodlief (SEA², 2019)

Approximating Vertex Cover using Structural Rounding. - Brian Lavallee; Hayley Russell; Blair D. Sullivan; Andrew van der Poel (ALENEX, 2020)