Blair Sullivan

Jain, S., Mizutani, Y., & Sullivan, B. (2022). Faster Decomposition ofWeighted Graphs into Cliques using Fisher's Inequality. ArXiv. https://doi.org/10.48550/arXiv.2206.07286

Fraser, A., Lavallee, B., & Sullivan, B. D. (2022). Gerrymandering Trees: Parameterized Hardness. ArXiv. https://doi.org/10.48550/arXiv.2205.06857

Mizutani, Y., & Sullivan, B. D. (2022). Improved Parameterized Complexity of Happy Set Problems. ArXiv. https://doi.org/10.48550/arXiv.2207.06623

Drange, P. G., Dregi, M. F., Lokshtanov, D., & Sullivan, B. D. (2022). On the threshold of intractability. Journal of Computer and System Sciences, 124, 1–25. https://doi.org/10.1016/j.jcss.2021.09.003

Goodrich, T. D., Horton, E., & Sullivan, B. D. (2021). An Updated Experimental Evaluation of Graph Bipartization Methods. ACM Journal of Experimental Algorithmics, 26. https://doi.org/10.1145/3467968

Breen-McKay, M., Lavallee, B., & Sullivan, B. D. (2021). Hardness of the Generalized Coloring Numbers. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85121786987&partnerID=MN8TOARS

Cooley, M., Greene, C. S., Issac, D., Pividori, M., & Sullivan, B. D. (2021). Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21), 111–122. https://doi.org/10.1137/1.9781611976830.11

Cooley, M., Greene, C. S., Issac, D., Pividori, M., & Sullivan, B. D. (2021). Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85108789587&partnerID=MN8TOARS

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

Pividori, M., Lu, S., Li, B., Su, C., Johnson, M. E., Wei, W.-Q., … Greene, C. S. (2021). Projecting genetic associations through gene expression patterns highlights disease etiology and drug mechanisms. BioRxiv. https://doi.org/10.1101/2021.07.05.450786

Du, H., Ferrari, M. M., Heitsch, C., Hurley, F., Mennicke, C. V., Sullivan, B. D., & Xu, B. (2021). Secondary Structure Ensemble Analysis via Community Detection. In Association for Women in Mathematics Series (Vol. 22, pp. 55–81). https://doi.org/10.1007/978-3-030-57129-0_4

Mizutani, Y., Staker, A., & Sullivan, B. D. (2021). Sparse dominating sets and balanced neighborhood partitioning. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85121833484&partnerID=MN8TOARS

Reidl, F., & Sullivan, B. D. (2020). A color-avoiding approach to subgraph counting in bounded expansion classes. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85095561220&partnerID=MN8TOARS

Lavallee, B., Russell, H., Sullivan, B. D., & Poel, A. (2020). Approximating vertex cover using structural rounding. Proceedings of the Workshop on Algorithm Engineering and Experiments, 2020-January, 70–80. https://doi.org/10.1137/1.9781611976007.6

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

Lavallee, B., Russell, H., Sullivan, B. D., & Poel, A. (2019). Approximating vertex cover using structural rounding. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85094768942&partnerID=MN8TOARS

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

Kloster, K., Poel, A., & Sullivan, B. D. (2019). Mining maximal induced bicliques using odd cycle transversals. SIAM International Conference on Data Mining, SDM 2019, 324–332. https://doi.org/10.1137/1.9781611975673.37

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), Vol. 144. 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

Kloster, K., Kuinke, P., O?Brien, M. P., Reidl, F., Villaamil, F. S., Sullivan, B. D., & Van Der Poel, A. (2018). A practical fpt algorithm for flow decomposition and transcript assembly. Proceedings of the Workshop on Algorithm Engineering and Experiments, 2018-January, 75–86. https://doi.org/10.1137/1.9781611975055.7

Goodrich, T. D., Horton, E., & Sullivan, B. D. (2018). An updated experimental evaluation of graph bipartization methods. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85104339918&partnerID=MN8TOARS

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). https://doi.org/10.1371/journal.pone.0207827

Dumitrescu, E. F., Fisher, A. L., Goodrich, T. D., Humble, T. S., Sullivan, B. D., & Wrigh, A. L. (2018). Benchmarking treewidth as a practical component of tensor-network–based quantum simulation. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85095245427&partnerID=MN8TOARS

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. BioRxiv, Vol. 11. https://doi.org/10.1101/462788

