Erin Wolf Chambers

Education:

• PhD in Computer Science, U. Illinois Urbana-Champaign
• MS in Mathematics, U. Illinois Urbana-Champaign
• BS in Computer Science, U. Illinois Urbana-Champaign

Research interests:

Computational Topology and Geometry, Algorithms, CS Recruitment and Retention

Biography:

Dr. Erin Wolf Chambers is a Professor at Saint Louis University in the Department of Computer Science, with a secondary appointment in the Department of Mathematics. Her research focus is in the field of computational topology and geometry, as well as combinatorics and combinatorial algorithms. In addition, she has active research projects and service activities that focus on improving inclusivity in computer science and mathematics. She received her PhD in Computer Science from the University of Illinois at Urbana-Champaign in 2008, and was a Visiting Research Professor at Saarland University in 2011.

Publications

Show all

Erin W. Chambers, S?ndor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, and Sue Whitesides. “Connecting a set of circles with minimum sum of radii”. In: Comput. Geom. 68 (2018), pp. 62–76. doi: 10.1016/j.comgeo.2017.06.002. url: https://doi.org/10.1016/j.comgeo.2017.06.002.

Erin W. Chambers, Brittany Terese Fasy, Yusu Wang, and Carola Wenk. “Map-matching using shortest paths”. In: Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, IWISC 2018, Richardson, TX, USA, April 12-13, 2018. 2018, pp. 44–51. doi: 10.1145/3191801.3191812. url: http://doi.acm.org/10.1145/3191801.3191812.

Erin W. Chambers, Alejandro Erickson, S?ndor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. “Connectivity Graphs of Uncertainty Regions”. In: Algorithmica 78.3 (2017), pp. 990–1019. doi: 10.1007/s00453-016-0191-2. url: https://doi.org/10.1007/s00453-016-0191-2.

Benjamin Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, and Bettina Speckmann. “Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary”. In: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria. 2017, 23:1–23:14. doi: 10.4230/LIPIcs.ESA.2017.23. url: https://doi.org/10.4230/LIPIcs.ESA.2017.23.

Erin W. Chambers, Jeff Erickson, Kyle Fox, and Amir Nayyeri. “Global Minimum Cuts in Surface-Embedded Graphs”. In: Encyclopedia of Algorithms. 2016, pp. 852–856. doi: 10.1007/978-1-4939-2864-4“?683. url: https://doi.org/10.1007/978-1-4939-2864-4%5C_683.

Yajie Yan, Kyle Sykes, Erin W. Chambers, David Letscher, and Tao Ju. “Erosion thickness on medial axes of 3D shapes”. In: ACM Trans. Graph. 35.4 (2016), 38:1–38:12. doi: 10.1145/2897824.2925938. url: http://doi.acm.org/10.1145/2897824.2925938.

Erin W. Chambers, Irina Kostitsyna, Maarten L?ffler, and Frank Staals. “Homotopy Measures for Representative Trajectories”. In: 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark. 2016, 27:1–27:17. doi: 10.4230/LIPIcs.ESA.2016.27. url: https://doi.org/10.4230/LIPIcs.ESA.2016.27.

Yajie Yan, Tao Ju, David Letscher, and Erin W. Chambers. “Burning the medial axis”. In: Special Interest Group on Computer Graphics and Interactive Techniques Conference, SIGGRAPH ’15, Los Angeles, CA, USA, August 9-13, 2015, Posters Proceedings. 2015, 62:1. doi: 10.1145/2787626.2792658. url: http://doi.acm.org/10.1145/2787626.2792658.

Erin W. Chambers, Kyle Fox, and Amir Nayyeri. “Counting and Sampling Minimum Cuts in Genus g g Graphs”. In: Discrete & Computational Geometry 52.3 (2014), pp. 450–475. doi: 10.1007/s00454-014-9623-4. url: https://doi.org/10.1007/s00454-014-9623-4.

Sergio Cabello, Erin W. Chambers, and Jeff Erickson. “Multiple-Source Shortest Paths in Embedded Graphs”. In: SIAM J. Comput. 42.4 (2013), pp. 1542–1571. doi: 10.1137/120864271. url: https://doi.org/10.1137/120864271.

Erin W. Chambers and David Eppstein. “Flows in One-Crossing-Minor-Free Graphs”. In: J. Graph Algorithms Appl. 17.3 (2013), pp. 201–220. doi: 10.7155/jgaa.00291. url: https://doi.org/10.7155/jgaa.00291.

Erin W. Chambers and Yusu Wang. “Measuring Similarity Between Curves on 2-Manifolds via Homotopy Area”. In: CoRR abs/1303.7427 (2013). arXiv: 1303.7427. url: http://arxiv.org/abs/1303.7427.

