default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGlencora Borradaile
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]Glencora Borradaile, Kelsy Kretschmer
, Michele Gretes, Alexandria LeClerc:
The Motivated Can Encrypt (Even with PGP). Proc. Priv. Enhancing Technol. 2021(3): 49-69 (2021)- [i34]Glencora Borradaile, Kelsy Kretschmer, Michele Gretes, Alexandria LeClerc:
The Motivated Can Encrypt (Even with PGP). CoRR abs/2104.04478 (2021) - 2020
- [c28]Glencora Borradaile, William Maxwell, Amir Nayyeri:
Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. SoCG 2020: 21:1-21:15 - [c27]Glencora Borradaile, Brett Burkhardt, Alexandria LeClerc:
Whose tweets are surveilled for the police: an audit of a social-media monitoring tool via log files. FAT* 2020: 570-580 - [c26]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 - [i33]Glencora Borradaile, Brett Burkhardt, Alexandria LeClerc:
Whose Tweets are Surveilled for the Police: An Audit of Social-Media Monitoring Tool via Log Files. CoRR abs/2001.08777 (2020) - [i32]Glencora Borradaile, William Maxwell, Amir Nayyeri:
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes. CoRR abs/2003.02801 (2020) - [i31]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)
2010 – 2019
- 2019
- [j18]Glencora Borradaile, Theresa Migler, Gordon T. Wilfong:
Density decompositions of networks. J. Graph Algorithms Appl. 23(4): 625-651 (2019) - [c25]Glencora Borradaile, Hung Le, Baigong Zheng:
Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs. SEA² 2019: 98-113 - [c24]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Greedy spanners are optimal in doubling metrics. SODA 2019: 2371-2379 - 2018
- [i30]Glencora Borradaile, Hung Le, Baigong Zheng:
Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs. CoRR abs/1804.07869 (2018) - 2017
- [j17]Glencora Borradaile, Hung Le, Melissa Sherman-Bennett:
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph. Graphs Comb. 33(6): 1621-1634 (2017) - [j16]Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang:
Egalitarian Graph Orientations. J. Graph Algorithms Appl. 21(4): 687-708 (2017) - [j15]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) - [j14]Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. SIAM J. Comput. 46(4): 1280-1303 (2017) - [c23]Glencora Borradaile, Baigong Zheng:
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs. APPROX-RANDOM 2017: 3:1-3:13 - [c22]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Minor-Free Graphs Have Light Spanners. FOCS 2017: 767-778 - [i29]Glencora Borradaile, Jeff Erickson, Hung Le, Robbie Weber:
Embedded-width: A variant of treewidth for plane graphs. CoRR abs/1703.07532 (2017) - [i28]Glencora Borradaile, Hung Le:
Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs. CoRR abs/1703.10633 (2017) - [i27]Glencora Borradaile, Morgan Shirley:
Time-dependent shortest paths in bounded treewidth graphs. CoRR abs/1706.01508 (2017) - [i26]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Minor-free graphs have light spanners. CoRR abs/1711.00821 (2017) - [i25]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Greedy spanners are optimal in doubling metrics. CoRR abs/1712.05007 (2017) - 2016
- [j13]Glencora Borradaile, W. Sean Kennedy, Gordon T. Wilfong, Lisa Zhang:
Improving robustness of next-hop routing. J. Comb. Optim. 31(3): 1206-1220 (2016) - [j12]Glencora Borradaile, Philip N. Klein:
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs. ACM Trans. Algorithms 12(3): 30:1-30:29 (2016) - [c21]Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. SoCG 2016: 22:1-22:16 - [c20]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum Cycle and Homology Bases of Surface Embedded Graphs. SoCG 2016: 23:1-23:15 - [c19]Glencora Borradaile, Hung Le:
Optimal Dynamic Program for r-Domination Problems over Tree Decompositions. IPEC 2016: 8:1-8:23 - [r4]Glencora Borradaile:
Planar Maximum Flow - Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs. Encyclopedia of Algorithms 2016: 1574-1576 - [r3]Glencora Borradaile:
Planar Maximum s- t Flow. Encyclopedia of Algorithms 2016: 1576-1579 - [r2]Glencora Borradaile:
Planarity Testing. Encyclopedia of Algorithms 2016: 1584-1585 - [i24]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum cycle and homology bases of surface embedded graphs. CoRR abs/1607.05112 (2016) - [i23]Glencora Borradaile, Baigong Zheng:
A PTAS for Three-Edge Connectivity in Planar Graphs. CoRR abs/1611.03889 (2016) - 2015
- [j11]Glencora Borradaile, David Eppstein:
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets. Comput. Geom. 49: 8-16 (2015) - [j10]Glencora Borradaile, David Eppstein, Pingan Zhu:
Planar Induced Subgraphs of Sparse Graphs. J. Graph Algorithms Appl. 19(1): 281-297 (2015) - [j9]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. ACM Trans. Algorithms 11(3): 16:1-16:29 (2015) - [j8]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. ACM Trans. Algorithms 11(3): 19:1-19:20 (2015) - [c18]Glencora Borradaile, Amir Nayyeri, Farzad Zafarani:
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs. ESA 2015: 227-238 - [i22]Glencora Borradaile, Hung Le:
Optimal dynamic program for r-domination problems over tree decompositions. CoRR abs/1502.00716 (2015) - [i21]Glencora Borradaile, Amir Nayyeri, Farzad Zafarani:
Towards single face shortest vertex-disjoint paths in undirected planar graphs. CoRR abs/1507.05980 (2015) - 2014
- [j7]Glencora Borradaile, Erik D. Demaine, Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Algorithmica 68(2): 287-311 (2014) - [j6]Glencora Borradaile, Erin Wolf Chambers:
Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls. Discret. Comput. Geom. 51(4): 979-996 (2014) - [c17]Glencora Borradaile, David Eppstein, Pingan Zhu:
Planar Induced Subgraphs of Sparse Graphs. GD 2014: 1-12 - [i20]Glencora Borradaile, Erin Wolf Chambers:
Covering nearly surface-embedded graphs with a fixed number of balls. CoRR abs/1403.8086 (2014) - [i19]Glencora Borradaile, Claire Mathieu, Theresa Migler:
Lower bounds for testing digraph connectivity with one-pass streaming algorithms. CoRR abs/1404.1323 (2014) - [i18]Glencora Borradaile, Theresa Migler, Gordon T. Wilfong:
Density decompositions of networks. CoRR abs/1405.1001 (2014) - [i17]Glencora Borradaile, David Eppstein, Pingan Zhu:
Planar Induced Subgraphs of Sparse Graphs. CoRR abs/1408.5939 (2014) - [i16]Glencora Borradaile, William Sean Kennedy, Gordon T. Wilfong, Lisa Zhang:
Improving Robustness of Next-Hop Routing. CoRR abs/1411.2873 (2014) - [i15]Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. CoRR abs/1411.7055 (2014) - 2013
- [c16]Glencora Borradaile, Anna Harutyunyan:
Boundary-to-Boundary Flows in Planar Graphs. IWOCA 2013: 67-80 - [c15]Glencora Borradaile, Anna Harutyunyan:
Maximum st-Flow in Directed Planar Graphs via Shortest Paths. IWOCA 2013: 423-427 - [i14]Glencora Borradaile, Philip N. Klein:
The two-edge connectivity survivable-network design problem in planar graphs. CoRR abs/1302.2184 (2013) - [i13]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
A polynomial-time approximation scheme for Euclidean Steiner forest. CoRR abs/1302.7270 (2013) - [i12]Glencora Borradaile, Anna Harutyunyan:
Maximum st-flow in directed planar graphs via shortest paths. CoRR abs/1305.5823 (2013) - [i11]Glencora Borradaile, Anna Harutyunyan:
Boundary-to-boundary flows in planar graphs. CoRR abs/1306.5391 (2013) - [i10]Glencora Borradaile, Philip N. Klein, Dániel Marx, Claire Mathieu:
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421). Dagstuhl Reports 3(10): 36-57 (2013) - 2012
- [j5]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The knapsack problem with neighbour constraints. J. Discrete Algorithms 16: 224-235 (2012) - [c14]Glencora Borradaile, David Eppstein:
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CCCG 2012: 297-302 - [c13]Javad Azimi, Alan Fern, Xiaoli Zhang Fern, Glencora Borradaile, Brent Heeringa:
Batch Active Learning via Coordinated Matching. ICML 2012 - [c12]Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen:
Connectivity Oracles for Planar Graphs. SWAT 2012: 316-327 - [c11]Anna Harutyunyan, Glencora Borradaile, Chris Chambers, Christopher Scaffidi:
Planted-model evaluation of algorithms for identifying differences between spreadsheets. VL/HCC 2012: 7-14 - [i9]Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen:
Connectivity Oracles for Planar Graphs. CoRR abs/1204.4159 (2012) - [i8]Glencora Borradaile, David Eppstein:
Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets. CoRR abs/1206.2254 (2012) - [i7]Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon T. Wilfong, Lisa Zhang:
Egalitarian Graph Orientations. CoRR abs/1212.2178 (2012) - 2011
- [c10]Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS 2011: 170-179 - [c9]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The 1-Neighbour Knapsack Problem. IWOCA 2011: 71-84 - [i6]Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. CoRR abs/1105.2228 (2011) - 2010
- [j4]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. Comput. Geom. 43(8): 655-662 (2010) - [c8]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS 2010: 601-610 - [i5]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. CoRR abs/1003.1320 (2010) - [i4]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. CoRR abs/1003.1426 (2010) - [i3]Glencora Borradaile, Christian Wulff-Nilsen:
Multiple source, single sink maximum flow in a planar graph. CoRR abs/1008.4966 (2010)
2000 – 2009
- 2009
- [j3]Glencora Borradaile, Philip N. Klein:
An O(n log n) algorithm for maximum st-flow in a directed planar graph. J. ACM 56(2): 9:1-9:30 (2009) - [j2]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
An O(n log n) approximation scheme for Steiner tree in planar graphs. ACM Trans. Algorithms 5(3): 31:1-31:31 (2009) - [c7]Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. SCG 2009: 371-376 - [c6]Glencora Borradaile, Erik D. Demaine, Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS 2009: 171-182 - [i2]Glencora Borradaile, Erik D. Demaine, Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. CoRR abs/0902.1043 (2009) - [i1]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
Approximation Algorithms for Constrained Knapsack Problems. CoRR abs/0910.0777 (2009) - 2008
- [b1]Glencora Borradaile:
Exploiting Planarity for Network Flow and Connectivity Problems. Brown University, USA, 2008 - [c5]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. FOCS 2008: 115-124 - [c4]Glencora Borradaile, Philip N. Klein:
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. ICALP (1) 2008: 485-501 - [r1]Glencora Borradaile:
Planarity Testing. Encyclopedia of Algorithms 2008 - 2007
- [c3]Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein:
A polynomial-time approximation scheme for Steiner tree in planar graphs. SODA 2007: 1285-1294 - [c2]Glencora Borradaile, Philip N. Klein, Claire Mathieu:
Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon. WADS 2007: 275-286 - 2006
- [c1]Glencora Borradaile, Philip N. Klein:
An O (n log n) algorithm for maximum st-flow in a directed planar graph. SODA 2006: 524-533 - 2005
- [j1]Glencora Borradaile, Pascal Van Hentenryck:
Safe and tight linear estimators for global optimization. Math. Program. 102(3): 495-517 (2005)
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 2024-05-06 21:14 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:
