@article{brown_moritz_michael p. o'brien_reidl_reiter_sullivan_2020, title={Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity}, volume={21}, ISBN={1474-760X}, DOI={10.1186/s13059-020-02066-4}, number={1}, journal={GENOME BIOLOGY}, author={Brown, C. Titus and Moritz, Dominik and Michael P. O'Brien and Reidl, Felix and Reiter, Taylor and Sullivan, Blair D.}, year={2020} }
 @article{kun_michael p. o'brien_pilipczuk_sullivan_2020, title={Polynomial Treedepth Bounds in Linear Colorings}, ISBN={1432-0541}, DOI={10.1007/s00453-020-00760-0}, journal={ALGORITHMICA}, author={Kun, Jeremy and Michael P. O'Brien and Pilipczuk, Marcin and Sullivan, Blair D.}, year={2020} }
 @article{sullivan_poel_woodlief_2019, series={Lecture Notes in Computer Science}, title={Faster Biclique Mining in Near-Bipartite Graphs}, volume={11544}, ISBN={1611-3349}, DOI={10.1007/978-3-030-34029-2_28}, journal={ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019}, author={Sullivan, Blair D. and Poel, Andrew and Woodlief, Trey}, year={2019}, pages={424–453}, collection={Lecture Notes in Computer Science} }
 @article{demaine_goodrich_kloster_lavallee_liu_sullivan_vakilian_poel_2019, series={Leibniz International Proceedings in Informatics}, title={Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class}, volume={144}, ISBN={1868-8969}, DOI={10.4230/LIPIcs.ESA.2019.37}, journal={27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019)}, author={Demaine, Erik D. and Goodrich, Timothy D. and Kloster, Kyle and Lavallee, Brian and Liu, Quanquan C. and Sullivan, Blair D. and Vakilian, Ali and Poel, Andrew}, year={2019}, collection={Leibniz International Proceedings in Informatics} }
 @article{demaine_reidl_rossmanith_villaamil_sikdar_sullivan_2019, title={Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs}, volume={105}, DOI={10.1016/j.jcss.2019.05.004}, journal={Journal of Computer and System Sciences}, publisher={Elsevier BV}, author={Demaine, Erik D. and Reidl, Felix and Rossmanith, Peter and Villaamil, Fernando Sánchez and Sikdar, Somnath and Sullivan, Blair D.}, year={2019}, month={Nov}, pages={199–241} }
 @article{horton_kloster_sullivan_2019, title={Subgraph centrality and walk-regularity}, volume={570}, DOI={10.1016/j.laa.2019.02.005}, journal={Linear Algebra and its Applications}, publisher={Elsevier BV}, author={Horton, Eric and Kloster, Kyle and Sullivan, Blair D.}, year={2019}, month={Jun}, pages={225–244} }
 @article{dumitrescu_fisher_goodrich_humble_sullivan_wright_2018, title={Benchmarking treewidth as a practical component of tensor network simulations}, volume={13}, DOI={10.1371/journal.pone.0207827}, number={12}, journal={PLOS ONE}, publisher={Public Library of Science (PLoS)}, author={Dumitrescu, Eugene F. and Fisher, Allison L. and Goodrich, Timothy D. and Humble, Travis S. and Sullivan, Blair D. and Wright, Andrew L.}, editor={Torre, Emanuele G. DallaEditor}, year={2018}, month={Dec}, pages={e0207827} }
 @article{brown_moritz_o’brien_reidl_reiter_sullivan_2018, title={Exploring neighborhoods in large metagenome assembly graphs reveals hidden sequence diversity}, volume={11}, DOI={10.1101/462788}, publisher={Cold Spring Harbor Laboratory}, author={Brown, C. Titus and Moritz, Dominik and O’Brien, Michael P. and Reidl, Felix and Reiter, Taylor and Sullivan, Blair D.}, year={2018}, month={Nov} }
 @article{goodrich_sullivan_humble_2018, title={Optimizing adiabatic quantum program compilation using a graph-theoretic framework}, volume={17}, ISSN={1570-0755 1573-1332}, url={http://dx.doi.org/10.1007/S11128-018-1863-4}, DOI={10.1007/S11128-018-1863-4}, number={5}, journal={Quantum Information Processing}, publisher={Springer Science and Business Media LLC}, author={Goodrich, Timothy D. and Sullivan, Blair D. and Humble, Travis S.}, year={2018}, month={Apr} }
 @inbook{kun_o’brien_sullivan_2018, title={Treedepth Bounds in Linear Colorings}, ISBN={9783030002558 9783030002565}, ISSN={0302-9743 1611-3349}, url={http://dx.doi.org/10.1007/978-3-030-00256-5_27}, DOI={10.1007/978-3-030-00256-5_27}, booktitle={Graph-Theoretic Concepts in Computer Science}, publisher={Springer International Publishing}, author={Kun, Jeremy and O’Brien, Michael P. and Sullivan, Blair D.}, year={2018}, pages={331–343} }
 @article{kloster_král'_sullivan_2018, title={Walk entropy and walk-regularity}, volume={546}, DOI={10.1016/j.laa.2018.02.009}, journal={Linear Algebra and its Applications}, publisher={Elsevier BV}, author={Kloster, Kyle and Král', Daniel and Sullivan, Blair D.}, year={2018}, month={Jun}, pages={115–121} }
 @article{bridges_collins_ferragut_laska_sullivan_2016, title={A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization}, volume={6}, ISSN={1869-5450 1869-5469}, url={http://dx.doi.org/10.1007/S13278-016-0409-Y}, DOI={10.1007/S13278-016-0409-Y}, number={1}, journal={Social Network Analysis and Mining}, publisher={Springer Science and Business Media LLC}, author={Bridges, Robert A. and Collins, John and Ferragut, Erik M. and Laska, Jason and Sullivan, Blair D.}, year={2016}, month={Oct} }
 @inproceedings{chin_goodrich_o'brien_reidl_sullivan_poel_2016, title={Asymptotic analysis of equivalences and core-structures in Kronecker-style graph models}, DOI={10.1109/icdm.2016.0098}, booktitle={2016 ieee 16th international conference on data mining (icdm)}, author={Chin, A. J. and Goodrich, T. D. and O'Brien, M. P. and Reidl, F. and Sullivan, Blair D. and Poel, A.}, year={2016}, pages={829–834} }
 @article{adcock_sullivan_mahoney_2016, title={Tree decompositions and social graphs}, volume={12}, DOI={10.1080/15427951.2016.1182952}, number={5}, journal={Internet Mathematics}, author={Adcock, A. B. and Sullivan, Blair D. and Mahoney, M. W.}, year={2016}, pages={315–361} }
 @inproceedings{farrell_goodrich_lemons_reidl_villaamil_sullivan_2015, title={Hyperbolicity, degeneracy, and expansion of random intersection graphs}, volume={9479}, DOI={10.1007/978-3-319-26784-5_3}, booktitle={Algorithms and models for the web graph, (waw 2015)}, author={Farrell, M. and Goodrich, T. D. and Lemons, N. and Reidl, F. and Villaamil, F. S. and Sullivan, Blair D.}, year={2015}, pages={29–41} }
 @inproceedings{bridges_collins_ferragut_laska_sullivan_2015, title={Multi-level anomaly detection on time-varying graph data}, DOI={10.1145/2808797.2809406}, booktitle={Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2015)}, author={Bridges, R. A. and Collins, J. P. and Ferragut, E. M. and Laska, J. A. and Sullivan, Blair D.}, year={2015}, pages={579–583} }
 @inproceedings{drange_dregi_lokshtanov_sullivan_2015, title={On the threshold of intractability}, volume={9294}, DOI={10.1007/978-3-662-48350-3_35}, booktitle={Algorithms - esa 2015}, author={Drange, P. G. and Dregi, M. S. and Lokshtanov, D. and Sullivan, Blair D.}, year={2015}, pages={411–423} }
 @article{klymko_sullivan_humble_2013, title={Adiabatic quantum programming: minor embedding with hard faults}, volume={13}, ISSN={1570-0755 1573-1332}, url={http://dx.doi.org/10.1007/S11128-013-0683-9}, DOI={10.1007/S11128-013-0683-9}, number={3}, journal={Quantum Information Processing}, publisher={Springer Science and Business Media LLC}, author={Klymko, Christine and Sullivan, Blair D. and Humble, Travis S.}, year={2013}, month={Nov}, pages={709–729} }
 @inbook{adcock_sullivan_hernandez_mahoney_2013, title={Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity}, ISBN={9783642406973 9783642406980}, ISSN={0302-9743 1611-3349}, url={http://dx.doi.org/10.1007/978-3-642-40698-0_6}, DOI={10.1007/978-3-642-40698-0_6}, booktitle={OpenMP in the Era of Low Power Devices and Accelerators}, publisher={Springer Berlin Heidelberg}, author={Adcock, Aaron B. and Sullivan, Blair D. and Hernandez, Oscar R. and Mahoney, Michael W.}, year={2013}, pages={71–83} }
 @article{groër_sullivan_poole_2011, title={A mathematical analysis of the R-MAT random graph generator}, volume={58}, ISSN={0028-3045}, url={http://dx.doi.org/10.1002/net.20417}, DOI={10.1002/net.20417}, number={3}, journal={Networks}, publisher={Wiley}, author={Groër, Chris and Sullivan, Blair D. and Poole, Steve}, year={2011}, month={Apr}, pages={159–170} }
 @article{seymour_sullivan_2010, title={Counting paths in digraphs}, volume={31}, ISSN={0195-6698}, url={http://dx.doi.org/10.1016/j.ejc.2009.05.008}, DOI={10.1016/j.ejc.2009.05.008}, number={3}, journal={European Journal of Combinatorics}, publisher={Elsevier BV}, author={Seymour, Paul and Sullivan, Blair D.}, year={2010}, month={Apr}, pages={961–975} }
 @article{chudnovsky_seymour_sullivan_2008, title={Cycles in dense digraphs}, volume={28}, ISSN={0209-9683 1439-6912}, url={http://dx.doi.org/10.1007/S00493-008-2331-Z}, DOI={10.1007/S00493-008-2331-Z}, number={1}, journal={Combinatorica}, publisher={Springer Science and Business Media LLC}, author={Chudnovsky, Maria and Seymour, Paul and Sullivan, Blair}, year={2008}, month={Jan}, pages={1–18} }