Erin W. Chambers, Kyle Fox, and Amir Nayyeri. “Counting and sampling minimum cuts in genus g graphs”. In: Symposuim on Computational Geometry 2013, SoCG ’13, Rio de Janeiro, Brazil, June 17-20, 2013. 2013, pp. 249–258. doi: 10.1145/2462356.2462366. url: http://doi.acm.org/10.1145/2462356.2462366.

Erin W. Chambers, Tao Ju, and David Letscher. “Medial Residues of Piecewise Linear Manifolds”. In: Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013. 2013. url: http://cccg.ca/proceedings/2013/papers/paper%5C_13.pdf.

Victor Alvarez, Erin W. Chambers, and L?szl? Kozma. “Privacy by Fake Data: A Geometric Approach”. In: Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013. 2013. url: http://cccg.ca/proceedings/2013/papers/paper%5C_12.pdf.

Erin W. Chambers, Jeff Erickson, and Amir Nayyeri. “Homology Flows, Cohomology Cuts”. In: SIAM J. Comput. 41.6 (2012), pp. 1605–1634. doi: 10.1137/090766863. url: https://doi.org/10.1137/090766863.

Erin W. Chambers, David Eppstein, Michael T. Goodrich, and Maarten L?ffler. “Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area”. In: J. Graph Algorithms Appl. 16.2 (2012), pp. 243–259. doi: 10.7155/jgaa.00257. url: https://doi.org/10.7155/jgaa.00257.

Sergio Cabello, Erin W. Chambers, and Jeff Erickson. “Multiple-Source Shortest Paths in Embedded Graphs”. In: CoRR abs/1202.0314 (2012). arXiv: 1202.0314. url: http://arxiv.org/abs/1202.0314.

Erin W. Chambers, Kyle Sykes, and Cynthia Traub. “Unfolding Rectangle-Faced Orthostacks”. In: Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012. 2012, pp. 23–28. url: http://2012.cccg.ca/papers/paper14.pdf.

Erin W. Chambers, S?ndor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, and Sue Whitesides. “Connecting a Set of Circles with Minimum Sum of Radii”. In: CoRR abs/1105.0791 (2011). arXiv: 1105.0791. url: http://arxiv.org/abs/1105.0791.

Lu Liu, Erin W. Chambers, David Letscher, and Tao Ju. “Extended grassfire transform on medial axes of 2D shapes”. In: Computer-Aided Design 43.11 (2011), pp. 1496–1505. doi: 10.1016/j.cad.2011.09.002. url: https://doi.org/10.1016/j.cad.2011.09.002.

Erin W. Chambers, S?ndor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, and Sue Whitesides. “Connecting a Set of Circles with Minimum Sum of Radii”. In: Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. 2011, pp. 183–194. doi: 10.1007/978-3-642-22300-6“?16. url: https://doi.org/10.1007/978-3-642-22300-6%5C_16.

Erin W. Chambers, David Letscher, Tao Ju, and Lu Liu. “Isotopic Fr?chet Distance”. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011. 2011. url: http://www.cccg.ca/proceedings/2011/papers/paper88.pdf.

Erin W. Chambers, Vin de Silva, Jeff Erickson, and Robert Ghrist. “Vietoris-Rips Complexes of Planar Point Sets”. In: Discrete & Computational Geometry 44.1 (2010), pp. 75–90. doi: 10.1007/s00454-009-9209-8. url: https://doi.org/10.1007/s00454-009-9209-8.

Erin W. Chambers, Alejandro Erickson, S?ndor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. “Connectivity graphs of uncertainty regions”. In: CoRR abs/1009.3469 (2010). arXiv: 1009.3469. url: http://arxiv.org/abs/1009.3469.

Erin W. Chambers, David Eppstein, Michael T. Goodrich, and Maarten L?ffler. “Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area”. In: CoRR abs/1009.0088 (2010). arXiv: 1009.0088. url: http://arxiv.org/abs/1009.0088.

Erin W. Chambers and David Eppstein. “Flows in One-Crossing-Minor-Free Graphs”. In: CoRR abs/1007.1484 (2010). arXiv: 1007.1484. url: http://arxiv.org/abs/1007.1484.

Erin W. Chambers, ?ric Colin de Verdi?re, Jeff Erickson, Sylvain Lazard, Francis Lazarus, and Shripad Thite. “Homotopic Fr?chet distance between curves or, walking your dog in the woods in polynomial time”. In: Comput. Geom. 43.3 (2010), pp. 295–311. doi: 10.1016/j.comgeo.2009.02.008. url: https://doi.org/10.1016/j.comgeo.2009.02.008.

