# Erin W. Chambers

According to our database

Collaborative distances:

^{1}, Erin W. Chambers authored at least 45 papers between 2007 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352).

Dagstuhl Reports, 2019

Minimum Cuts in Surface Graphs.

CoRR, 2019

Homotopy Height, Grid-Major Height and Graph-Drawing Height.

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

Connecting a set of circles with minimum sum of radii.

Comput. Geom., 2018

On the complexity of optimal homotopies.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Diversity Across a Decade: A Case Study on Undergraduate Computing Culture at the University of Illinois.

Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Map-matching using shortest paths.

Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

Some Heuristics for the Homological Simplification Problem.

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Minimum cycle and homology bases of surface-embedded graphs.

JoCG, 2017

Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072).

Dagstuhl Reports, 2017

Connectivity Graphs of Uncertainty Regions.

Algorithmica, 2017

Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary.

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Burning the Medial Axis.

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Global Minimum Cuts in Surface-Embedded Graphs.

Encyclopedia of Algorithms, 2016

Erosion thickness on medial axes of 3D shapes.

ACM Trans. Graph., 2016

Homotopy Measures for Representative Trajectories.

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Computing Minimum Area Homologies.

Comput. Graph. Forum, 2015

Burning the medial axis.

Proceedings of the Special Interest Group on Computer Graphics and Interactive Techniques Conference, 2015

2014

Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs.

Discrete & Computational Geometry, 2014

Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls.

Discrete & Computational Geometry, 2014

Persistent Homology Over Directed Acyclic Graphs.

CoRR, 2014

2013

Multiple-Source Shortest Paths in Embedded Graphs.

SIAM J. Comput., 2013

Flows in One-Crossing-Minor-Free Graphs.

J. Graph Algorithms Appl., 2013

Measuring similarity between curves on 2-manifolds via homotopy area.

Proceedings of the Symposuim on Computational Geometry 2013, 2013

Counting and sampling minimum cuts in genus g graphs.

Proceedings of the Symposuim on Computational Geometry 2013, 2013

Medial Residues of Piecewise Linear Manifolds.

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Privacy by Fake Data: A Geometric Approach.

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Homology Flows, Cohomology Cuts.

SIAM J. Comput., 2012

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area.

J. Graph Algorithms Appl., 2012

Unfolding Rectangle-Faced Orthostacks.

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Extended grassfire transform on medial axes of 2D shapes.

Comput. Aided Des., 2011

Isotopic Fréchet Distance.

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Vietoris-Rips Complexes of Planar Point Sets.

Discrete & Computational Geometry, 2010

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time.

Comput. Geom., 2010

A simple and robust thinning algorithm on cell complexes.

Comput. Graph. Forum, 2010

2009

Extremal Problems for Roman Domination.

SIAM J. Discrete Math., 2009

Minimum cuts and shortest homologous cycles.

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

On the Height of a Homotopy.

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Pebbling and optimal pebbling in graphs.

Journal of Graph Theory, 2008

Splitting (complicated) surfaces is hard.

Comput. Geom., 2008

A case study of retention practices at the University of Illinois at Urbana-Champaign.

Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

Walking your dog in the woods in polynomial time.

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Testing contractibility in planar rips complexes.

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Recruitment, Preparation, Retention: A case study of computing culture at the University of Illinois at Urbana-Champaign

CoRR, 2007

Multiple source shortest paths in a genus g graph.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007