default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErin W. Chambers
Erin Wolf Chambers
Person information
- affiliation: Saint Louis University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i28]Erin Wolf Chambers, Elizabeth Munch
, Sarah Percival, Xinyi Wang:
A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance. CoRR abs/2407.09442 (2024)- 2023
- [j26]Frederik Brüning, Hugo A. Akitaya, Erin W. Chambers, Anne Driemel:
Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves. Comput. Geom. Topol. 2(1): 1:1-1:48 (2023) - [j25]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. Discret. Comput. Geom. 70(2): 323-354 (2023) - [j24]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. SIAM J. Comput. 52(1): 156-195 (2023) - [c36]Erin W. Chambers, Benjamin Holmgren, Brittany Terese Fasy, Sushovan Majhi, Carola Wenk:
Metric and Path-Connectedness Properties of the Fréchet Distance for Paths and Graphs. CCCG 2023: 213-224 - [e1]Erin W. Chambers, Joachim Gudmundsson:
39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA. LIPIcs 258, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-273-0 [contents] - [i27]Erin W. Chambers, Elizabeth Munch, Sarah Percival, Bei Wang:
Bounding the Interleaving Distance for Geometric Graphs with a Loss Function. CoRR abs/2307.15130 (2023) - [i26]Erin W. Chambers, Brittany Fasy, Benjamin Holmgren, Sushovan Majhi, Carola Wenk:
Metric and Path-Connectedness Properties of the Frechet Distance for Paths and Graphs. CoRR abs/2308.00900 (2023) - 2022
- [j23]Dan Zeng, Erin W. Chambers, David Letscher, Tao Ju:
Topological Simplification of Nested Shapes. Comput. Graph. Forum 41(5): 161-173 (2022) - [j22]Dena Bazazian, Bonnie Magland, Cindy Grimm, Erin W. Chambers, Kathryn Leonard:
Perceptually grounded quantification of 2D shape complexity. Vis. Comput. 38(9): 3351-3363 (2022) - [c35]Erin Wolf Chambers, Salman Parsa, Hannah Schreiber:
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. SoCG 2022: 25:1-25:15 - [c34]Erin W. Chambers, Christopher Fillmore, Elizabeth Stephenson, Mathijs Wintraecken:
A Cautionary Tale: Burning the Medial Axis Is Unstable (Media Exposition). SoCG 2022: 66:1-66:9 - [c33]Erin W. Chambers, Moon Duchin, Ranthony A. C. Edmonds, Parker B. Edwards, JN Matthews, Anthony E. Pizzimenti, Chanel Richardson, Parker Rule, Ari Stern:
Aggregating community maps. SIGSPATIAL/GIS 2022: 27:1-27:12 - [i25]Levent Batakci, Abigail Branson, Bryan Castillo, Candace Todd, Erin Wolf Chambers, Elizabeth Munch:
Comparing Embedded Graphs Using Average Branching Distance. CoRR abs/2210.10181 (2022) - 2021
- [c32]Erin Wolf Chambers, Elizabeth Munch, Tim Ophelders:
A Family of Metrics from the Truncated Smoothing of Reeb Graphs. SoCG 2021: 22:1-22:17 - [c31]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. SoCG 2021: 23:1-23:16 - [c30]Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. SODA 2021: 2759-2778 - [i24]Hugo A. Akitaya, Frederik Brüning, Erin W. Chambers, Anne Driemel:
Covering a Curve with Subtrajectories. CoRR abs/2103.06040 (2021) - [i23]Rehab Alharbi, Erin Wolf Chambers, Elizabeth Munch:
Realizable piecewise linear paths of persistence diagrams with Reeb graphs. CoRR abs/2107.04654 (2021) - [i22]Brian Bollen, Erin W. Chambers, Joshua A. Levine, Elizabeth Munch:
Reeb Graph Metrics from the Ground Up. CoRR abs/2110.05631 (2021) - [i21]Erin Wolf Chambers, Salman Parsa, Hannah Schreiber:
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class. CoRR abs/2112.02380 (2021) - 2020
- [j21]Dan Zeng, Erin W. Chambers, David Letscher, Tao Ju:
To cut or to fill: a global optimization approach to topological simplification. ACM Trans. Graph. 39(6): 201:1-201:18 (2020) - [j20]Erin W. Chambers, Brittany Terese Fasy, Yusu Wang, Carola Wenk:
Map-Matching Using Shortest Paths. ACM Trans. Spatial Algorithms Syst. 6(1): 6:1-6:17 (2020) - [c29]Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri:
Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT 2020: 15:1-15:19 - [i20]Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri:
Low-stretch spanning trees of graphs with bounded width. CoRR abs/2004.08375 (2020) - [i19]Erin Wolf Chambers, Elizabeth Munch, Tim Ophelders:
A family of metrics from the truncated smoothing of Reeb graphs. CoRR abs/2007.07795 (2020) - [i18]Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. CoRR abs/2007.07927 (2020) - [i17]Erin Wolf Chambers, Francis Lazarus, Arnaud de Mesmay, Salman Parsa:
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries. CoRR abs/2012.02352 (2020)
2010 – 2019
- 2019
- [j19]Erin Wolf Chambers, Yusu Wang:
Measuring similarity between curves on 2-manifolds via homotopy area. J. Comput. Geom. 10(1): 96-126 (2019) - [c28]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy Height, Grid-Major Height and Graph-Drawing Height. GD 2019: 468-481 - [i16]Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy height, grid-major height and graph-drawing height. CoRR abs/1908.05706 (2019) - [i15]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. CoRR abs/1910.04278 (2019) - [i14]Maarten Löffler, Anna Lubiw, Saul Schleimer, Erin Wolf Chambers:
Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352). Dagstuhl Reports 9(8): 84-112 (2019) - 2018
- [j18]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a set of circles with minimum sum of radii. Comput. Geom. 68: 62-76 (2018) - [c27]Erin W. Chambers, Tao Ju, David Letscher, Mao Li, Christopher N. Topp, Yajie Yan:
Some Heuristics for the Homological Simplification Problem. CCCG 2018: 353-359 - [c26]Erin W. Chambers, Brittany Terese Fasy, Yusu Wang, Carola Wenk:
Map-matching using shortest paths. IWISC 2018: 44-51 - [c25]Heather E. Metcalf, Tanya L. Crenshaw, Erin Wolf Chambers, Cinda Heeren:
Diversity Across a Decade: A Case Study on Undergraduate Computing Culture at the University of Illinois. SIGCSE 2018: 610-615 - [c24]Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders:
On the complexity of optimal homotopies. SODA 2018: 1121-1134 - 2017
- [j17]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. Algorithmica 78(3): 990-1019 (2017) - [j16]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum cycle and homology bases of surface-embedded graphs. J. Comput. Geom. 8(2): 58-79 (2017) - [c23]Erin Wolf Chambers:
Burning the Medial Axis. CCCG 2017: 77 - [c22]Benjamin A. Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, Bettina Speckmann:
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. ESA 2017: 23:1-23:14 - [i13]Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders:
On the complexity of optimal homotopies. CoRR abs/1711.00788 (2017) - [i12]Benjamin A. Burton, Maarten Löffler, Carola Wenk, Erin Wolf Chambers:
Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072). Dagstuhl Reports 7(2): 64-88 (2017) - 2016
- [j15]Yajie Yan, Kyle Sykes, Erin W. Chambers, David Letscher, Tao Ju:
Erosion thickness on medial axes of 3D shapes. ACM Trans. Graph. 35(4): 38:1-38:12 (2016) - [c21]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum Cycle and Homology Bases of Surface Embedded Graphs. SoCG 2016: 23:1-23:15 - [c20]Erin W. Chambers, Irina Kostitsyna, Maarten Löffler, Frank Staals:
Homotopy Measures for Representative Trajectories. ESA 2016: 27:1-27:17 - [r1]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Global Minimum Cuts in Surface-Embedded Graphs. Encyclopedia of Algorithms 2016: 852-856 - [i11]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum cycle and homology bases of surface embedded graphs. CoRR abs/1607.05112 (2016) - 2015
- [j14]Erin Wolf Chambers, Mikael Vejdemo-Johansson:
Computing Minimum Area Homologies. Comput. Graph. Forum 34(6): 13-21 (2015) - [c19]Yajie Yan, Tao Ju, David Letscher, Erin W. Chambers:
Burning the medial axis. SIGGRAPH Posters 2015: 62:1 - 2014
- [j13]Glencora Borradaile, Erin Wolf Chambers:
Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls. Discret. Comput. Geom. 51(4): 979-996 (2014) - [j12]Erin W. Chambers, Kyle Fox, Amir Nayyeri:
Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs. Discret. Comput. Geom. 52(3): 450-475 (2014) - [i10]Glencora Borradaile, Erin Wolf Chambers:
Covering nearly surface-embedded graphs with a fixed number of balls. CoRR abs/1403.8086 (2014) - [i9]Erin Wolf Chambers, David Letscher:
Persistent Homology Over Directed Acyclic Graphs. CoRR abs/1407.2523 (2014) - [i8]Erin Wolf Chambers, Mikael Vejdemo-Johansson:
Computing minimum area homologies. CoRR abs/1410.2320 (2014) - 2013
- [j11]Erin W. Chambers, David Eppstein:
Flows in One-Crossing-Minor-Free Graphs. J. Graph Algorithms Appl. 17(3): 201-220 (2013) - [j10]Sergio Cabello, Erin W. Chambers, Jeff Erickson:
Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. 42(4): 1542-1571 (2013) - [c18]Victor Alvarez, Erin W. Chambers, László Kozma:
Privacy by Fake Data: A Geometric Approach. CCCG 2013 - [c17]Erin W. Chambers, Tao Ju, David Letscher:
Medial Residues of Piecewise Linear Manifolds. CCCG 2013 - [c16]Erin W. Chambers, Kyle Fox, Amir Nayyeri:
Counting and sampling minimum cuts in genus g graphs. SoCG 2013: 249-258 - [c15]Erin Wolf Chambers, Yusu Wang:
Measuring similarity between curves on 2-manifolds via homotopy area. SoCG 2013: 425-434 - [i7]Erin W. Chambers, Yusu Wang:
Measuring Similarity Between Curves on 2-Manifolds via Homotopy Area. CoRR abs/1303.7427 (2013) - 2012
- [j9]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. J. Graph Algorithms Appl. 16(2): 243-259 (2012) - [j8]Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Homology Flows, Cohomology Cuts. SIAM J. Comput. 41(6): 1605-1634 (2012) - [c14]Erin W. Chambers, Kyle Sykes, Cynthia M. Traub:
Unfolding Rectangle-Faced Orthostacks. CCCG 2012: 23-28 - [i6]Sergio Cabello, Erin W. Chambers, Jeff Erickson:
Multiple-Source Shortest Paths in Embedded Graphs. CoRR abs/1202.0314 (2012) - 2011
- [j7]Lu Liu, Erin W. Chambers, David Letscher, Tao Ju:
Extended grassfire transform on medial axes of 2D shapes. Comput. Aided Des. 43(11): 1496-1505 (2011) - [c13]Erin W. Chambers, David Letscher, Tao Ju, Lu Liu:
Isotopic Fréchet Distance. CCCG 2011 - [c12]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194 - [i5]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011) - 2010
- [j6]Lu Liu, Erin W. Chambers, David Letscher, Tao Ju:
A simple and robust thinning algorithm on cell complexes. Comput. Graph. Forum 29(7): 2253-2260 (2010) - [j5]Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite:
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43(3): 295-311 (2010) - [j4]Erin W. Chambers, Vin de Silva, Jeff Erickson, Robert Ghrist:
Vietoris-Rips Complexes of Planar Point Sets. Discret. Comput. Geom. 44(1): 75-90 (2010) - [c11]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. GD 2010: 129-140 - [c10]Erin W. Chambers, David Eppstein:
Flows in One-Crossing-Minor-Free Graphs. ISAAC (1) 2010: 241-252 - [c9]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445 - [i4]Erin W. Chambers, David Eppstein:
Flows in One-Crossing-Minor-Free Graphs. CoRR abs/1007.1484 (2010) - [i3]Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. CoRR abs/1009.0088 (2010) - [i2]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity graphs of uncertainty regions. CoRR abs/1009.3469 (2010)
2000 – 2009
- 2009
- [j3]Erin W. Chambers, William B. Kinnersley, Noah Prince, Douglas B. West:
Extremal Problems for Roman Domination. SIAM J. Discret. Math. 23(3): 1575-1586 (2009) - [c8]Erin W. Chambers, David Letscher:
On the Height of a Homotopy. CCCG 2009: 103-106 - [c7]Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Minimum cuts and shortest homologous cycles. SCG 2009: 377-385 - [c6]Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Homology flows, cohomology cuts. STOC 2009: 273-282 - 2008
- [b1]Erin Wolf Chambers:
Computing Interesting Topological Features. University of Illinois Urbana-Champaign, USA, 2008 - [j2]Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey:
Splitting (complicated) surfaces is hard. Comput. Geom. 41(1-2): 94-110 (2008) - [j1]David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, Douglas B. West:
Pebbling and optimal pebbling in graphs. J. Graph Theory 57(3): 215-238 (2008) - [c5]Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite:
Walking your dog in the woods in polynomial time. SCG 2008: 101-109 - [c4]Erin W. Chambers, Jeff Erickson, Pratik Worah:
Testing contractibility in planar rips complexes. SCG 2008: 251-259 - [c3]Tanya L. Crenshaw, Erin W. Chambers, Heather Metcalf:
A case study of retention practices at the University of Illinois at Urbana-Champaign. SIGCSE 2008: 412-416 - 2007
- [c2]Sergio Cabello, Erin W. Chambers:
Multiple source shortest paths in a genus g graph. SODA 2007: 89-97 - [i1]Tanya L. Crenshaw, Erin W. Chambers, Heather Metcalf, Umesh Thakkar:
Recruitment, Preparation, Retention: A case study of computing culture at the University of Illinois at Urbana-Champaign. CoRR abs/cs/0702141 (2007) - 2006
- [c1]Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey:
Splitting (complicated) surfaces is hard. SCG 2006: 421-429
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
