Blair D. Sullivan

Faster Decomposition ofWeighted Graphs into Cliques using Fisher's Inequality

ArXiv.

Gerrymandering Trees: Parameterized Hardness

ArXiv.

Improved Parameterized Complexity of Happy Set Problems

ArXiv.

On the threshold of intractability

Journal of Computer and System Sciences, 124, 1–25.

An Updated Experimental Evaluation of Graph Bipartization Methods

ACM Journal of Experimental Algorithmics, 26.

Hardness of the Generalized Coloring Numbers

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85121786987&partnerID=MN8TOARS

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85108789587&partnerID=MN8TOARS

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition

SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21), 111–122.

Projecting genetic associations through gene expression patterns highlights disease etiology and drug mechanisms

BioRxiv.

Secondary Structure Ensemble Analysis via Community Detection

In Association for Women in Mathematics Series (Vol. 22, pp. 55–81).

Sparse dominating sets and balanced neighborhood partitioning

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85121833484&partnerID=MN8TOARS

A color-avoiding approach to subgraph counting in bounded expansion classes

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85095561220&partnerID=MN8TOARS

Approximating vertex cover using structural rounding

Proceedings of the Workshop on Algorithm Engineering and Experiments, 2020-January, 70–80.

Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity

GENOME BIOLOGY, 21(1).

Polynomial Treedepth Bounds in Linear Colorings

ALGORITHMICA, Vol. 83, pp. 361–386.

Approximating vertex cover using structural rounding

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094768942&partnerID=MN8TOARS

Faster Biclique Mining in Near-Bipartite Graphs

ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, pp. 424–453.

Mining maximal induced bicliques using odd cycle transversals

SIAM International Conference on Data Mining, SDM 2019, 324–332.

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class

27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019).

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs

Journal of Computer and System Sciences, 105, 199–241.

Subgraph centrality and walk-regularity

Linear Algebra and Its Applications, 570, 225–244.

A practical fpt algorithm for flow decomposition and transcript assembly

Proceedings of the Workshop on Algorithm Engineering and Experiments, 2018-January, 75–86.

An updated experimental evaluation of graph bipartization methods

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85104339918&partnerID=MN8TOARS

Benchmarking treewidth as a practical component of tensor network simulations

PLOS ONE, 13(12), e0207827.

Benchmarking treewidth as a practical component of tensor-network–based quantum simulation

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85095245427&partnerID=MN8TOARS

Exploring neighborhoods in large metagenome assembly graphs reveals hidden sequence diversity

Brown, C. T., Moritz, D., O’Brien, M. P., Reidl, F., Reiter, T., & Sullivan, B. D. (2018, November 5). BioRxiv, Vol. 11.

Mining maximal induced bicliques using odd cycle transversals

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85093320378&partnerID=MN8TOARS

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Quantum Information Processing, 17(5).

Polynomial treedepth bounds in linear colorings

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85092833264&partnerID=MN8TOARS

Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094277709&partnerID=MN8TOARS

Subgraph centrality and walk-regularity

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85093754399&partnerID=MN8TOARS

Treedepth Bounds in Linear Colorings

In Graph-Theoretic Concepts in Computer Science: Vol. 11159 LNCS (pp. 331–343).

Walk entropy and walk-regularity

Linear Algebra and Its Applications, 546, 115–121.

A fast parameterized algorithm for Co-Path Set

Leibniz International Proceedings in Informatics, LIPIcs, 63.

A practical fpt algorithm for flow decomposition and transcript assembly

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094353595&partnerID=MN8TOARS

An experimental evaluation of a bounded expansion algorithmic pipeline

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85092949285&partnerID=MN8TOARS

Asymptotic analysis of equivalences and core-structures in kronecker-style graph models

Proceedings - IEEE International Conference on Data Mining, ICDM, 829–834.

Being even slightly shallow makes life hard

ArXiv.

Being even slightly shallow makes life hard

Leibniz International Proceedings in Informatics, LIPIcs, 83.

Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85095056109&partnerID=MN8TOARS

Walk entropy and walk-regularity

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094268676&partnerID=MN8TOARS

A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization

Social Network Analysis and Mining, 6(1).

Asymptotic analysis of equivalences and core-structures in Kronecker-style graph models

2016 ieee 16th international conference on data mining (icdm), 829–834.

Tree decompositions and social graphs

Internet Mathematics, 12(5), 315–361.

Hyperbolicity, degeneracy, and expansion of random intersection graphs

Algorithms and models for the web graph, (waw 2015), 9479, 29–41.

Multi-level anomaly detection on time-varying graph data

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2015), 579–583.

On the threshold of intractability

Algorithms - esa 2015, 9294, 411–423.

Zig-Zag Numberlink is NP-Complete

Journal of Information Processing, 23(3), 239–245.

An integrated programming and development environment for adiabatic quantum optimization

Computational Science and Discovery, 7(1).

Locally Estimating Core Numbers

Proceedings - IEEE International Conference on Data Mining, ICDM, 2015-January(January), 460–469.

Adiabatic quantum programming: minor embedding with hard faults

Quantum Information Processing, 13(3), 709–729.

Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity

In OpenMP in the Era of Low Power Devices and Accelerators: Vol. 8122 LNCS (pp. 71–83).

On a conjecture of Andrica and Tomescu

Journal of Integer Sequences, 16(3). http://www.scopus.com/inward/record.url?eid=2-s2.0-84880061040&partnerID=MN8TOARS

Parallel algorithms for graph optimization using tree decompositions

Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, 1838–1847.

Tree-Like Structure in Large Social and Information Networks

2013 IEEE 13th International Conference on Data Mining, 1–10.

A mathematical analysis of the R-MAT random graph generator

Networks, 58(3), 159–170.

Counting paths in digraphs

European Journal of Combinatorics, 31(3), 961–975.

Cycles in dense digraphs

Combinatorica, 28(1), 1–18.