The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Glencora Borradaile" ( http://dblp.L3S.de/Authors/Glencora_Borradaile )

  Author page on DBLP  Author page in RDF  Community of Glencora Borradaile in ASPL-2

Publication years (Num. hits)
2005-2010 (18) 2011-2012 (4)
Publication types (Num. hits)
article(11) incollection(1) inproceedings(10)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 5 keywords

Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen Connectivity Oracles for Planar Graphs Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Glencora 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 Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Glencora 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. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong The 1-Neighbour Knapsack Problem. Search on Bibsonomy IWOCA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Glencora Borradaile, Christian Wulff-Nilsen Multiple source, single sink maximum flow in a planar graph Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos Randomly removing g handles at once Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos Randomly removing g handles at once. Search on Bibsonomy Comput. Geom. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Philip N. Klein, Claire Mathieu An O(n log n) approximation scheme for Steiner tree in planar graphs. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF planar graphs, Steiner tree, approximation scheme
1Glencora Borradaile, Philip N. Klein An O(n log n) algorithm for maximum st-flow in a directed planar graph. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF planar graphs, Maximum flow
1Glencora Borradaile, Erik D. Demaine, Siamak Tazari Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong Approximation Algorithms for Constrained Knapsack Problems Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos Randomly removing g handles at once. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bounded genus graphs, probabilistic approximation, embeddings, planar graphs
1Glencora Borradaile, Erik D. Demaine, Siamak Tazari Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile Planarity Testing. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Philip N. Klein The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Philip N. Klein, Claire Mathieu A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein A polynomial-time approximation scheme for Steiner tree in planar graphs. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Philip N. Klein, Claire Mathieu Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Philip N. Klein An O (n log n) algorithm for maximum st-flow in a directed planar graph. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Pascal Van Hentenryck Safe and tight linear estimators for global optimization. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #22 of 22 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.