Timothy D. Goodrich

Works (3)

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

Source: Web Of Science
Added: October 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

Source: NC State University Libraries
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

Source: NC State University Libraries
Added: August 6, 2018