Cycles in dense digraphs. - Maria Chudnovsky; Paul D. Seymour; Blair D. Sullivan (Comb., 2008)

Counting paths in digraphs. - Paul D. Seymour; Blair D. Sullivan (Eur. J. Comb., 2010)

A mathematical analysis of the R-MAT random graph generator. - Christopher Groër; Blair D. Sullivan; Steve Poole 001 (Networks, 2011)

Tree-Like Structure in Large Social and Information Networks. - Aaron B. Adcock; Blair D. Sullivan; Michael W. Mahoney (ICDM, 2013)

Parallel Algorithms for Graph Optimization Using Tree Decompositions. - Blair D. Sullivan; Dinesh Weerapurage; Chris Groër (IPDPS Workshops, 2013)

Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity. - Aaron B. Adcock; Blair D. Sullivan; Oscar R. Hernandez; Michael W. Mahoney (IWOMP, 2013)

Locally Estimating Core Numbers. - Michael P. O'Brien; Blair D. Sullivan (ICDM, 2014)

Multi-Level Anomaly Detection on Streaming Graph Data. - Robert A. Bridges; John P. Collins; Erik M. Ferragut; Jason A. Laska; Blair D. Sullivan (CoRR, 2014)

Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. - Erik D. Demaine; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar; Blair D. Sullivan (CoRR, 2014)

Adiabatic quantum programming: minor embedding with hard faults. - Christine Klymko; Blair D. Sullivan; Travis S. Humble (Quantum Inf. Process., 2014)

Multi-Level Anomaly Detection on Time-Varying Graph Data. - Robert A. Bridges; John P. Collins; Erik M. Ferragut; Jason A. Laska; Blair D. Sullivan (ASONAM, 2015)

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs. - Matthew Farrell; Timothy D. Goodrich; Nathan Lemons; Felix Reidl; Fernando Sánchez Villaamil; Blair D. Sullivan (WAW, 2015)

Zig-Zag Numberlink is NP-Complete. - Aaron B. Adcock; Erik D. Demaine; Martin L. Demaine; Michael P. O'Brien; Felix Reidl; Fernando Sánchez Villaamil; Blair D. Sullivan (J. Inf. Process., 2015)

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)

Tree decompositions and social graphs. - Aaron B. Adcock; Blair D. Sullivan; Michael W. Mahoney (Internet Math., 2016)

A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization. - Robert A. Bridges; John P. Collins; Erik M. Ferragut; Jason A. Laska; Blair D. Sullivan (Soc. Netw. Anal. Min., 2016)

Being Even Slightly Shallow Makes Life Hard. - Irene Muzi; Michael P. O'Brien; Felix Reidl; Blair D. Sullivan (MFCS, 2017)

Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion. - Michael P. O'Brien; Blair D. Sullivan (CoRR, 2017)

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)

Treedepth Bounds in Linear Colorings. - Jeremy Kun; Michael P. O'Brien; Blair D. Sullivan (WG, 2018)

When Centrality Measures Deceive Us. - Eric Horton; Kyle Kloster; Blair D. Sullivan (CoRR, 2018)

Practical Graph Bipartization with Applications in Near-Term Quantum Computing. - Timothy D. Goodrich; Eric Horton; Blair D. Sullivan (CoRR, 2018)

Benchmarking treewidth as a practical component of tensor-network-based quantum simulation. - Eugene F. Dumitrescu; Allison L. Fisher; Timothy D. Goodrich; Travis S. Humble; Blair D. Sullivan; Andrew L. Wright (CoRR, 2018)

Optimizing adiabatic quantum program compilation using a graph-theoretic framework. - Timothy D. Goodrich; Blair D. Sullivan; Travis S. Humble (Quantum Inf. Process., 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)

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. - Erik D. Demaine; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar; Blair D. Sullivan (J. Comput. Syst. Sci., 2019)

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

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. - Madison Cooley; Casey S. Greene; Davis Issac; Milton Pividori; Blair D. Sullivan (ACDA, 2021)

Polynomial Treedepth Bounds in Linear Colorings. - Jeremy Kun; Michael P. O'Brien; Marcin Pilipczuk; Blair D. Sullivan (Algorithmica, 2021)

Sparse dominating sets and balanced neighborhood partitioning. - Yosuke Mizutani; Annie Staker; Blair D. Sullivan (CoRR, 2021)

Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). - Daniel Král'; Michal Pilipczuk; Sebastian Siebertz; Blair D. Sullivan (Dagstuhl Reports, 2021)

