Timothy Goodrich

According to our database, Timothy Goodrich authored at least 8 papers between 2015 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

An Updated Experimental Evaluation of Graph Bipartization Methods.

Timothy D. Goodrich, Eric Horton, Blair D. Sullivan

ACM J. Exp. Algorithmics, 2021

2020

Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver.

Matthias F. Stallmann, Yang Ho, Timothy D. Goodrich

CoRR, 2020

2019

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

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Optimizing adiabatic quantum program compilation using a graph-theoretic framework.

Timothy D. Goodrich, Blair D. Sullivan, Travis S. Humble

Quantum Inf. Process., 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

Practical Graph Bipartization with Applications in Near-Term Quantum Computing.

Timothy D. Goodrich, Eric Horton, Blair D. Sullivan

CoRR, 2018

2016

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

Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs.

Matthew Farrell, Timothy D. Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015