Is this your profile?
Claim your Citation Index profile in order to display more information about you and gain access to Libraries services. Just create or connect your ORCID iD.
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
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
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
Open access is the free, immediate, online availability of research
articles. Making your research open access allows researchers across
to globe read and interact with your work which may increase citations
to your work.
For more information on open access and how you can increase your research impact, contact
the Copyright & Digital Scholarship Center (CDSC)