BibSLEIGH — Philip_N

Travelled to:

1 × Greece
1 × Iceland
1 × Spain
1 × Switzerland
1 × United Kingdom
2 × Canada
8 × USA

Collaborated with:

S.Mozes C.Sommer R.Ravi A.Agrawal S.Rao C.Stein D.Eisenstat D.Marx G.Borradaile ∅ H.Lu R.E.Tarjan S.Sairam M.Kao K.Fox K.Kawarabayashi E.D.Demaine M.Hajiaghayi S.A.Plotkin É.Tardos M.R.Henzinger S.Subramanian D.R.Karger M.Thorup N.E.Young

Talks about:

planar (10) algorithm (8) graph (8) approxim (7) time (5) linear (4) tree (4) shortest (3) steiner (3) problem (3)

Person: Philip N. Klein

DBLP: Klein:Philip_N=

Contributed to:

2015

2013

2012

2011

2009

2008

2006

1999

1996

1994

1993

1992

1991

1990

Wrote 18 papers:

STOC-2015-FoxKM #approximate #polynomial: A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (KF, PNK, SM), pp. 841–850.
STOC-2013-EisenstatK #algorithm #graph #linear #multi: Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (DE, PNK), pp. 735–744.
STOC-2013-KleinMS #graph #linear #recursion: Structured recursive separator decompositions for planar graphs in linear time (PNK, SM, CS), pp. 505–514.
ICALP-v1-2012-KleinM: Solving Planar k-Terminal Cut in $O(n^(c√k)) Time (PNK, DM), pp. 569–580.
ICALP-v1-2011-KawarabayashiKS #approximate #bound #distance #graph: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (KiK, PNK, CS), pp. 135–146.
ICALP-v1-2009-DemaineHK09a #graph: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (EDD, MH, PNK), pp. 328–340.
ICALP-A-2008-BorradaileK #graph #network #problem: The Two-Edge Connectivity Survivable Network Problem in Planar Graphs (GB, PNK), pp. 485–501.
STOC-2006-Klein #graph #set: A subset spanner for Planar graphs, : with application to subset TSP (PNK), pp. 749–756.
STOC-1999-KargerKSTY #algorithm #geometry #multi: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.
STOC-1996-KleinL #algorithm #approximate #performance #source code: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING (PNK, HIL), pp. 338–347.
STOC-1994-KleinRRS #algorithm #graph #performance: Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.
STOC-1994-KleinT #algorithm #linear #random: A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.
STOC-1993-KleinPR #composition #multi #network: Excluded minors, network decomposition, and multicommodity flow (PNK, SAP, SR), pp. 682–690.
STOC-1992-KleinS #approximate #parallel #random: A Parallel Randomized Approximation Scheme for Shortest Paths (PNK, SS), pp. 750–758.
ICALP-1991-RaviAK #approximate #graph #problem #scheduling: Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion (RR, AA, PNK), pp. 751–762.
STOC-1991-AgrawalKR #algorithm #approximate #network #problem: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (AA, PNK, RR), pp. 134–144.
STOC-1990-KaoK #algorithm #graph #parallel #performance #towards #transitive: Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs (MYK, PNK), pp. 181–192.
STOC-1990-KleinST #algorithm #approximate #concurrent #performance: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities (PNK, CS, ÉT), pp. 310–321.