Blair D. Sullivan

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 56

Top Topics

Tree Decompositions

Complex Networks

Parameterized Complexity

Top Venues

J. Comput. Syst. Sci.

Publications

Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. CoRR (2024)
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
Correlation Clustering with Vertex Splitting. SWAT (2024)
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
Correlation Clustering with Vertex Splitting. CoRR (2024)
Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt
Overlapping and Robust Edge-Colored Clustering in Hypergraphs. WSDM (2024)
Aditya Bhaskara, Alex Crane, Md. Mumtahin Habib Ullah Mazumder, Blair D. Sullivan, Prasanth Yalamanchili
Optimizing Information Access in Networks via Edge Augmentation. CoRR (2024)
Shweta Jain, Yosuke Mizutani, Blair D. Sullivan
An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition. ACDA (2023)
Felix Reidl, Blair D. Sullivan
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes. Algorithmica 85 (8) (2023)
Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt
Overlapping and Robust Edge-Colored Clustering in Hypergraphs. CoRR (2023)
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, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
Open Problems in (Hyper)Graph Decomposition. CoRR (2023)
Ashkan Bashardoust, Sorelle A. Friedler, Carlos Scheidegger, Blair D. Sullivan, Suresh Venkatasubramanian
Reducing Access Disparities in Networks using Edge Augmentation✱. FAccT (2023)
Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf
Cluster Editing with Overlapping Communities. IPEC (2023)
Andrew Fraser, Brian Lavallee, Blair D. Sullivan
Parameterized Complexity of Gerrymandering. SAGT (2023)
Yosuke Mizutani, David Dursteler, Blair D. Sullivan
PACE Solver Description: Hydra Prime. IPEC (2023)
George Karypis, Christian Schulz, 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, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13 (8) (2023)
Shweta Jain, Yosuke Mizutani, Blair D. Sullivan
Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality. CoRR (2022)
Andrew Fraser, Brian Lavallee, Blair D. Sullivan
Gerrymandering Trees: Parameterized Hardness. CoRR (2022)
Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan
On the threshold of intractability. J. Comput. Syst. Sci. 124 (2022)
Yosuke Mizutani, Annie Staker, Blair D. Sullivan
Minimizing Congestion for Balanced Dominators. KDD (2022)
Yosuke Mizutani, Blair D. Sullivan
Improved Parameterized Complexity of Happy Set Problems. CoRR (2022)
Ashkan Bashardoust, Sorelle A. Friedler, Carlos Eduardo Scheidegger, Blair D. Sullivan, Suresh Venkatasubramanian
Reducing Access Disparities in Networks using Edge Augmentation. CoRR (2022)
Yosuke Mizutani, Blair D. Sullivan
Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph. IPEC (2022)
Timothy D. Goodrich, Eric Horton, Blair D. Sullivan
An Updated Experimental Evaluation of Graph Bipartization Methods. ACM J. Exp. Algorithmics 26 (2021)
Michael Breen-McKay, Brian Lavallee, Blair D. Sullivan
Hardness of the Generalized Coloring Numbers. CoRR (2021)
Yosuke Mizutani, Annie Staker, Blair D. Sullivan
Sparse dominating sets and balanced neighborhood partitioning. CoRR (2021)
Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. ACDA (2021)
Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan
Polynomial Treedepth Bounds in Linear Colorings. Algorithmica 83 (1) (2021)
Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. CoRR (2021)
Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports 11 (8) (2021)
Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel
Approximating Vertex Cover using Structural Rounding. ALENEX (2020)
Felix Reidl, Blair D. Sullivan
A color-avoiding approach to subgraph counting in bounded expansion classes. CoRR (2020)
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA (2019)
Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. J. Comput. Syst. Sci. 105 (2019)
Blair D. Sullivan, Andrew van der Poel, Trey Woodlief
Faster Biclique Mining in Near-Bipartite Graphs. CoRR (2019)
Kyle Kloster, Blair D. Sullivan, Andrew van der Poel
Mining Maximal Induced Bicliques using Odd Cycle Transversals. SDM (2019)
Blair D. Sullivan, Andrew van der Poel, Trey Woodlief
Faster Biclique Mining in Near-Bipartite Graphs. SEA² (2019)
Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel
Approximating Vertex Cover using Structural Rounding. CoRR (2019)
Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel
A practical fpt algorithm for Flow Decomposition and transcript assembly. ALENEX (2018)
Kyle Kloster, Blair D. Sullivan, Andrew van der Poel
Mining Maximal Induced Bicliques using Odd Cycle Transversals. CoRR (2018)
Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan
Treedepth Bounds in Linear Colorings. WG (2018)
Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan
Treedepth Bounds in Linear Colorings. CoRR (2018)
Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich, Travis S. Humble, Blair D. Sullivan, Andrew L. Wright
Benchmarking treewidth as a practical component of tensor-network-based quantum simulation. CoRR (2018)
Eric Horton, Kyle Kloster, Blair D. Sullivan
When Centrality Measures Deceive Us. CoRR (2018)
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. CoRR (2018)
Timothy D. Goodrich, Eric Horton, Blair D. Sullivan
Practical Graph Bipartization with Applications in Near-Term Quantum Computing. CoRR (2018)
Timothy D. Goodrich, Blair D. Sullivan, Travis S. Humble
Optimizing adiabatic quantum program compilation using a graph-theoretic framework. Quantum Inf. Process. 17 (5) (2018)
Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan
Being even slightly shallow makes life hard. CoRR (2017)
Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel
A practical fpt algorithm for Flow Decomposition and transcript assembly. CoRR (2017)
Timothy D. Goodrich, Blair D. Sullivan, Travis S. Humble
Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework. CoRR (2017)
Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan
Being Even Slightly Shallow Makes Life Hard. MFCS (2017)
Michael P. O'Brien, Blair D. Sullivan
Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion. CoRR (2017)
Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney
Tree decompositions and social graphs. Internet Math. 12 (5) (2016)
Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. ICDM (2016)
Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan
A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization. Soc. Netw. Anal. Min. 6 (1) (2016)
Blair D. Sullivan, Andrew van der Poel
A Fast Parameterized Algorithm for Co-Path Set. CoRR (2016)
Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. CoRR (2016)
Blair D. Sullivan, Andrew van der Poel
A Fast Parameterized Algorithm for Co-Path Set. IPEC (2016)
Matthew Farrell, Timothy D. Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs. WAW (2015)
Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
Zig-Zag Numberlink is NP-Complete. J. Inf. Process. 23 (3) (2015)
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
On the Threshold of Intractability. ESA (2015)
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
On the Threshold of Intractability. CoRR (2015)
Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan
Multi-Level Anomaly Detection on Time-Varying Graph Data. ASONAM (2015)
Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney
Tree decompositions and social graphs. CoRR (2014)
Christine Klymko, Blair D. Sullivan, Travis S. Humble
Adiabatic quantum programming: minor embedding with hard faults. Quantum Inf. Process. 13 (3) (2014)
Matthew Farrell, Timothy Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
Hyperbolicity, degeneracy, and expansion of random intersection graphs. CoRR (2014)
Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
Zig-Zag Numberlink is NP-Complete. CoRR (2014)
Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. CoRR (2014)
Michael P. O'Brien, Blair D. Sullivan
Locally Estimating Core Numbers. ICDM (2014)
Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan
Multi-Level Anomaly Detection on Streaming Graph Data. CoRR (2014)
Michael P. O'Brien, Blair D. Sullivan
Locally Estimating Core Numbers. CoRR (2014)
Aaron B. Adcock, Blair D. Sullivan, Oscar R. Hernandez, Michael W. Mahoney
Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity. IWOMP (2013)
Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney
Tree-Like Structure in Large Social and Information Networks. ICDM (2013)
Blair D. Sullivan, Dinesh Weerapurage, Chris Groër
Parallel Algorithms for Graph Optimization Using Tree Decompositions. IPDPS Workshops (2013)
Christopher Groër, Blair D. Sullivan, Steve Poole
A mathematical analysis of the R-MAT random graph generator. Networks 58 (3) (2011)
Paul D. Seymour, Blair D. Sullivan
Counting paths in digraphs. Eur. J. Comb. 31 (3) (2010)
Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan
Cycles in dense digraphs. Comb. 28 (1) (2008)