2020 journal article

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

*GENOME BIOLOGY*, *21*(1).

Sources: Web Of Science, ORCID

Added: August 10, 2020

2020 article

Polynomial Treedepth Bounds in Linear Colorings

*ALGORITHMICA*.

Sources: Web Of Science, ORCID

Added: September 21, 2020

2019 article

Faster Biclique Mining in Near-Bipartite Graphs

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

Sources: Web Of Science, ORCID

Added: November 16, 2020

2019 article

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

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

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.

Source: ORCID

Added: May 25, 2019

2019 journal article

Subgraph centrality and walk-regularity

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

Source: ORCID

Added: February 12, 2019

2018 journal article

Benchmarking treewidth as a practical component of tensor network simulations

*PLOS ONE*, *13*(12), e0207827.

Ed(s): E. Torre

Sources: NC State University Libraries, ORCID

Added: January 7, 2019

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

Source: ORCID

Added: February 8, 2019

2018 journal article

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

*Quantum Information Processing*, *17*(5).

Sources: Crossref, ORCID

Added: February 5, 2020

2018 chapter

Treedepth Bounds in Linear Colorings

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

Sources: Crossref, ORCID

Added: February 5, 2020

2018 journal article

Walk entropy and walk-regularity

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

Source: ORCID

Added: February 8, 2019

2016 journal article

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

*Social Network Analysis and Mining*, *6*(1).

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.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2016 journal article

Tree decompositions and social graphs

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

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.

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.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2015 conference paper

On the threshold of intractability

*Algorithms - esa 2015*, *9294*, 411–423.

Sources: NC State University Libraries, ORCID

Added: August 6, 2018

2013 journal article

Adiabatic quantum programming: minor embedding with hard faults

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

Sources: Crossref, ORCID

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

Sources: Crossref, ORCID

Added: February 5, 2020

2011 journal article

A mathematical analysis of the R-MAT random graph generator

*Networks*, *58*(3), 159–170.

Sources: Crossref, ORCID

Added: February 5, 2020

2010 journal article

Counting paths in digraphs

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

Sources: Crossref, ORCID

Added: February 5, 2020

2008 journal article

Cycles in dense digraphs

*Combinatorica*, *28*(1), 1–18.

Sources: Crossref, ORCID

Added: February 5, 2020

2019 - present

2013 - 2019

2008 - 2013

2003 - 2008

1999 - 2003