Blair D. Sullivan

89 papers A* 5A 6B 9C 1Journal 59Unranked 8
YearRankTypeTitle / Venue / Authors
2025 — conf
A Space-Efficient Algebraic Approach to Robotic Motion Planning.
ACDA
Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani, Felix Reidl, Blair D. Sullivan
2025 J jnl
Aggregating maximal cliques in real-world graphs.
CoRR
Noga Alon, Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub Lacki, Blair D. Sullivan
2025 J jnl
Edge interventions can mitigate demographic and prestige disparities in the Computer Science coauthorship network.
CoRR
Kate Barnes, Mia Ellis-Einhorn, Carolina Chávez-Ruelas, Nayera Hasan, Mohammad Fanous, Blair D. Sullivan, Sorelle A. Friedler, Aaron Clauset
2025 A* conf
Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges.
ICML
Alex Crane, Thomas Stanley, Blair D. Sullivan, Nate Veldt
2025 J jnl
Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges.
CoRR
Alex Crane, Thomas Stanley, Blair D. Sullivan, Nate Veldt
2025 J jnl
Equalizing Closeness Centralities via Edge Additions.
CoRR
Alex Crane, Sorelle A. Friedler, Mihir Patel, Blair D. Sullivan
2025 J jnl
Hardness of the generalized coloring numbers.
Eur. J. Comb.
Michael Breen-McKay, Brian Lavallee, Blair D. Sullivan
2025 J jnl
Preface.
Eur. J. Comb.
Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan
2025 J jnl
Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination.
CoRR
Matthias Bentert, Alex Crane, Pål Grønås Drange, Yosuke Mizutani, Blair D. Sullivan
2024 — conf
Correlation Clustering with Vertex Splitting.
SWAT
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
2024 J jnl
Correlation Clustering with Vertex Splitting.
CoRR
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan
2024 J jnl
Fast algorithms to improve fair information access in networks.
CoRR
Dennis Robert Windham, Caroline J. Wendt, Alex Crane, Sorelle A. Friedler, Blair D. Sullivan, Aaron Clauset
2024 J jnl
Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help?
CoRR
Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani, Felix Reidl, Blair D. Sullivan
2024 J jnl
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning.
CoRR
Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan
2024 J jnl
Optimizing Information Access in Networks via Edge Augmentation.
CoRR
Aditya Bhaskara, Alex Crane, Md. Mumtahin Habib Ullah Mazumder, Blair D. Sullivan, Prasanth Yalamanchili
2024 A conf
Overlapping and Robust Edge-Colored Clustering in Hypergraphs.
WSDM
Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt
2024 B conf
Preprocessing to Reduce the Search Space for Odd Cycle Transversal.
IPEC
Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh
2024 J jnl
Preprocessing to Reduce the Search Space for Odd Cycle Transversal.
CoRR
Bart M. P. Jansen, Yosuke Mizutani, Blair D. Sullivan, Ruben F. A. Verhaegh
2023 J jnl
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes.
Algorithmica
Felix Reidl, Blair D. Sullivan
2023 — conf
An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition.
ACDA
Shweta Jain, Yosuke Mizutani, Blair D. Sullivan
2023 B conf
Cluster Editing with Overlapping Communities.
IPEC
Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf
2023 J jnl
Open Problems in (Hyper)Graph Decomposition.
CoRR
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
2023 J jnl
Overlapping and Robust Edge-Colored Clustering in Hypergraphs.
CoRR
Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt
2023 B conf
PACE Solver Description: Hydra Prime.
IPEC
Yosuke Mizutani, David Dursteler, Blair D. Sullivan
2023 B conf
Parameterized Complexity of Gerrymandering.
SAGT
Andrew Fraser, Brian Lavallee, Blair D. Sullivan
2023 J jnl
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).
Dagstuhl Reports
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
2023 — conf
Reducing Access Disparities in Networks using Edge Augmentation✱.
FAccT
Ashkan Bashardoust, Sorelle A. Friedler, Carlos Scheidegger, Blair D. Sullivan, Suresh Venkatasubramanian
2022 J jnl
Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality.
CoRR
Shweta Jain, Yosuke Mizutani, Blair D. Sullivan
2022 J jnl
Gerrymandering Trees: Parameterized Hardness.
CoRR
Andrew Fraser, Brian Lavallee, Blair D. Sullivan
2022 J jnl
Improved Parameterized Complexity of Happy Set Problems.
CoRR
Yosuke Mizutani, Blair D. Sullivan
2022 A* conf
Minimizing Congestion for Balanced Dominators.
KDD
Yosuke Mizutani, Annie Staker, Blair D. Sullivan
2022 J jnl
On the threshold of intractability.
J. Comput. Syst. Sci.
Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan
2022 B conf
Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph.
IPEC
Yosuke Mizutani, Blair D. Sullivan
2022 J jnl
Reducing Access Disparities in Networks using Edge Augmentation.
CoRR
Ashkan Bashardoust, Sorelle A. Friedler, Carlos Eduardo Scheidegger, Blair D. Sullivan, Suresh Venkatasubramanian
2021 J jnl
An Updated Experimental Evaluation of Graph Bipartization Methods.
ACM J. Exp. Algorithmics
Timothy D. Goodrich, Eric Horton, Blair D. Sullivan
2021 J jnl
Hardness of the Generalized Coloring Numbers.
CoRR
Michael Breen-McKay, Brian Lavallee, Blair D. Sullivan
2021 — conf
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition.
ACDA
Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan
2021 J jnl
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition.
CoRR
Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan
2021 J jnl
Polynomial Treedepth Bounds in Linear Colorings.
Algorithmica
Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan
2021 — ed.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021
ACDA
Michael Bender, John Gilbert, Bruce Hendrickson, Blair D. Sullivan
2021 J jnl
Sparse dominating sets and balanced neighborhood partitioning.
CoRR
Yosuke Mizutani, Annie Staker, Blair D. Sullivan
2021 J jnl
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391).
Dagstuhl Reports
Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan
2020 J jnl
A color-avoiding approach to subgraph counting in bounded expansion classes.
CoRR
Felix Reidl, Blair D. Sullivan
2020 A conf
Approximating Vertex Cover using Structural Rounding.
ALENEX
Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel
2019 J jnl
Approximating Vertex Cover using Structural Rounding.
CoRR
Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel
2019 — conf
Faster Biclique Mining in Near-Bipartite Graphs.
SEA²
Blair D. Sullivan, Andrew van der Poel, Trey Woodlief
2019 J jnl
Faster Biclique Mining in Near-Bipartite Graphs.
CoRR
Blair D. Sullivan, Andrew van der Poel, Trey Woodlief
2019 A conf
Mining Maximal Induced Bicliques using Odd Cycle Transversals.
SDM
Kyle Kloster, Blair D. Sullivan, Andrew van der Poel
2019 A conf
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.
ESA
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel
2019 J jnl
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs.
J. Comput. Syst. Sci.
Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
2018 A conf
A practical fpt algorithm for Flow Decomposition and transcript assembly.
ALENEX
Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel
2018 J jnl
Benchmarking treewidth as a practical component of tensor-network-based quantum simulation.
CoRR
Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich, Travis S. Humble, Blair D. Sullivan, Andrew L. Wright
2018 J jnl
Mining Maximal Induced Bicliques using Odd Cycle Transversals.
CoRR
Kyle Kloster, Blair D. Sullivan, Andrew van der Poel
2018 J jnl
Optimizing adiabatic quantum program compilation using a graph-theoretic framework.
Quantum Inf. Process.
Timothy D. Goodrich, Blair D. Sullivan, Travis S. Humble
2018 J jnl
Practical Graph Bipartization with Applications in Near-Term Quantum Computing.
CoRR
Timothy D. Goodrich, Eric Horton, Blair D. Sullivan
2018 J jnl
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.
CoRR
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel
2018 B conf
Treedepth Bounds in Linear Colorings.
WG
Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan
2018 J jnl
Treedepth Bounds in Linear Colorings.
CoRR
Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan
2018 J jnl
When Centrality Measures Deceive Us.
CoRR
Eric Horton, Kyle Kloster, Blair D. Sullivan
2017 J jnl
A practical fpt algorithm for Flow Decomposition and transcript assembly.
CoRR
Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel
2017 B conf
Being Even Slightly Shallow Makes Life Hard.
MFCS
Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan
2017 J jnl
Being even slightly shallow makes life hard.
CoRR
Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan
2017 J jnl
Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion.
CoRR
Michael P. O'Brien, Blair D. Sullivan
2017 J jnl
Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework.
CoRR
Timothy D. Goodrich, Blair D. Sullivan, Travis S. Humble
2016 B conf
A Fast Parameterized Algorithm for Co-Path Set.
IPEC
Blair D. Sullivan, Andrew van der Poel
2016 J jnl
A Fast Parameterized Algorithm for Co-Path Set.
CoRR
Blair D. Sullivan, Andrew van der Poel
2016 J jnl
A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization.
Soc. Netw. Anal. Min.
Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan
2016 A* conf
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models.
ICDM
Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel
2016 J jnl
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models.
CoRR
Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel
2016 J jnl
Tree decompositions and social graphs.
Internet Math.
Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney
2015 C conf
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs.
WAW
Matthew Farrell, Timothy D. Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
2015 B conf
Multi-Level Anomaly Detection on Time-Varying Graph Data.
ASONAM
Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan
2015 A conf
On the Threshold of Intractability.
ESA
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
2015 J jnl
On the Threshold of Intractability.
CoRR
Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan
2015 J jnl
Zig-Zag Numberlink is NP-Complete.
J. Inf. Process.
Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
2014 J jnl
Adiabatic quantum programming: minor embedding with hard faults.
Quantum Inf. Process.
Christine Klymko, Blair D. Sullivan, Travis S. Humble
2014 J jnl
Hyperbolicity, degeneracy, and expansion of random intersection graphs.
CoRR
Matthew Farrell, Timothy Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
2014 A* conf
Locally Estimating Core Numbers.
ICDM
Michael P. O'Brien, Blair D. Sullivan
2014 J jnl
Locally Estimating Core Numbers.
CoRR
Michael P. O'Brien, Blair D. Sullivan
2014 J jnl
Multi-Level Anomaly Detection on Streaming Graph Data.
CoRR
Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan
2014 J jnl
Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms.
CoRR
Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
2014 J jnl
Tree decompositions and social graphs.
CoRR
Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney
2014 J jnl
Zig-Zag Numberlink is NP-Complete.
CoRR
Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan
2013 — conf
Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity.
IWOMP
Aaron B. Adcock, Blair D. Sullivan, Oscar R. Hernandez, Michael W. Mahoney
2013 — conf
Parallel Algorithms for Graph Optimization Using Tree Decompositions.
IPDPS Workshops
Blair D. Sullivan, Dinesh Weerapurage, Chris Groër
2013 A* conf
Tree-Like Structure in Large Social and Information Networks.
ICDM
Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney
2011 J jnl
A mathematical analysis of the R-MAT random graph generator.
Networks
Christopher Groër, Blair D. Sullivan, Steve Poole
2010 J jnl
Counting paths in digraphs.
Eur. J. Comb.
Paul D. Seymour, Blair D. Sullivan
2008 J jnl
Cycles in dense digraphs.
Comb.
Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan