Blair Sullivan

Brown, C. T., Moritz, D., Michael P. O'Brien, Reidl, F., Reiter, T., & Sullivan, B. D. (2020). Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity. GENOME BIOLOGY, 21(1). https://doi.org/10.1186/s13059-020-02066-4

Kun, J., Michael P. O'Brien, Pilipczuk, M., & Sullivan, B. D. (2020). Polynomial Treedepth Bounds in Linear Colorings. ALGORITHMICA. https://doi.org/10.1007/s00453-020-00760-0

Sullivan, B. D., Poel, A., & Woodlief, T. (2019). Faster Biclique Mining in Near-Bipartite Graphs. ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, pp. 424–453. https://doi.org/10.1007/978-3-030-34029-2_28

Demaine, E. D., Goodrich, T. D., Kloster, K., Lavallee, B., Liu, Q. C., Sullivan, B. D., … Poel, A. (2019). Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019). https://doi.org/10.4230/LIPIcs.ESA.2019.37

Demaine, E. D., Reidl, F., Rossmanith, P., Villaamil, F. S., Sikdar, S., & Sullivan, B. D. (2019). Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. Journal of Computer and System Sciences, 105, 199–241. https://doi.org/10.1016/j.jcss.2019.05.004

Horton, E., Kloster, K., & Sullivan, B. D. (2019). Subgraph centrality and walk-regularity. Linear Algebra and Its Applications, 570, 225–244. https://doi.org/10.1016/j.laa.2019.02.005

Dumitrescu, E. F., Fisher, A. L., Goodrich, T. D., Humble, T. S., Sullivan, B. D., & Wright, A. L. (2018). Benchmarking treewidth as a practical component of tensor network simulations. PLOS ONE, 13(12), e0207827. https://doi.org/10.1371/journal.pone.0207827

Brown, C. T., Moritz, D., O’Brien, M. P., Reidl, F., Reiter, T., & Sullivan, B. D. (2018, November 5). Exploring neighborhoods in large metagenome assembly graphs reveals hidden sequence diversity (Vol. 11). Vol. 11. https://doi.org/10.1101/462788

Goodrich, T. D., Sullivan, B. D., & Humble, T. S. (2018). Optimizing adiabatic quantum program compilation using a graph-theoretic framework. Quantum Information Processing, 17(5). https://doi.org/10.1007/S11128-018-1863-4

Kun, J., O’Brien, M. P., & Sullivan, B. D. (2018). Treedepth Bounds in Linear Colorings. In Graph-Theoretic Concepts in Computer Science (pp. 331–343). https://doi.org/10.1007/978-3-030-00256-5_27

Kloster, K., Král', D., & Sullivan, B. D. (2018). Walk entropy and walk-regularity. Linear Algebra and Its Applications, 546, 115–121. https://doi.org/10.1016/j.laa.2018.02.009

Bridges, R. A., Collins, J., Ferragut, E. M., Laska, J., & Sullivan, B. D. (2016). A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization. Social Network Analysis and Mining, 6(1). https://doi.org/10.1007/S13278-016-0409-Y

Chin, A. J., Goodrich, T. D., O'Brien, M. P., Reidl, F., Sullivan, B. D., & Poel, A. (2016). Asymptotic analysis of equivalences and core-structures in Kronecker-style graph models. 2016 ieee 16th international conference on data mining (icdm), 829–834. https://doi.org/10.1109/icdm.2016.0098

Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2016). Tree decompositions and social graphs. Internet Mathematics, 12(5), 315–361. https://doi.org/10.1080/15427951.2016.1182952

Farrell, M., Goodrich, T. D., Lemons, N., Reidl, F., Villaamil, F. S., & Sullivan, B. D. (2015). Hyperbolicity, degeneracy, and expansion of random intersection graphs. Algorithms and models for the web graph, (waw 2015), 9479, 29–41. https://doi.org/10.1007/978-3-319-26784-5_3

Bridges, R. A., Collins, J. P., Ferragut, E. M., Laska, J. A., & Sullivan, B. D. (2015). 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. https://doi.org/10.1145/2808797.2809406

Drange, P. G., Dregi, M. S., Lokshtanov, D., & Sullivan, B. D. (2015). On the threshold of intractability. Algorithms - esa 2015, 9294, 411–423. https://doi.org/10.1007/978-3-662-48350-3_35

Klymko, C., Sullivan, B. D., & Humble, T. S. (2013). Adiabatic quantum programming: minor embedding with hard faults. Quantum Information Processing, 13(3), 709–729. https://doi.org/10.1007/S11128-013-0683-9

Adcock, A. B., Sullivan, B. D., Hernandez, O. R., & Mahoney, M. W. (2013). 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). https://doi.org/10.1007/978-3-642-40698-0_6

Groër, C., Sullivan, B. D., & Poole, S. (2011). A mathematical analysis of the R-MAT random graph generator. Networks, 58(3), 159–170. https://doi.org/10.1002/net.20417

Seymour, P., & Sullivan, B. D. (2010). Counting paths in digraphs. European Journal of Combinatorics, 31(3), 961–975. https://doi.org/10.1016/j.ejc.2009.05.008

Chudnovsky, M., Seymour, P., & Sullivan, B. (2008). Cycles in dense digraphs. Combinatorica, 28(1), 1–18. https://doi.org/10.1007/S00493-008-2331-Z