Blair Sullivan

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

GENOME BIOLOGY, 21(1).

Polynomial Treedepth Bounds in Linear Colorings

ALGORITHMICA.

Faster Biclique Mining in Near-Bipartite Graphs

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

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.

Benchmarking treewidth as a practical component of tensor network simulations

PLOS ONE, 13(12), e0207827.

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). (Vol. 11). Vol. 11.

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Quantum Information Processing, 17(5).

Treedepth Bounds in Linear Colorings

In Graph-Theoretic Concepts in Computer Science (pp. 331–343).

Walk entropy and walk-regularity

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

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.

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 (pp. 71–83).

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.