Sledovat
Philip Klein
Philip Klein
Professor of Computer Science, Brown University
E-mailová adresa ověřena na: brown.edu
Název
Citace
Citace
Rok
Recognition of shapes by editing their shock graphs
TB Sebastian, PN Klein, BB Kimia
IEEE Transactions on pattern analysis and machine intelligence 26 (5), 550-571, 2004
9722004
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
A Agrawal, P Klein, R Ravi
Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991
6411991
A randomized linear-time algorithm to find minimum spanning trees
DR Karger, PN Klein, RE Tarjan
Journal of the ACM (JACM) 42 (2), 321-328, 1995
6221995
Faster shortest-path algorithms for planar graphs
MR Henzinger, P Klein, S Rao, S Subramanian
journal of computer and system sciences 55 (1), 3-23, 1997
5231997
On aligning curves
TB Sebastian, PN Klein, BB Kimia
IEEE transactions on pattern analysis and machine intelligence 25 (1), 116-125, 2003
5042003
A nearly best-possible approximation algorithm for node-weighted Steiner trees
P Klein, R Ravi
Journal of Algorithms 19 (1), 104-115, 1995
4801995
Recognition of shapes by editing shock graphs.
TB Sebastian, PN Klein, BB Kimia
ICCV 1, 755-762, 2001
4372001
Computing the edit-distance between unrooted ordered trees
PN Klein
European Symposium on Algorithms, 91-102, 1998
3751998
Excluded minors, network decomposition, and multicommodity flow
P Klein, SA Plotkin, S Rao
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
2721993
Finding the closest lattice vector when it's unusually close
P Klein
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000
2642000
Multiple-source shortest paths in planar graphs
PN Klein
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
2172005
Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
P Klein, S Plotkin, C Stein, E Tardos
SIAM Journal on Computing 23 (3), 466-487, 1994
2101994
Rounding algorithms for a geometric embedding of minimum multiway cut
DR Karger, P Klein, C Stein, M Thorup, NE Young
Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999
2061999
Faster shortest-path algorithms for planar graphs
P Klein, S Rao, M Rauch, S Subramanian
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
1871994
An O(n log n) approximation scheme for Steiner tree in planar graphs
G Borradaile, P Klein, C Mathieu
ACM Transactions on Algorithms (TALG) 5 (3), 1-31, 2009
1782009
An O(n log n) algorithm for maximum st-flow in a directed planar graph
G Borradaile, P Klein
Journal of the ACM (JACM) 56 (2), 1-30, 2009
1632009
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP.
S Arora, M Grigni, DR Karger, PN Klein, A Woloszyn
SODA 98, 33-41, 1998
1621998
Approximation through multicommodity flow
P Klein, A Agrawal, R Ravi, S Rao
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
1561990
Local Search Yields Approximation Schemes for -Means and -Median in Euclidean and Minor-Free Metrics
V Cohen-Addad, PN Klein, C Mathieu
SIAM Journal on Computing 48 (2), 644-667, 2019
1512019
Shock-based indexing into large shape databases
TB Sebastian, PN Klein, BB Kimia
Computer Vision—ECCV 2002: 7th European Conference on Computer Vision …, 2002
1412002
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20