Kloster, K., Sullivan, B. D., & Van Der Poel, A. (2018). Mining maximal induced bicliques using odd cycle transversals. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85093320378&partnerID=MN8TOARS

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., Pilipczuk, M., & Sullivan, B. D. (2018). Polynomial treedepth bounds in linear colorings. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85092833264&partnerID=MN8TOARS

Demaine, E. D., Goodrich, T. D., Kloster, K., Lavallee, B., Liu, Q. C., Sullivan, B. D., … Poel, A. (2018). Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85094277709&partnerID=MN8TOARS

Horton, E., Kloster, K., & Sullivan, B. D. (2018). Subgraph centrality and walk-regularity. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85093754399&partnerID=MN8TOARS

Kun, J., O’Brien, M. P., & Sullivan, B. D. (2018). Treedepth Bounds in Linear Colorings. In Graph-Theoretic Concepts in Computer Science: Vol. 11159 LNCS (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

Sullivan, B. D., & Van Der Poel, A. (2017). A fast parameterized algorithm for Co-Path Set. Leibniz International Proceedings in Informatics, LIPIcs, 63. https://doi.org/10.4230/LIPIcs.IPEC.2016.28

Kloster, K., Kuinke, P., O’Brien, M. P., Reidl, F., Villaamil, F. S., Sullivan, B. D., & Van Der Poel, A. (2017). A practical fpt algorithm for flow decomposition and transcript assembly. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85094353595&partnerID=MN8TOARS

O’Brien, M. P., & Sullivan, B. D. (2017). An experimental evaluation of a bounded expansion algorithmic pipeline. ArXiv. Retrieved from 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. (2017). Proceedings - IEEE International Conference on Data Mining, ICDM, 829–834. https://doi.org/10.1109/ICDM.2016.81

Muzi, I., O’Brien, M. P., Reidl, F., & Sullivan, B. D. (2017). Being even slightly shallow makes life hard. Leibniz International Proceedings in Informatics, LIPIcs, 83. https://doi.org/10.4230/LIPIcs.MFCS.2017.79

Muzi, I., O’Brien, M. P., Reidl, F., & Sullivan, B. D. (2017). Being even slightly shallow makes life hard. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85094429786&partnerID=MN8TOARS

Goodrich, T. D., Sullivan, B. D., & Humble, T. S. (2017). Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85095056109&partnerID=MN8TOARS

Kloster, K., Král, D., & Sullivan, B. D. (2017). Walk entropy and walk-regularity. ArXiv. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-85094268676&partnerID=MN8TOARS

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), Vol. 9479, pp. 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), pp. 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, Vol. 9294, pp. 411–423. https://doi.org/10.1007/978-3-662-48350-3_35

Zig-Zag Numberlink is NP-Complete. (2015). Journal of Information Processing, 23(3), 239–245. https://doi.org/10.2197/ipsjjip.23.239

Humble, T. S., McCaskey, A. J., Bennink, R. S., Billings, J. J., Dazevedo, E. D., Sullivan, B. D., … Seddiqi, H. (2014). An integrated programming and development environment for adiabatic quantum optimization. Computational Science and Discovery, 7(1). https://doi.org/10.1088/1749-4680/7/1/015006

Obrien, M. P., & Sullivan, B. D. (2014). Locally Estimating Core Numbers. Proceedings - IEEE International Conference on Data Mining, ICDM, 2015-January(January), 460–469. https://doi.org/10.1109/ICDM.2014.136

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: Vol. 8122 LNCS (pp. 71–83). https://doi.org/10.1007/978-3-642-40698-0_6

Sullivan, B. D. (2013). On a conjecture of Andrica and Tomescu. Journal of Integer Sequences, 16(3). Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-84880061040&partnerID=MN8TOARS

Sullivan, B. D., Weerapurage, D., & Groer, C. (2013). 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. https://doi.org/10.1109/IPDPSW.2013.242

Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2013). Tree-Like Structure in Large Social and Information Networks. 2013 IEEE 13th International Conference on Data Mining, 1–10. https://doi.org/10.1109/icdm.2013.77

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