Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Borradaile, Glencora"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
Glencora Borradaile
,
Erik D. Demaine
,
Siamak Tazari
Algorithmica
68
(2), 2014, pp. 287-311
Planar induced subgraphs of sparse graphs
Glencora Borradaile
,
David Eppstein
,
Pingan Zhu
Lecture Notes in Computer Science
8871
, 2014, pp. 1-12
Connectivity oracles for planar graphs
Glencora Borradaile
,
Seth Pettie
,
Christian Wulff-Nilsen
Lecture Notes in Computer Science
7357
, 2012, pp. 316-327
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
Glencora Borradaile
,
Erik D. Demaine
,
Siamak Tazari
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 171-182
An
O(n\log n)
algorithm for maximum
st
-flow in a directed planar graph
Glencora Borradaile
,
Philip Klein
Journal of the ACM
56
(2), 2009, pp. 9: 1-30
The two-edge connectivity survivable network problem in planar graphs
Glencora Borradaile
,
Philip Klein
Lecture Notes in Computer Science
5125
, 2008, pp. 485-501
Steiner tree in planar graphs: An
O(n \log n)
approximation scheme with singly-exponential dependence on epsilon
Glencora Borradaile
,
Philip N. Klein
,
Claire Mathieu
Lecture Notes in Computer Science
4619
, 2007, pp. 275-286