default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErin W. Chambers
- > Home > Persons > Erin W. Chambers
Publications
- 2023
[j24]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. SIAM J. Comput. 52(1): 156-195 (2023)- 2021
- [c30]Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. SODA 2021: 2759-2778 - 2020
- [i18]Erin Wolf Chambers, Jeff Erickson, Patrick Lin, Salman Parsa:
How to Morph Graphs on the Torus. CoRR abs/2007.07927 (2020) - 2019
- [i15]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. CoRR abs/1910.04278 (2019) - 2016
- [r1]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Global Minimum Cuts in Surface-Embedded Graphs. Encyclopedia of Algorithms 2016: 852-856 - 2013
- [j10]Sergio Cabello, Erin W. Chambers
, Jeff Erickson:
Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. 42(4): 1542-1571 (2013) - 2012
- [j8]Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Homology Flows, Cohomology Cuts. SIAM J. Comput. 41(6): 1605-1634 (2012) - [i6]Sergio Cabello, Erin W. Chambers, Jeff Erickson:
Multiple-Source Shortest Paths in Embedded Graphs. CoRR abs/1202.0314 (2012) - 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) - 2009
- [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
- [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) - [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 - 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
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 2024-08-22 20:48 CEST 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:
