Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs. - Matthew Farrell; Timothy D. Goodrich; Nathan Lemons; Felix Reidl; Fernando Sánchez Villaamil; Blair D. Sullivan (WAW, 2015)

Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. - Alex J. Chin; Timothy D. Goodrich; Michael P. O'Brien; Felix Reidl; Blair D. Sullivan; Andrew van der Poel (ICDM, 2016)

Practical Graph Bipartization with Applications in Near-Term Quantum Computing. - Timothy D. Goodrich; Eric Horton; Blair D. Sullivan (CoRR, 2018)

Benchmarking treewidth as a practical component of tensor-network-based quantum simulation. - Eugene F. Dumitrescu; Allison L. Fisher; Timothy D. Goodrich; Travis S. Humble; Blair D. Sullivan; Andrew L. Wright (CoRR, 2018)

Optimizing adiabatic quantum program compilation using a graph-theoretic framework. - Timothy D. Goodrich; Blair D. Sullivan; Travis S. Humble (Quantum Inf. Process., 2018)

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. - Erik D. Demaine; Timothy D. Goodrich; Kyle Kloster; Brian Lavallee; Quanquan C. Liu; Blair D. Sullivan; Ali Vakilian; Andrew van der Poel (ESA, 2019)

Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver. - Matthias F. Stallmann; Yang Ho; Timothy D. Goodrich (CoRR, 2020)

An Updated Experimental Evaluation of Graph Bipartization Methods. - Timothy D. Goodrich; Eric Horton; Blair D. Sullivan (ACM J. Exp. Algorithmics, 2021)