L. Liu, Erin W. Chambers, David Letscher, and Tao Ju. “A simple and robust thinning algorithm on cell complexes”. In: Comput. Graph. Forum 29.7 (2010), pp. 2253–2260. doi: 10.1111/j.1467-8659.2010.01814.x. url: https://doi.org/10.1111/j.1467-8659.2010.01814.x.

Erin W. Chambers, Alejandro Erickson, S?ndor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, and Sue Whitesides. “Connectivity Graphs of Uncertainty Regions”. In: Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II. 2010, pp. 434–445. doi: 10.1007/978-3-642-17514-5“?37. url: https://doi.org/10.1007/978-3-642-17514-5%5C_37.

Erin W. Chambers and David Eppstein. “Flows in One-Crossing-Minor-Free Graphs”. In: Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I. 2010, pp. 241–252. doi: 10.1007/978-3-642-17517-6“?23. url: https://doi.org/10.1007/978-3-642-17517-6%5C_23.

Erin W. Chambers, David Eppstein, Michael T. Goodrich, and Maarten L?ffler. “Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area”. In: Graph Drawing - 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers. 2010, pp. 129–140. doi: 10.1007/978-3-642-18469-7“?12. url: https://doi.org/10.1007/978-3-642-18469-7%5C_12.

Erin W. Chambers, William B. Kinnersley, Noah Prince, and Douglas B. West. “Extremal Problems for Roman Domination”. In: SIAM J. Discrete Math. 23.3 (2009), pp. 1575–1586. doi: 10.1137/070699688. url: https://doi.org/10.1137/070699688.

Erin W. Chambers, Jeff Erickson, and Amir Nayyeri. “Homology flows, cohomology cuts”. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. 2009, pp. 273–282. doi: 10.1145/1536414.1536453. url: http://doi.acm.org/10.1145/1536414.1536453.

Erin W. Chambers, Jeff Erickson, and Amir Nayyeri. “Minimum cuts and shortest homologous cycles”. In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009. 2009, pp. 377–385. doi: 10.1145/1542362.1542426. url: http://doi.acm.org/10.1145/1542362.1542426.

Erin W. Chambers and David Letscher. “On the Height of a Homotopy”. In: Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009. 2009, pp. 103–106. url: http://cccg.ca/proceedings/2009/cccg09%5C_27.pdf.

David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, and Douglas B. West. “Pebbling and optimal pebbling in graphs”. In: Journal of Graph Theory 57.3 (2008), pp. 215–238. doi: 10.1002/jgt.20278. url: https://doi.org/10.1002/jgt.20278.

Erin W. Chambers, ?ric Colin de Verdi?re, Jeff Erickson, Francis Lazarus, and Kim Whittlesey. “Splitting (complicated) surfaces is hard”. In: Comput. Geom. 41.1-2 (2008), pp. 94–110. doi: 10.1016/j.comgeo.2007.10.010. url: https://doi.org/10.1016/j.comgeo.2007.10.010.

Tanya L. Crenshaw, Erin W. Chambers, and Heather Metcalf. “A case study of retention practices at the University of Illinois at Urbana-Champaign”. In: Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2008, Portland, OR, USA, March 12-15, 2008. 2008, pp. 412–416. doi: 10.1145/1352135.1352276. url: http://doi.acm.org/10.1145/1352135.1352276.

Erin W. Chambers, ?ric Colin de Verdi?re, Jeff Erickson, Sylvain Lazard, Francis Lazarus, and Shripad Thite. “Walking your dog in the woods in polynomial time”. In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008. 2008, pp. 101–109. doi: 10.1145/1377676.1377694. url: http://doi.acm.org/10.1145/1377676.1377694.

Erin W. Chambers, Jeff Erickson, and Pratik Worah. “Testing contractibility in planar rips complexes”. In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008. 2008, pp. 251–259. doi: 10.1145/1377676.1377721. url: http://doi.acm.org/10.1145/1377676.1377721.

Tanya L. Crenshaw, Erin W. Chambers, Heather Metcalf, and Umesh Thakkar. “Recruitment, Preparation, Retention: A case study of computing culture at the University of Illinois at Urbana-Champaign”. In: CoRR abs/cs/0702141 (2007). arXiv: cs/0702141. url: http://arxiv.org/abs/cs/0702141.

Sergio Cabello and Erin W. Chambers. “Multiple source shortest paths in a genus g graph”. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. 2007, pp. 89–97. url: http://dl.acm.org/citation.cfm?id=1283383.1283394.

Erin W. Chambers, ?ric Colin de Verdi?re, Jeff Erickson, Francis Lazarus, and Kim Whittlesey. “Splitting (complicated) surfaces is hard”. In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006. 2006, pp. 421–429. doi: 10.1145/1137856.1137918. url: http://doi.acm.org/10.1145/1137856.1137918.

Courses

Show all