Timothy D. Goodrich

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

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

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