An Updated Experimental Evaluation of Graph Bipartization Methods. - Timothy D. Goodrich; Eric Horton; Blair D. Sullivan (ACM J. Exp. Algorithmics, 2021)

Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph. - Yosuke Mizutani; Blair D. Sullivan (IPEC, 2022)

Minimizing Congestion for Balanced Dominators. - Yosuke Mizutani; Annie Staker; Blair D. Sullivan (KDD, 2022)

Gerrymandering Trees: Parameterized Hardness. - Andrew Fraser; Brian Lavallee; Blair D. Sullivan (CoRR, 2022)

Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality. - Shweta Jain 007; Yosuke Mizutani; Blair D. Sullivan (CoRR, 2022)

Improved Parameterized Complexity of Happy Set Problems. - Yosuke Mizutani; Blair D. Sullivan (CoRR, 2022)

On the threshold of intractability. - Pål Grønås Drange; Markus Fanebust Dregi; Daniel Lokshtanov; Blair D. Sullivan (J. Comput. Syst. Sci., 2022)

An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition. - Shweta Jain 007; Yosuke Mizutani; Blair D. Sullivan (ACDA, 2023)

Reducing Access Disparities in Networks using Edge Augmentation✱. - Ashkan Bashardoust; Sorelle A. Friedler; Carlos Scheidegger; Blair D. Sullivan; Suresh Venkatasubramanian (FAccT, 2023)

Cluster Editing with Overlapping Communities. - Emmanuel Arrighi; Matthias Bentert; Pål Grønås Drange; Blair D. Sullivan; Petra Wolf 002 (IPEC, 2023)

PACE Solver Description: Hydra Prime. - Yosuke Mizutani; David Dursteler; Blair D. Sullivan (IPEC, 2023)

Parameterized Complexity of Gerrymandering. - Andrew Fraser; Brian Lavallee; Blair D. Sullivan (SAGT, 2023)

Open Problems in (Hyper)Graph Decomposition. - Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; Tobias Heuer; George Karypis; Kamer Kaya; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; Darren Strash; Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; et al. (Dagstuhl Reports, 2023)

A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes. - Felix Reidl; Blair D. Sullivan (Algorithmica, 2023)

Preprocessing to Reduce the Search Space for Odd Cycle Transversal. - Bart M. P. Jansen; Yosuke Mizutani; Blair D. Sullivan; Ruben F. A. Verhaegh (IPEC, 2024)

Correlation Clustering with Vertex Splitting. - Matthias Bentert; Alex Crane; Pål Grønås Drange; Felix Reidl; Blair D. Sullivan (SWAT, 2024)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs. - Alex Crane; Brian Lavallee; Blair D. Sullivan; Nate Veldt (WSDM, 2024)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. - Yosuke Mizutani; Daniel Coimbra Salomao; Alex Crane; Matthias Bentert; Pål Grønås Drange; Felix Reidl; Alan Kuntz; Blair D. Sullivan (CoRR, 2024)

Optimizing Information Access in Networks via Edge Augmentation. - Aditya Bhaskara; Alex Crane; Md. Mumtahin Habib Ullah Mazumder; Blair D. Sullivan; Prasanth Yalamanchili (CoRR, 2024)

Fast algorithms to improve fair information access in networks. - Dennis Robert Windham; Caroline J. Wendt; Alex Crane; Sorelle A. Friedler; Blair D. Sullivan; Aaron Clauset (CoRR, 2024)

Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help? - Matthias Bentert; Daniel Coimbra Salomao; Alex Crane; Yosuke Mizutani; Felix Reidl; Blair D. Sullivan (CoRR, 2024)

Hardness of the generalized coloring numbers. - Michael Breen-McKay; Brian Lavallee; Blair D. Sullivan (Eur. J. Comb., 2025)

Preface. - Daniel Král'; Michal Pilipczuk; Sebastian Siebertz; Blair D. Sullivan (Eur. J. Comb., 2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges. - Alex Crane; Thomas Stanley; Blair D. Sullivan; Nate Veldt (CoRR, 2025)

Equalizing Closeness Centralities via Edge Additions. - Alex Crane; Sorelle A. Friedler; Mihir Patel; Blair D. Sullivan (CoRR, 2025)

Edge interventions can mitigate demographic and prestige disparities in the Computer Science coauthorship network. - Kate Barnes; Mia Ellis-Einhorn; Carolina Chávez-Ruelas; Nayera Hasan; Mohammad Fanous; Blair D. Sullivan; Sorelle A. Friedler; Aaron Clauset (CoRR, 2025)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination. - Matthias Bentert; Alex Crane; Pål Grønås Drange; Yosuke Mizutani; Blair D. Sullivan (CoRR, 2025)