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="Klein, Philip N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Correlation clustering and two-edge-connected augmentation for planar graphs
Philip N. Klein
,
Claire Mathieu
,
Hang Zhou
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 554-567
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
David Eisenstat
,
Philip N. Klein
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 735-744
Structured recursive separator decompositions for planar graphs in linear time
Philip N. Klein
,
Shay Mozes
,
Christian Sommer
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 505-514
Solving
Planar
k
-
Terminal Cut
in
O(n^{c \sqrt{k}})
time
Philip N. Klein
,
Dániel Marx
Lecture Notes in Computer Science
7391
, 2012, pp. 569-580
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
Ken-ichi Kawarabayashi
,
Philip N. Klein
,
Christian Sommer
Lecture Notes in Computer Science
6755
, 2011, pp. 135-146
Multiple-source single-sink maximum flow in directed planar graphs in
O(\mbox{diameter}\cdot n \log n)
time
Philip N. Klein
,
Shay Mozes
Lecture Notes in Computer Science
6844
, 2011, pp. 571-582
Node-weighted Steiner tree and group Steiner tree in planar graphs
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Philip N. Klein
Lecture Notes in Computer Science
5555
, 2009, pp. 328-340
A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights
Philip N. Klein
SIAM Journal on Computing
37
(6), 2008, pp. 1926-1952
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
A subset spanner for planar graphs, with application to subset TSP
Philip N. Klein
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 749-756
Approximation algorithms for finding low-degree subgraphs
Philip N. Klein
,
Radha Krishnan
,
Balaji Raghavachari
,
R. Ravi
Networks
44
(3), 2004, pp. 203-215
Detecting race conditions in parallel programs that use semaphores
Philip N. Klein
,
Hsue-I Liu
,
Robert H.B. Netzer
Algorithmica
35
(4), 2003, pp. 321-345
Approximation algorithms for
NP
-hard optimization problems
Philip N. Klein
,
Neal E. Young
Algorithms and Theory of Computation Handbook, 1999, pp. 34-1 - 34-19
Space-efficient approximation algorithms for MAXCUT and COLORING semidefinite programs
Philip N. Klein
,
Hsueh-I Lu
Lecture Notes in Computer Science
1533
, 1998, pp. 387-396
Computing the edit-distance between unrooted ordered trees
Philip N. Klein
Lecture Notes in Computer Science
1461
, 1998, pp. 91-102
Approximation algorithms for Steiner and directed multicuts
Philip N. Klein
,
Serge A. Plotkin
,
Satish Rao
,
Éva Tardos
Journal of Algorithms
22
(2), 1997, pp. 241-269
A randomized parallel algorithm for single-source shortest paths
Philip N. Klein
,
Sairam Subramanian
Journal of Algorithms
25
(2), 1997, pp. 205-220
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Richard Cole
,
Philip N. Klein
,
Robert E. Tarjan
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'96 (Padua, Italy, June 24-26, 1996)
, 1996, pp. 243-250
Race-condition detection in parallel computation with semaphores
Philip N. Klein
,
Hsueh-I. Lu
,
Robert H.B. Netzer
Lecture Notes in Computer Science
1136
, 1996, pp. 445-459
A randomized linear-time algorithm to find minimum spanning trees
David R. Karger
,
Philip N. Klein
,
Robert E. Tarjan
Journal of the ACM
42
(2), 1995, pp. 321-328
A linear-work parallel algorithm for finding minimum spanning trees
Richard Cole
,
Philip N. Klein
,
Robert E. Tarjan
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 11-15
A randomized linear-time algorithm for finding minimum spanning trees
Philip N. Klein
,
Robert E. Tarjan
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 9-15
A data structure for bicategories, with application to speeding up an approximation algorithm
Philip N. Klein
Information Processing Letters
52
, 1994, pp. 303-307
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
Ming-Yang Kao
,
Philip N. Klein
Journal of Computer and System Sciences
47
(3), 1993, pp. 459-500
A linear-processor polylog-time algorithm for shortest paths in planar graphs
Philip N. Klein
,
Sairam Subramanian
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 259-270
Seiten 1
2
>