Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Glencora Borradaile

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Glencora Borradaile

download as .bib file

@article{DBLP:journals/popets/BorradaileKGL21,
  author       = {Glencora Borradaile and
                  Kelsy Kretschmer and
                  Michele Gretes and
                  Alexandria LeClerc},
  title        = {The Motivated Can Encrypt (Even with {PGP)}},
  journal      = {Proc. Priv. Enhancing Technol.},
  volume       = {2021},
  number       = {3},
  pages        = {49--69},
  year         = {2021},
  url          = {https://doi.org/10.2478/popets-2021-0037},
  doi          = {10.2478/POPETS-2021-0037},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/popets/BorradaileKGL21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2104-04478,
  author       = {Glencora Borradaile and
                  Kelsy Kretschmer and
                  Michele Gretes and
                  Alexandria LeClerc},
  title        = {The Motivated Can Encrypt (Even with {PGP)}},
  journal      = {CoRR},
  volume       = {abs/2104.04478},
  year         = {2021},
  url          = {https://arxiv.org/abs/2104.04478},
  eprinttype    = {arXiv},
  eprint       = {2104.04478},
  timestamp    = {Tue, 13 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-04478.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/BorradaileMN20,
  author       = {Glencora Borradaile and
                  William Maxwell and
                  Amir Nayyeri},
  editor       = {Sergio Cabello and
                  Danny Z. Chen},
  title        = {Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial
                  Complexes},
  booktitle    = {36th International Symposium on Computational Geometry, SoCG 2020,
                  June 23-26, 2020, Z{\"{u}}rich, Switzerland},
  series       = {LIPIcs},
  volume       = {164},
  pages        = {21:1--21:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2020.21},
  doi          = {10.4230/LIPICS.SOCG.2020.21},
  timestamp    = {Wed, 16 Jun 2021 12:02:54 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/BorradaileMN20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fat/BorradaileBL20,
  author       = {Glencora Borradaile and
                  Brett Burkhardt and
                  Alexandria LeClerc},
  editor       = {Mireille Hildebrandt and
                  Carlos Castillo and
                  L. Elisa Celis and
                  Salvatore Ruggieri and
                  Linnet Taylor and
                  Gabriela Zanfir{-}Fortuna},
  title        = {Whose tweets are surveilled for the police: an audit of a social-media
                  monitoring tool via log files},
  booktitle    = {FAT* '20: Conference on Fairness, Accountability, and Transparency,
                  Barcelona, Spain, January 27-30, 2020},
  pages        = {570--580},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3351095.3372841},
  doi          = {10.1145/3351095.3372841},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fat/BorradaileBL20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/swat/BorradaileCEMN20,
  author       = {Glencora Borradaile and
                  Erin Wolf Chambers and
                  David Eppstein and
                  William Maxwell and
                  Amir Nayyeri},
  editor       = {Susanne Albers},
  title        = {Low-Stretch Spanning Trees of Graphs with Bounded Width},
  booktitle    = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
                  2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
  series       = {LIPIcs},
  volume       = {162},
  pages        = {15:1--15:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.SWAT.2020.15},
  doi          = {10.4230/LIPICS.SWAT.2020.15},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/BorradaileCEMN20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2001-08777,
  author       = {Glencora Borradaile and
                  Brett Burkhardt and
                  Alexandria LeClerc},
  title        = {Whose Tweets are Surveilled for the Police: An Audit of Social-Media
                  Monitoring Tool via Log Files},
  journal      = {CoRR},
  volume       = {abs/2001.08777},
  year         = {2020},
  url          = {https://arxiv.org/abs/2001.08777},
  eprinttype    = {arXiv},
  eprint       = {2001.08777},
  timestamp    = {Thu, 30 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2001-08777.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2003-02801,
  author       = {Glencora Borradaile and
                  William Maxwell and
                  Amir Nayyeri},
  title        = {Minimum bounded chains and minimum homologous chains in embedded simplicial
                  complexes},
  journal      = {CoRR},
  volume       = {abs/2003.02801},
  year         = {2020},
  url          = {https://arxiv.org/abs/2003.02801},
  eprinttype    = {arXiv},
  eprint       = {2003.02801},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2003-02801.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2004-08375,
  author       = {Glencora Borradaile and
                  Erin Wolf Chambers and
                  David Eppstein and
                  William Maxwell and
                  Amir Nayyeri},
  title        = {Low-stretch spanning trees of graphs with bounded width},
  journal      = {CoRR},
  volume       = {abs/2004.08375},
  year         = {2020},
  url          = {https://arxiv.org/abs/2004.08375},
  eprinttype    = {arXiv},
  eprint       = {2004.08375},
  timestamp    = {Tue, 21 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2004-08375.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/BorradaileMW19,
  author       = {Glencora Borradaile and
                  Theresa Migler and
                  Gordon T. Wilfong},
  title        = {Density decompositions of networks},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {23},
  number       = {4},
  pages        = {625--651},
  year         = {2019},
  url          = {https://doi.org/10.7155/jgaa.00505},
  doi          = {10.7155/JGAA.00505},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/BorradaileMW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sea2/BorradaileLZ19,
  author       = {Glencora Borradaile and
                  Hung Le and
                  Baigong Zheng},
  editor       = {Ilias S. Kotsireas and
                  Panos M. Pardalos and
                  Konstantinos E. Parsopoulos and
                  Dimitris Souravlias and
                  Arsenis Tsokas},
  title        = {Engineering a {PTAS} for Minimum Feedback Vertex Set in Planar Graphs},
  booktitle    = {Analysis of Experimental Algorithms - Special Event, SEA{\({^2}\)}
                  2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {11544},
  pages        = {98--113},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-34029-2\_7},
  doi          = {10.1007/978-3-030-34029-2\_7},
  timestamp    = {Tue, 12 May 2020 10:56:04 +0200},
  biburl       = {https://dblp.org/rec/conf/sea2/BorradaileLZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BorradaileLW19,
  author       = {Glencora Borradaile and
                  Hung Le and
                  Christian Wulff{-}Nilsen},
  editor       = {Timothy M. Chan},
  title        = {Greedy spanners are optimal in doubling metrics},
  booktitle    = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
                  2019},
  pages        = {2371--2379},
  publisher    = {{SIAM}},
  year         = {2019},
  url          = {https://doi.org/10.1137/1.9781611975482.145},
  doi          = {10.1137/1.9781611975482.145},
  timestamp    = {Thu, 15 Jul 2021 13:49:01 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BorradaileLW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1804-07869,
  author       = {Glencora Borradaile and
                  Hung Le and
                  Baigong Zheng},
  title        = {Designing Practical PTASes for Minimum Feedback Vertex Set in Planar
                  Graphs},
  journal      = {CoRR},
  volume       = {abs/1804.07869},
  year         = {2018},
  url          = {http://arxiv.org/abs/1804.07869},
  eprinttype    = {arXiv},
  eprint       = {1804.07869},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1804-07869.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/gc/BorradaileLS17,
  author       = {Glencora Borradaile and
                  Hung Le and
                  Melissa Sherman{-}Bennett},
  title        = {Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph},
  journal      = {Graphs Comb.},
  volume       = {33},
  number       = {6},
  pages        = {1621--1634},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00373-017-1859-3},
  doi          = {10.1007/S00373-017-1859-3},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/gc/BorradaileLS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/BorradaileIMOWZ17,
  author       = {Glencora Borradaile and
                  Jennifer Iglesias and
                  Theresa Migler and
                  Antonio Ochoa and
                  Gordon T. Wilfong and
                  Lisa Zhang},
  title        = {Egalitarian Graph Orientations},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {21},
  number       = {4},
  pages        = {687--708},
  year         = {2017},
  url          = {https://doi.org/10.7155/jgaa.00435},
  doi          = {10.7155/JGAA.00435},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/BorradaileIMOWZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jocg/BorradaileCFN17,
  author       = {Glencora Borradaile and
                  Erin Wolf Chambers and
                  Kyle Fox and
                  Amir Nayyeri},
  title        = {Minimum cycle and homology bases of surface-embedded graphs},
  journal      = {J. Comput. Geom.},
  volume       = {8},
  number       = {2},
  pages        = {58--79},
  year         = {2017},
  url          = {https://doi.org/10.20382/jocg.v8i2a4},
  doi          = {10.20382/JOCG.V8I2A4},
  timestamp    = {Thu, 10 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jocg/BorradaileCFN17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BorradaileKMNW17,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Shay Mozes and
                  Yahav Nussbaum and
                  Christian Wulff{-}Nilsen},
  title        = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
                  in Near-Linear Time},
  journal      = {{SIAM} J. Comput.},
  volume       = {46},
  number       = {4},
  pages        = {1280--1303},
  year         = {2017},
  url          = {https://doi.org/10.1137/15M1042929},
  doi          = {10.1137/15M1042929},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BorradaileKMNW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/approx/BorradaileZ17,
  author       = {Glencora Borradaile and
                  Baigong Zheng},
  editor       = {Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim and
                  David Williamson and
                  Santosh S. Vempala},
  title        = {A {PTAS} for Three-Edge-Connected Survivable Network Design in Planar
                  Graphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
                  CA, {USA}},
  series       = {LIPIcs},
  volume       = {81},
  pages        = {3:1--3:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.3},
  doi          = {10.4230/LIPICS.APPROX-RANDOM.2017.3},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/BorradaileZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BorradaileLW17,
  author       = {Glencora Borradaile and
                  Hung Le and
                  Christian Wulff{-}Nilsen},
  editor       = {Chris Umans},
  title        = {Minor-Free Graphs Have Light Spanners},
  booktitle    = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2017, Berkeley, CA, USA, October 15-17, 2017},
  pages        = {767--778},
  publisher    = {{IEEE} Computer Society},
  year         = {2017},
  url          = {https://doi.org/10.1109/FOCS.2017.76},
  doi          = {10.1109/FOCS.2017.76},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BorradaileLW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileELW17,
  author       = {Glencora Borradaile and
                  Jeff Erickson and
                  Hung Le and
                  Robbie Weber},
  title        = {Embedded-width: {A} variant of treewidth for plane graphs},
  journal      = {CoRR},
  volume       = {abs/1703.07532},
  year         = {2017},
  url          = {http://arxiv.org/abs/1703.07532},
  eprinttype    = {arXiv},
  eprint       = {1703.07532},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileELW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileL17,
  author       = {Glencora Borradaile and
                  Hung Le},
  title        = {Light spanners for bounded treewidth graphs imply light spanners for
                  {\textdollar}H{\textdollar}-minor-free graphs},
  journal      = {CoRR},
  volume       = {abs/1703.10633},
  year         = {2017},
  url          = {http://arxiv.org/abs/1703.10633},
  eprinttype    = {arXiv},
  eprint       = {1703.10633},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileS17,
  author       = {Glencora Borradaile and
                  Morgan Shirley},
  title        = {Time-dependent shortest paths in bounded treewidth graphs},
  journal      = {CoRR},
  volume       = {abs/1706.01508},
  year         = {2017},
  url          = {http://arxiv.org/abs/1706.01508},
  eprinttype    = {arXiv},
  eprint       = {1706.01508},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1711-00821,
  author       = {Glencora Borradaile and
                  Hung Le and
                  Christian Wulff{-}Nilsen},
  title        = {Minor-free graphs have light spanners},
  journal      = {CoRR},
  volume       = {abs/1711.00821},
  year         = {2017},
  url          = {http://arxiv.org/abs/1711.00821},
  eprinttype    = {arXiv},
  eprint       = {1711.00821},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1711-00821.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1712-05007,
  author       = {Glencora Borradaile and
                  Hung Le and
                  Christian Wulff{-}Nilsen},
  title        = {Greedy spanners are optimal in doubling metrics},
  journal      = {CoRR},
  volume       = {abs/1712.05007},
  year         = {2017},
  url          = {http://arxiv.org/abs/1712.05007},
  eprinttype    = {arXiv},
  eprint       = {1712.05007},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1712-05007.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jco/BorradaileKWZ16,
  author       = {Glencora Borradaile and
                  W. Sean Kennedy and
                  Gordon T. Wilfong and
                  Lisa Zhang},
  title        = {Improving robustness of next-hop routing},
  journal      = {J. Comb. Optim.},
  volume       = {31},
  number       = {3},
  pages        = {1206--1220},
  year         = {2016},
  url          = {https://doi.org/10.1007/s10878-014-9818-x},
  doi          = {10.1007/S10878-014-9818-X},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/BorradaileKWZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/BorradaileK16,
  author       = {Glencora Borradaile and
                  Philip N. Klein},
  title        = {The Two-Edge Connectivity Survivable-Network Design Problem in Planar
                  Graphs},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {12},
  number       = {3},
  pages        = {30:1--30:29},
  year         = {2016},
  url          = {https://doi.org/10.1145/2831235},
  doi          = {10.1145/2831235},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/BorradaileK16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/BorradaileENW16,
  author       = {Glencora Borradaile and
                  David Eppstein and
                  Amir Nayyeri and
                  Christian Wulff{-}Nilsen},
  editor       = {S{\'{a}}ndor P. Fekete and
                  Anna Lubiw},
  title        = {All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs},
  booktitle    = {32nd International Symposium on Computational Geometry, SoCG 2016,
                  June 14-18, 2016, Boston, MA, {USA}},
  series       = {LIPIcs},
  volume       = {51},
  pages        = {22:1--22:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2016.22},
  doi          = {10.4230/LIPICS.SOCG.2016.22},
  timestamp    = {Wed, 16 Jun 2021 12:03:34 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/BorradaileENW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/BorradaileCFN16,
  author       = {Glencora Borradaile and
                  Erin Wolf Chambers and
                  Kyle Fox and
                  Amir Nayyeri},
  editor       = {S{\'{a}}ndor P. Fekete and
                  Anna Lubiw},
  title        = {Minimum Cycle and Homology Bases of Surface Embedded Graphs},
  booktitle    = {32nd International Symposium on Computational Geometry, SoCG 2016,
                  June 14-18, 2016, Boston, MA, {USA}},
  series       = {LIPIcs},
  volume       = {51},
  pages        = {23:1--23:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2016.23},
  doi          = {10.4230/LIPICS.SOCG.2016.23},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/BorradaileCFN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwpec/BorradaileL16,
  author       = {Glencora Borradaile and
                  Hung Le},
  editor       = {Jiong Guo and
                  Danny Hermelin},
  title        = {Optimal Dynamic Program for r-Domination Problems over Tree Decompositions},
  booktitle    = {11th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
  series       = {LIPIcs},
  volume       = {63},
  pages        = {8:1--8:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2016.8},
  doi          = {10.4230/LIPICS.IPEC.2016.8},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/BorradaileL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:reference/algo/Borradaile16,
  author       = {Glencora Borradaile},
  title        = {Planar Maximum Flow - Multiple-Source Multiple-Sink Maximum Flow in
                  Directed Planar Graphs},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {1574--1576},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_556},
  doi          = {10.1007/978-1-4939-2864-4\_556},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Borradaile16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:reference/algo/Borradaile16a,
  author       = {Glencora Borradaile},
  title        = {Planar Maximum \emph{s}- \emph{t} Flow},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {1576--1579},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_626},
  doi          = {10.1007/978-1-4939-2864-4\_626},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Borradaile16a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:reference/algo/Borradaile16b,
  author       = {Glencora Borradaile},
  title        = {Planarity Testing},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {1584--1585},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_295},
  doi          = {10.1007/978-1-4939-2864-4\_295},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Borradaile16b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileCFN16,
  author       = {Glencora Borradaile and
                  Erin Wolf Chambers and
                  Kyle Fox and
                  Amir Nayyeri},
  title        = {Minimum cycle and homology bases of surface embedded graphs},
  journal      = {CoRR},
  volume       = {abs/1607.05112},
  year         = {2016},
  url          = {http://arxiv.org/abs/1607.05112},
  eprinttype    = {arXiv},
  eprint       = {1607.05112},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileCFN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileZ16,
  author       = {Glencora Borradaile and
                  Baigong Zheng},
  title        = {A {PTAS} for Three-Edge Connectivity in Planar Graphs},
  journal      = {CoRR},
  volume       = {abs/1611.03889},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.03889},
  eprinttype    = {arXiv},
  eprint       = {1611.03889},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/BorradaileE15,
  author       = {Glencora Borradaile and
                  David Eppstein},
  title        = {Near-linear-time deterministic plane Steiner spanners for well-spaced
                  point sets},
  journal      = {Comput. Geom.},
  volume       = {49},
  pages        = {8--16},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.comgeo.2015.04.005},
  doi          = {10.1016/J.COMGEO.2015.04.005},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/BorradaileE15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/BorradaileEZ15,
  author       = {Glencora Borradaile and
                  David Eppstein and
                  Pingan Zhu},
  title        = {Planar Induced Subgraphs of Sparse Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {19},
  number       = {1},
  pages        = {281--297},
  year         = {2015},
  url          = {https://doi.org/10.7155/jgaa.00358},
  doi          = {10.7155/JGAA.00358},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/BorradaileEZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/BorradaileSW15,
  author       = {Glencora Borradaile and
                  Piotr Sankowski and
                  Christian Wulff{-}Nilsen},
  title        = {Min \emph{st}-Cut Oracle for Planar Graphs with Near-Linear Preprocessing
                  Time},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {11},
  number       = {3},
  pages        = {16:1--16:29},
  year         = {2015},
  url          = {https://doi.org/10.1145/2684068},
  doi          = {10.1145/2684068},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/BorradaileSW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/BorradaileKM15,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Claire Mathieu},
  title        = {A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {11},
  number       = {3},
  pages        = {19:1--19:20},
  year         = {2015},
  url          = {https://doi.org/10.1145/2629654},
  doi          = {10.1145/2629654},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/BorradaileKM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/BorradaileNZ15,
  author       = {Glencora Borradaile and
                  Amir Nayyeri and
                  Farzad Zafarani},
  editor       = {Nikhil Bansal and
                  Irene Finocchi},
  title        = {Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar
                  Graphs},
  booktitle    = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
                  Greece, September 14-16, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9294},
  pages        = {227--238},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48350-3\_20},
  doi          = {10.1007/978-3-662-48350-3\_20},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/BorradaileNZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileL15,
  author       = {Glencora Borradaile and
                  Hung Le},
  title        = {Optimal dynamic program for r-domination problems over tree decompositions},
  journal      = {CoRR},
  volume       = {abs/1502.00716},
  year         = {2015},
  url          = {http://arxiv.org/abs/1502.00716},
  eprinttype    = {arXiv},
  eprint       = {1502.00716},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileNZ15,
  author       = {Glencora Borradaile and
                  Amir Nayyeri and
                  Farzad Zafarani},
  title        = {Towards single face shortest vertex-disjoint paths in undirected planar
                  graphs},
  journal      = {CoRR},
  volume       = {abs/1507.05980},
  year         = {2015},
  url          = {http://arxiv.org/abs/1507.05980},
  eprinttype    = {arXiv},
  eprint       = {1507.05980},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileNZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BorradaileDT14,
  author       = {Glencora Borradaile and
                  Erik D. Demaine and
                  Siamak Tazari},
  title        = {Polynomial-Time Approximation Schemes for Subset-Connectivity Problems
                  in Bounded-Genus Graphs},
  journal      = {Algorithmica},
  volume       = {68},
  number       = {2},
  pages        = {287--311},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00453-012-9662-2},
  doi          = {10.1007/S00453-012-9662-2},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BorradaileDT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcg/BorradaileC14,
  author       = {Glencora Borradaile and
                  Erin Wolf Chambers},
  title        = {Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls},
  journal      = {Discret. Comput. Geom.},
  volume       = {51},
  number       = {4},
  pages        = {979--996},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00454-014-9594-5},
  doi          = {10.1007/S00454-014-9594-5},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcg/BorradaileC14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/gd/BorradaileEZ14,
  author       = {Glencora Borradaile and
                  David Eppstein and
                  Pingan Zhu},
  editor       = {Christian A. Duncan and
                  Antonios Symvonis},
  title        = {Planar Induced Subgraphs of Sparse Graphs},
  booktitle    = {Graph Drawing - 22nd International Symposium, {GD} 2014, W{\"{u}}rzburg,
                  Germany, September 24-26, 2014, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8871},
  pages        = {1--12},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-45803-7\_1},
  doi          = {10.1007/978-3-662-45803-7\_1},
  timestamp    = {Sun, 13 Nov 2022 09:57:27 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/BorradaileEZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileC14,
  author       = {Glencora Borradaile and
                  Erin Wolf Chambers},
  title        = {Covering nearly surface-embedded graphs with a fixed number of balls},
  journal      = {CoRR},
  volume       = {abs/1403.8086},
  year         = {2014},
  url          = {http://arxiv.org/abs/1403.8086},
  eprinttype    = {arXiv},
  eprint       = {1403.8086},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileC14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileMM14,
  author       = {Glencora Borradaile and
                  Claire Mathieu and
                  Theresa Migler},
  title        = {Lower bounds for testing digraph connectivity with one-pass streaming
                  algorithms},
  journal      = {CoRR},
  volume       = {abs/1404.1323},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.1323},
  eprinttype    = {arXiv},
  eprint       = {1404.1323},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileMM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileMW14,
  author       = {Glencora Borradaile and
                  Theresa Migler and
                  Gordon T. Wilfong},
  title        = {Density decompositions of networks},
  journal      = {CoRR},
  volume       = {abs/1405.1001},
  year         = {2014},
  url          = {http://arxiv.org/abs/1405.1001},
  eprinttype    = {arXiv},
  eprint       = {1405.1001},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileMW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileEZ14,
  author       = {Glencora Borradaile and
                  David Eppstein and
                  Pingan Zhu},
  title        = {Planar Induced Subgraphs of Sparse Graphs},
  journal      = {CoRR},
  volume       = {abs/1408.5939},
  year         = {2014},
  url          = {http://arxiv.org/abs/1408.5939},
  eprinttype    = {arXiv},
  eprint       = {1408.5939},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileEZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileKWZ14,
  author       = {Glencora Borradaile and
                  William Sean Kennedy and
                  Gordon T. Wilfong and
                  Lisa Zhang},
  title        = {Improving Robustness of Next-Hop Routing},
  journal      = {CoRR},
  volume       = {abs/1411.2873},
  year         = {2014},
  url          = {http://arxiv.org/abs/1411.2873},
  eprinttype    = {arXiv},
  eprint       = {1411.2873},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileKWZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileENW14,
  author       = {Glencora Borradaile and
                  David Eppstein and
                  Amir Nayyeri and
                  Christian Wulff{-}Nilsen},
  title        = {All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs},
  journal      = {CoRR},
  volume       = {abs/1411.7055},
  year         = {2014},
  url          = {http://arxiv.org/abs/1411.7055},
  eprinttype    = {arXiv},
  eprint       = {1411.7055},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileENW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BorradaileH13,
  author       = {Glencora Borradaile and
                  Anna Harutyunyan},
  editor       = {Thierry Lecroq and
                  Laurent Mouchard},
  title        = {Boundary-to-Boundary Flows in Planar Graphs},
  booktitle    = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
                  Rouen, France, July 10-12, 2013, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8288},
  pages        = {67--80},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45278-9\_7},
  doi          = {10.1007/978-3-642-45278-9\_7},
  timestamp    = {Wed, 25 Sep 2019 18:08:04 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BorradaileH13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BorradaileH13a,
  author       = {Glencora Borradaile and
                  Anna Harutyunyan},
  editor       = {Thierry Lecroq and
                  Laurent Mouchard},
  title        = {Maximum st-Flow in Directed Planar Graphs via Shortest Paths},
  booktitle    = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
                  Rouen, France, July 10-12, 2013, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8288},
  pages        = {423--427},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45278-9\_36},
  doi          = {10.1007/978-3-642-45278-9\_36},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BorradaileH13a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1302-2184,
  author       = {Glencora Borradaile and
                  Philip N. Klein},
  title        = {The two-edge connectivity survivable-network design problem in planar
                  graphs},
  journal      = {CoRR},
  volume       = {abs/1302.2184},
  year         = {2013},
  url          = {http://arxiv.org/abs/1302.2184},
  eprinttype    = {arXiv},
  eprint       = {1302.2184},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-2184.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1302-7270,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Claire Mathieu},
  title        = {A polynomial-time approximation scheme for Euclidean Steiner forest},
  journal      = {CoRR},
  volume       = {abs/1302.7270},
  year         = {2013},
  url          = {http://arxiv.org/abs/1302.7270},
  eprinttype    = {arXiv},
  eprint       = {1302.7270},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-7270.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1305-5823,
  author       = {Glencora Borradaile and
                  Anna Harutyunyan},
  title        = {Maximum st-flow in directed planar graphs via shortest paths},
  journal      = {CoRR},
  volume       = {abs/1305.5823},
  year         = {2013},
  url          = {http://arxiv.org/abs/1305.5823},
  eprinttype    = {arXiv},
  eprint       = {1305.5823},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1305-5823.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BorradaileH13,
  author       = {Glencora Borradaile and
                  Anna Harutyunyan},
  title        = {Boundary-to-boundary flows in planar graphs},
  journal      = {CoRR},
  volume       = {abs/1306.5391},
  year         = {2013},
  url          = {http://arxiv.org/abs/1306.5391},
  eprinttype    = {arXiv},
  eprint       = {1306.5391},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BorradaileH13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dagstuhl-reports/BorradaileKMM13,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  D{\'{a}}niel Marx and
                  Claire Mathieu},
  title        = {Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar
                  13421)},
  journal      = {Dagstuhl Reports},
  volume       = {3},
  number       = {10},
  pages        = {36--57},
  year         = {2013},
  url          = {https://doi.org/10.4230/DagRep.3.10.36},
  doi          = {10.4230/DAGREP.3.10.36},
  timestamp    = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dagstuhl-reports/BorradaileKMM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/BorradaileHW12,
  author       = {Glencora Borradaile and
                  Brent Heeringa and
                  Gordon T. Wilfong},
  title        = {The knapsack problem with neighbour constraints},
  journal      = {J. Discrete Algorithms},
  volume       = {16},
  pages        = {224--235},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jda.2012.04.011},
  doi          = {10.1016/J.JDA.2012.04.011},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BorradaileHW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cccg/BorradaileE12,
  author       = {Glencora Borradaile and
                  David Eppstein},
  title        = {Near-Linear-Time Deterministic Plane Steiner Spanners and {TSP} Approximation
                  for Well-Spaced Point Sets},
  booktitle    = {Proceedings of the 24th Canadian Conference on Computational Geometry,
                  {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10,
                  2012},
  pages        = {297--302},
  year         = {2012},
  url          = {http://2012.cccg.ca/papers/paper41.pdf},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cccg/BorradaileE12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icml/AzimiFFBH12,
  author       = {Javad Azimi and
                  Alan Fern and
                  Xiaoli Zhang Fern and
                  Glencora Borradaile and
                  Brent Heeringa},
  title        = {Batch Active Learning via Coordinated Matching},
  booktitle    = {Proceedings of the 29th International Conference on Machine Learning,
                  {ICML} 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012},
  publisher    = {icml.cc / Omnipress},
  year         = {2012},
  url          = {http://icml.cc/2012/papers/607.pdf},
  timestamp    = {Wed, 03 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icml/AzimiFFBH12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/swat/BorradailePW12,
  author       = {Glencora Borradaile and
                  Seth Pettie and
                  Christian Wulff{-}Nilsen},
  editor       = {Fedor V. Fomin and
                  Petteri Kaski},
  title        = {Connectivity Oracles for Planar Graphs},
  booktitle    = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
                  Helsinki, Finland, July 4-6, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7357},
  pages        = {316--327},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31155-0\_28},
  doi          = {10.1007/978-3-642-31155-0\_28},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/BorradailePW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/vl/HarutyunyanBCS12,
  author       = {Anna Harutyunyan and
                  Glencora Borradaile and
                  Chris Chambers and
                  Christopher Scaffidi},
  editor       = {Martin Erwig and
                  Gem Stapleton and
                  Gennaro Costagliola},
  title        = {Planted-model evaluation of algorithms for identifying differences
                  between spreadsheets},
  booktitle    = {2012 {IEEE} Symposium on Visual Languages and Human-Centric Computing,
                  {VL/HCC} 2012, Innsbruck, Austria, September 30 - October 4, 2012},
  pages        = {7--14},
  publisher    = {{IEEE}},
  year         = {2012},
  url          = {https://doi.org/10.1109/VLHCC.2012.6344471},
  doi          = {10.1109/VLHCC.2012.6344471},
  timestamp    = {Wed, 16 Oct 2019 14:14:55 +0200},
  biburl       = {https://dblp.org/rec/conf/vl/HarutyunyanBCS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1204-4159,
  author       = {Glencora Borradaile and
                  Seth Pettie and
                  Christian Wulff{-}Nilsen},
  title        = {Connectivity Oracles for Planar Graphs},
  journal      = {CoRR},
  volume       = {abs/1204.4159},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.4159},
  eprinttype    = {arXiv},
  eprint       = {1204.4159},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-4159.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1206-2254,
  author       = {Glencora Borradaile and
                  David Eppstein},
  title        = {Near-Linear-Time Deterministic Plane Steiner Spanners and {TSP} Approximation
                  for Well-Spaced Point Sets},
  journal      = {CoRR},
  volume       = {abs/1206.2254},
  year         = {2012},
  url          = {http://arxiv.org/abs/1206.2254},
  eprinttype    = {arXiv},
  eprint       = {1206.2254},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1206-2254.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1212-2178,
  author       = {Glencora Borradaile and
                  Jennifer Iglesias and
                  Theresa Migler and
                  Antonio Ochoa and
                  Gordon T. Wilfong and
                  Lisa Zhang},
  title        = {Egalitarian Graph Orientations},
  journal      = {CoRR},
  volume       = {abs/1212.2178},
  year         = {2012},
  url          = {http://arxiv.org/abs/1212.2178},
  eprinttype    = {arXiv},
  eprint       = {1212.2178},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1212-2178.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BorradaileKMNW11,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Shay Mozes and
                  Yahav Nussbaum and
                  Christian Wulff{-}Nilsen},
  editor       = {Rafail Ostrovsky},
  title        = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
                  in Near-Linear Time},
  booktitle    = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
                  2011, Palm Springs, CA, USA, October 22-25, 2011},
  pages        = {170--179},
  publisher    = {{IEEE} Computer Society},
  year         = {2011},
  url          = {https://doi.org/10.1109/FOCS.2011.73},
  doi          = {10.1109/FOCS.2011.73},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BorradaileKMNW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BorradaileHW11,
  author       = {Glencora Borradaile and
                  Brent Heeringa and
                  Gordon T. Wilfong},
  editor       = {Costas S. Iliopoulos and
                  William F. Smyth},
  title        = {The 1-Neighbour Knapsack Problem},
  booktitle    = {Combinatorial Algorithms - 22nd International Workshop, {IWOCA} 2011,
                  Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7056},
  pages        = {71--84},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-25011-8\_6},
  doi          = {10.1007/978-3-642-25011-8\_6},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BorradaileHW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1105-2228,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Shay Mozes and
                  Yahav Nussbaum and
                  Christian Wulff{-}Nilsen},
  title        = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
                  in Near-Linear Time},
  journal      = {CoRR},
  volume       = {abs/1105.2228},
  year         = {2011},
  url          = {http://arxiv.org/abs/1105.2228},
  eprinttype    = {arXiv},
  eprint       = {1105.2228},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1105-2228.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/comgeo/BorradaileLS10,
  author       = {Glencora Borradaile and
                  James R. Lee and
                  Anastasios Sidiropoulos},
  title        = {Randomly removing g handles at once},
  journal      = {Comput. Geom.},
  volume       = {43},
  number       = {8},
  pages        = {655--662},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.comgeo.2010.04.007},
  doi          = {10.1016/J.COMGEO.2010.04.007},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/BorradaileLS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BorradaileSW10,
  author       = {Glencora Borradaile and
                  Piotr Sankowski and
                  Christian Wulff{-}Nilsen},
  title        = {Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing
                  Time},
  booktitle    = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  pages        = {601--610},
  publisher    = {{IEEE} Computer Society},
  year         = {2010},
  url          = {https://doi.org/10.1109/FOCS.2010.63},
  doi          = {10.1109/FOCS.2010.63},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BorradaileSW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1003-1320,
  author       = {Glencora Borradaile and
                  Piotr Sankowski and
                  Christian Wulff{-}Nilsen},
  title        = {Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing
                  Time},
  journal      = {CoRR},
  volume       = {abs/1003.1320},
  year         = {2010},
  url          = {http://arxiv.org/abs/1003.1320},
  eprinttype    = {arXiv},
  eprint       = {1003.1320},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1003-1320.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1003-1426,
  author       = {Glencora Borradaile and
                  James R. Lee and
                  Anastasios Sidiropoulos},
  title        = {Randomly removing g handles at once},
  journal      = {CoRR},
  volume       = {abs/1003.1426},
  year         = {2010},
  url          = {http://arxiv.org/abs/1003.1426},
  eprinttype    = {arXiv},
  eprint       = {1003.1426},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1003-1426.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1008-4966,
  author       = {Glencora Borradaile and
                  Christian Wulff{-}Nilsen},
  title        = {Multiple source, single sink maximum flow in a planar graph},
  journal      = {CoRR},
  volume       = {abs/1008.4966},
  year         = {2010},
  url          = {http://arxiv.org/abs/1008.4966},
  eprinttype    = {arXiv},
  eprint       = {1008.4966},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1008-4966.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BorradaileK09,
  author       = {Glencora Borradaile and
                  Philip N. Klein},
  title        = {An \emph{O}(\emph{n} log \emph{n}) algorithm for maximum \emph{st}-flow
                  in a directed planar graph},
  journal      = {J. {ACM}},
  volume       = {56},
  number       = {2},
  pages        = {9:1--9:30},
  year         = {2009},
  url          = {https://doi.org/10.1145/1502793.1502798},
  doi          = {10.1145/1502793.1502798},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BorradaileK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/BorradaileKM09,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Claire Mathieu},
  title        = {An \emph{O}(\emph{n} log \emph{n}) approximation scheme for Steiner
                  tree in planar graphs},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {5},
  number       = {3},
  pages        = {31:1--31:31},
  year         = {2009},
  url          = {https://doi.org/10.1145/1541885.1541892},
  doi          = {10.1145/1541885.1541892},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/BorradaileKM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/compgeom/BorradaileLS09,
  author       = {Glencora Borradaile and
                  James R. Lee and
                  Anastasios Sidiropoulos},
  editor       = {John Hershberger and
                  Efi Fogel},
  title        = {Randomly removing g handles at once},
  booktitle    = {Proceedings of the 25th {ACM} Symposium on Computational Geometry,
                  Aarhus, Denmark, June 8-10, 2009},
  pages        = {371--376},
  publisher    = {{ACM}},
  year         = {2009},
  url          = {https://doi.org/10.1145/1542362.1542425},
  doi          = {10.1145/1542362.1542425},
  timestamp    = {Mon, 14 Jun 2021 16:24:56 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/BorradaileLS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/BorradaileDT09,
  author       = {Glencora Borradaile and
                  Erik D. Demaine and
                  Siamak Tazari},
  editor       = {Susanne Albers and
                  Jean{-}Yves Marion},
  title        = {Polynomial-Time Approximation Schemes for Subset-Connectivity Problems
                  in Bounded-Genus Graphs},
  booktitle    = {26th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
  series       = {LIPIcs},
  volume       = {3},
  pages        = {171--182},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year         = {2009},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2009.1835},
  doi          = {10.4230/LIPICS.STACS.2009.1835},
  timestamp    = {Tue, 22 Jun 2021 15:43:57 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BorradaileDT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0902-1043,
  author       = {Glencora Borradaile and
                  Erik D. Demaine and
                  Siamak Tazari},
  title        = {Polynomial-Time Approximation Schemes for Subset-Connectivity Problems
                  in Bounded-Genus Graphs},
  journal      = {CoRR},
  volume       = {abs/0902.1043},
  year         = {2009},
  url          = {http://arxiv.org/abs/0902.1043},
  eprinttype    = {arXiv},
  eprint       = {0902.1043},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0902-1043.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0910-0777,
  author       = {Glencora Borradaile and
                  Brent Heeringa and
                  Gordon T. Wilfong},
  title        = {Approximation Algorithms for Constrained Knapsack Problems},
  journal      = {CoRR},
  volume       = {abs/0910.0777},
  year         = {2009},
  url          = {http://arxiv.org/abs/0910.0777},
  eprinttype    = {arXiv},
  eprint       = {0910.0777},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0910-0777.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/us/Borradaile08,
  author       = {Glencora Borradaile},
  title        = {Exploiting Planarity for Network Flow and Connectivity Problems},
  school       = {Brown University, {USA}},
  year         = {2008},
  url          = {https://cs.brown.edu/research/pubs/theses/phd/2008/glencora.pdf},
  timestamp    = {Tue, 28 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/us/Borradaile08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BorradaileKM08,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Claire Mathieu},
  title        = {A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest},
  booktitle    = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  pages        = {115--124},
  publisher    = {{IEEE} Computer Society},
  year         = {2008},
  url          = {https://doi.org/10.1109/FOCS.2008.59},
  doi          = {10.1109/FOCS.2008.59},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BorradaileKM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/BorradaileK08,
  author       = {Glencora Borradaile and
                  Philip N. Klein},
  editor       = {Luca Aceto and
                  Ivan Damg{\aa}rd and
                  Leslie Ann Goldberg and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Anna Ing{\'{o}}lfsd{\'{o}}ttir and
                  Igor Walukiewicz},
  title        = {The Two-Edge Connectivity Survivable Network Problem in Planar Graphs},
  booktitle    = {Automata, Languages and Programming, 35th International Colloquium,
                  {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
                  {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  series       = {Lecture Notes in Computer Science},
  volume       = {5125},
  pages        = {485--501},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-70575-8\_40},
  doi          = {10.1007/978-3-540-70575-8\_40},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/BorradaileK08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:reference/algo/Borradaile08,
  author       = {Glencora Borradaile},
  editor       = {Ming{-}Yang Kao},
  title        = {Planarity Testing},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_295},
  doi          = {10.1007/978-0-387-30162-4\_295},
  timestamp    = {Thu, 27 Jun 2019 16:25:31 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Borradaile08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BorradaileKK07,
  author       = {Glencora Borradaile and
                  Claire Kenyon{-}Mathieu and
                  Philip N. Klein},
  editor       = {Nikhil Bansal and
                  Kirk Pruhs and
                  Clifford Stein},
  title        = {A polynomial-time approximation scheme for Steiner tree in planar
                  graphs},
  booktitle    = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
                  2007},
  pages        = {1285--1294},
  publisher    = {{SIAM}},
  year         = {2007},
  url          = {http://dl.acm.org/citation.cfm?id=1283383.1283521},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BorradaileKK07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wads/BorradaileKM07,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Claire Mathieu},
  editor       = {Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Norbert Zeh},
  title        = {Steiner Tree in Planar Graphs: An \emph{O} {(} \emph{n} log \emph{n}
                  {)} Approximation Scheme with Singly-Exponential Dependence on Epsilon},
  booktitle    = {Algorithms and Data Structures, 10th International Workshop, {WADS}
                  2007, Halifax, Canada, August 15-17, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4619},
  pages        = {275--286},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-73951-7\_25},
  doi          = {10.1007/978-3-540-73951-7\_25},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BorradaileKM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BorradaileK06,
  author       = {Glencora Borradaile and
                  Philip N. Klein},
  title        = {An \emph{O (n log n)} algorithm for maximum \emph{st}-flow in a directed
                  planar graph},
  booktitle    = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages        = {524--533},
  publisher    = {{ACM} Press},
  year         = {2006},
  url          = {http://dl.acm.org/citation.cfm?id=1109557.1109615},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BorradaileK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/BorradaileH05,
  author       = {Glencora Borradaile and
                  Pascal Van Hentenryck},
  title        = {Safe and tight linear estimators for global optimization},
  journal      = {Math. Program.},
  volume       = {102},
  number       = {3},
  pages        = {495--517},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10107-004-0533-8},
  doi          = {10.1007/S10107-004-0533-8},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BorradaileH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

a service of

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.