Erin W. Chambers

Orcid: 0000-0001-8333-3676

Affiliations:
  • Saint Louis University, USA


According to our database1, Erin W. Chambers authored at least 63 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries.
Discret. Comput. Geom., September, 2023

Minimum Cuts in Surface Graphs.
SIAM J. Comput., February, 2023

Metric and Path-Connectedness Properties of the Frechet Distance for Paths and Graphs.
CoRR, 2023

Bounding the Interleaving Distance for Geometric Graphs with a Loss Function.
CoRR, 2023

Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves.
Comput. Geom. Topol., 2023

2022
Perceptually grounded quantification of 2D shape complexity.
Vis. Comput., 2022

Comparing Embedded Graphs Using Average Branching Distance.
CoRR, 2022

Topological Simplification of Nested Shapes.
Comput. Graph. Forum, 2022

Aggregating community maps.
Proceedings of the 30th International Conference on Advances in Geographic Information Systems, 2022

On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

A Cautionary Tale: Burning the Medial Axis Is Unstable (Media Exposition).
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Reeb Graph Metrics from the Ground Up.
CoRR, 2021

Realizable piecewise linear paths of persistence diagrams with Reeb graphs.
CoRR, 2021

Covering a Curve with Subtrajectories.
CoRR, 2021

How to Morph Graphs on the Torus.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A Family of Metrics from the Truncated Smoothing of Reeb Graphs.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Map-Matching Using Shortest Paths.
ACM Trans. Spatial Algorithms Syst., 2020

To cut or to fill: a global optimization approach to topological simplification.
ACM Trans. Graph., 2020

Low-Stretch Spanning Trees of Graphs with Bounded Width.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019
Measuring similarity between curves on 2-manifolds via homotopy area.
J. Comput. Geom., 2019

Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352).
Dagstuhl Reports, 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

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.
J. Comput. Geom., 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.
Discret. Comput. Geom., 2014

Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls.
Discret. Comput. Geom., 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

Counting and sampling minimum cuts in genus g graphs.
Proceedings of the Symposium 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.
Discret. Comput. Geom., 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. Discret. 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
Computing Interesting Topological Features
PhD thesis, 2008

Pebbling and optimal pebbling in graphs.
J. 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


  Loading...