Erin W. Chambers

Erin W. Chambers, David Eppstein: Flows in One-Crossing-Minor-Free Graphs. J. Graph Algorithms Appl. 17(3): 201-220 (2013)

Erin W. Chambers, Yusu Wang: Measuring Similarity Between Curves on 2-Manifolds via Homotopy Area. CoRR abs/1303.7427 (2013)

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)

Erin W. Chambers, Jeff Erickson, Amir Nayyeri: Homology Flows, Cohomology Cuts. SIAM J. Comput. 41(6): 1605-1634 (2012)

Erin W. Chambers, Kyle Sykes, Cynthia Traub: Unfolding Rectangle-Faced Orthostacks. CCCG 2012: 23-28

Sergio Cabello, Erin W. Chambers, Jeff Erickson: Multiple-Source Shortest Paths in Embedded Graphs. CoRR abs/1202.0314 (2012)

Lu Liu, Erin W. Chambers, David Letscher, Tao Ju: Extended grassfire transform on medial axes of 2D shapes. Computer-Aided Design 43(11): 1496-1505 (2011)

Erin W. Chambers, David Letscher, Tao Ju, Lu Liu: Isotopic Fréchet Distance. CCCG 2011

Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides: Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194

Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides: Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011)

L. Liu, Erin W. Chambers, David Letscher, T. Ju: A simple and robust thinning algorithm on cell complexes. Comput. Graph. Forum 29(7): 2253-2260 (2010)

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)

Erin W. Chambers, Vin de Silva, Jeff Erickson, Robert Ghrist: Vietoris-Rips Complexes of Planar Point Sets. Discrete & Computational Geometry 44(1): 75-90 (2010)

Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. Graph Drawing 2010: 129-140

Erin W. Chambers, David Eppstein: Flows in One-Crossing-Minor-Free Graphs. ISAAC (1) 2010: 241-252

Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides: Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445

Erin W. Chambers, David Eppstein: Flows in One-Crossing-Minor-Free Graphs. CoRR abs/1007.1484 (2010)

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)

Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides: Connectivity graphs of uncertainty regions. CoRR abs/1009.3469 (2010)

Erin W. Chambers, William B. Kinnersley, Noah Prince, Douglas B. West: Extremal Problems for Roman Domination. SIAM J. Discrete Math. 23(3): 1575-1586 (2009)

Erin W. Chambers, David Letscher: On the Height of a Homotopy. CCCG 2009: 103-106

Erin W. Chambers, Jeff Erickson, Amir Nayyeri: Minimum cuts and shortest homologous cycles. Symposium on Computational Geometry 2009: 377-385

Erin W. Chambers, Jeff Erickson, Amir Nayyeri: Homology flows, cohomology cuts. STOC 2009: 273-282

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)

David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, Douglas B. West: Pebbling and optimal pebbling in graphs. Journal of Graph Theory 57(3): 215-238 (2008)

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. Symposium on Computational Geometry 2008: 101-109

Erin W. Chambers, Jeff Erickson, Pratik Worah: Testing contractibility in planar rips complexes. Symposium on Computational Geometry 2008: 251-259

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

Sergio Cabello, Erin W. Chambers: Multiple source shortest paths in a genus g graph. SODA 2007: 89-97

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)

Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey: Splitting (complicated) surfaces is hard. Symposium on Computational Geometry 2006: 421-429