Works (58)

2022 article

Faster Decomposition ofWeighted Graphs into Cliques using Fisher's Inequality

ArXiv.

By: S. Jain, Y. Mizutani & B. Sullivan

Source: ORCID
Added: August 6, 2022

2022 article

Gerrymandering Trees: Parameterized Hardness

ArXiv.

By: A. Fraser, B. Lavallee & B. Sullivan

Source: ORCID
Added: August 6, 2022

2022 article

Improved Parameterized Complexity of Happy Set Problems

ArXiv.

By: Y. Mizutani & B. Sullivan

Source: ORCID
Added: August 6, 2022

2022 journal article

On the threshold of intractability

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

By: P. Drange, M. Dregi, D. Lokshtanov & B. Sullivan

Source: ORCID
Added: August 6, 2022

2021 journal article

An Updated Experimental Evaluation of Graph Bipartization Methods

ACM Journal of Experimental Algorithmics, 26.

By: T. Goodrich, E. Horton & B. Sullivan

Source: ORCID
Added: August 6, 2022

2021 article

Hardness of the Generalized Coloring Numbers

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

By: M. Breen-McKay, B. Lavallee & B. Sullivan

Source: ORCID
Added: August 6, 2022

2021 article

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

By: M. Cooley, C. Greene, D. Issac, M. Pividori & B. Sullivan

Source: ORCID
Added: August 6, 2022

2021 conference paper

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

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

By: M. Cooley, C. Greene, D. Issac, M. Pividori & B. Sullivan

Source: ORCID
Added: August 6, 2022

2021 article

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

BioRxiv.

By: M. Pividori, S. Lu, B. Li, C. Su, M. Johnson, W. Wei, Q. Feng, B. Namjou ...

Source: ORCID
Added: August 6, 2022

2021 chapter

Secondary Structure Ensemble Analysis via Community Detection

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

By: H. Du, M. Ferrari, C. Heitsch, F. Hurley, C. Mennicke, B. Sullivan, B. Xu

Source: ORCID
Added: August 6, 2022

2021 article

Sparse dominating sets and balanced neighborhood partitioning

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

By: Y. Mizutani, A. Staker & B. Sullivan

Source: ORCID
Added: August 6, 2022

2020 article

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

By: F. Reidl & B. Sullivan

Source: ORCID
Added: August 6, 2022

2020 conference paper

Approximating vertex cover using structural rounding

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

By: B. Lavallee, H. Russell, B. Sullivan & A. Poel

Source: ORCID
Added: August 6, 2022

2020 journal article

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

GENOME BIOLOGY, 21(1).

By: C. Brown, D. Moritz, . Michael P. O'Brien, F. Reidl, T. Reiter & B. Sullivan

Sources: Web Of Science, ORCID
Added: August 10, 2020

2020 article

Polynomial Treedepth Bounds in Linear Colorings

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

By: J. Kun, . Michael P. O'Brien, M. Pilipczuk & B. Sullivan

Sources: ORCID, Web Of Science
Added: September 21, 2020

2019 article

Approximating vertex cover using structural rounding

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

By: B. Lavallee, H. Russell, B. Sullivan & A. Poel

Source: ORCID
Added: August 6, 2022

2019 article

Faster Biclique Mining in Near-Bipartite Graphs

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

By: B. Sullivan, A. Poel & T. Woodlief

Sources: Web Of Science, ORCID
Added: November 16, 2020

2019 conference paper

Mining maximal induced bicliques using odd cycle transversals

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

By: K. Kloster, A. Poel & B. Sullivan

Source: ORCID
Added: August 6, 2022

2019 article

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

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

By: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

Sources: Web Of Science, ORCID
Added: October 5, 2020

2019 journal article

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

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

By: E. Demaine, F. Reidl, P. Rossmanith, F. Villaamil, S. Sikdar & B. Sullivan

Source: ORCID
Added: May 25, 2019

2019 journal article

Subgraph centrality and walk-regularity

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

By: E. Horton, K. Kloster & B. Sullivan

Source: ORCID
Added: February 12, 2019

2018 conference paper

A practical fpt algorithm for flow decomposition and transcript assembly

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

By: K. Kloster, P. Kuinke, M. O?Brien, F. Reidl, F. Villaamil, B. Sullivan, A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2018 article

An updated experimental evaluation of graph bipartization methods

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

By: T. Goodrich, E. Horton & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 journal article

Benchmarking treewidth as a practical component of tensor network simulations

PLOS ONE, 13(12), e0207827.

By: E. Dumitrescu, A. Fisher, T. Goodrich, T. Humble, B. Sullivan & A. Wright

Ed(s): E. Torre

Sources: NC State University Libraries, ORCID
Added: January 7, 2019

2018 article

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

By: E. Dumitrescu, A. Fisher, T. Goodrich, T. Humble, B. Sullivan & A. Wrigh

Source: ORCID
Added: August 6, 2022

2018 article

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.

By: C. Brown, D. Moritz, M. O’Brien, F. Reidl, T. Reiter & B. Sullivan

Source: ORCID
Added: February 8, 2019

2018 article

Mining maximal induced bicliques using odd cycle transversals

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

By: K. Kloster, B. Sullivan & A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2018 journal article

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Quantum Information Processing, 17(5).

By: T. Goodrich, B. Sullivan & T. Humble

Sources: Crossref, ORCID
Added: February 5, 2020

2018 article

Polynomial treedepth bounds in linear colorings

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

By: J. Kun, M. O’Brien, M. Pilipczuk & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 article

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

By: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

Source: ORCID
Added: August 6, 2022

2018 article

Subgraph centrality and walk-regularity

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

By: E. Horton, K. Kloster & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 chapter

Treedepth Bounds in Linear Colorings

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

By: J. Kun, M. O’Brien & B. Sullivan

Sources: Crossref, ORCID
Added: February 5, 2020

2018 journal article

Walk entropy and walk-regularity

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

By: K. Kloster, D. Král' & B. Sullivan

Source: ORCID
Added: February 8, 2019

2017 conference paper

A fast parameterized algorithm for Co-Path Set

Leibniz International Proceedings in Informatics, LIPIcs, 63.

By: B. Sullivan & A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2017 article

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

By: K. Kloster, P. Kuinke, M. O’Brien, F. Reidl, F. Villaamil, B. Sullivan, A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2017 article

An experimental evaluation of a bounded expansion algorithmic pipeline

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

By: M. O’Brien & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 conference paper

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

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

Source: ORCID
Added: August 6, 2022

2017 article

Being even slightly shallow makes life hard

ArXiv.

By: I. Muzi, M. O’Brien, F. Reidl & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 conference paper

Being even slightly shallow makes life hard

Leibniz International Proceedings in Informatics, LIPIcs, 83.

By: I. Muzi, M. O’Brien, F. Reidl & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 article

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

By: T. Goodrich, B. Sullivan & T. Humble

Source: ORCID
Added: August 6, 2022

2017 article

Walk entropy and walk-regularity

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

By: K. Kloster, D. Král & B. Sullivan

Source: ORCID
Added: August 6, 2022

2016 journal article

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

Social Network Analysis and Mining, 6(1).

By: R. Bridges, J. Collins, E. Ferragut, J. Laska & B. Sullivan

Sources: Crossref, ORCID
Added: February 5, 2020

2016 conference paper

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

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

By: A. Chin, T. Goodrich, M. O'Brien, F. Reidl, B. Sullivan & A. Poel

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2016 journal article

Tree decompositions and social graphs

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

By: A. Adcock, B. Sullivan & M. Mahoney

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2015 conference paper

Hyperbolicity, degeneracy, and expansion of random intersection graphs

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

By: M. Farrell, T. Goodrich, N. Lemons, F. Reidl, F. Villaamil & B. Sullivan

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2015 conference paper

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.

By: R. Bridges, J. Collins, E. Ferragut, J. Laska & B. Sullivan

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2015 conference paper

On the threshold of intractability

Algorithms - esa 2015, 9294, 411–423.

By: P. Drange, M. Dregi, D. Lokshtanov & B. Sullivan

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2015 journal article

Zig-Zag Numberlink is NP-Complete

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

Source: ORCID
Added: August 6, 2022

2014 journal article

An integrated programming and development environment for adiabatic quantum optimization

Computational Science and Discovery, 7(1).

By: T. Humble, A. McCaskey, R. Bennink, J. Billings, E. Dazevedo, B. Sullivan, C. Klymko, H. Seddiqi

Source: ORCID
Added: August 6, 2022

2014 conference paper

Locally Estimating Core Numbers

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

By: M. Obrien & B. Sullivan

Source: ORCID
Added: August 6, 2022

2013 journal article

Adiabatic quantum programming: minor embedding with hard faults

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

By: C. Klymko, B. Sullivan & T. Humble

Sources: ORCID, Crossref
Added: February 5, 2020

2013 chapter

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).

By: A. Adcock, B. Sullivan, O. Hernandez & M. Mahoney

Sources: Crossref, ORCID
Added: February 5, 2020

2013 journal article

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

By: B. Sullivan

Source: ORCID
Added: August 6, 2022

2013 conference paper

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.

By: B. Sullivan, D. Weerapurage & C. Groer

Source: ORCID
Added: August 6, 2022

2013 conference paper

Tree-Like Structure in Large Social and Information Networks

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

By: A. Adcock, B. Sullivan & M. Mahoney

Source: ORCID
Added: August 6, 2022

2011 journal article

A mathematical analysis of the R-MAT random graph generator

Networks, 58(3), 159–170.

By: C. Groër, B. Sullivan & S. Poole

Sources: Crossref, ORCID
Added: February 5, 2020

2010 journal article

Counting paths in digraphs

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

By: P. Seymour & B. Sullivan

Sources: Crossref, ORCID
Added: February 5, 2020

2008 journal article

Cycles in dense digraphs

Combinatorica, 28(1), 1–18.

By: M. Chudnovsky, P. Seymour & B. Sullivan

Sources: Crossref, ORCID
Added: February 5, 2020

Employment

2019 - present

University of Utah Salt Lake City, UT, US
Associate Professor School of Computing

2013 - 2019

North Carolina State University Raleigh, NC, US
Computer Science

2008 - 2013

Oak Ridge National Laboratory Oak Ridge, TN, US
Computer Science & Mathematics Division

Education

2003 - 2008

Princeton University Princeton, NJ, US
PhD Mathematics Mathematics

1999 - 2003

Georgia Institute of Technology Atlanta, GA, US
B.S. Applied Mathematics; B.S. Computer Science