Philip Klein

Citat de

	Toate	Din 2020
Referințe bibliografice	11264	2131
h-index	53	27
i10-index	101	54

560

280

140

420

198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202528 32 39 55 101 99 98 103 156 170 132 137 177 186 279 318 380 400 435 448 449 553 518 429 539 448 404 422 399 556 412 468 389 470 388 355 60

Acces public

Afișați-le pe toate

15 articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Benjamin KimiaBrown UniversityAdresă de e-mail confirmată pe brown.edu
R RaviCarnegie Mellon UnviersityAdresă de e-mail confirmată pe andrew.cmu.edu
Satish B RaoAdresă de e-mail confirmată pe berkeley.edu
Glencora BorradaileProfessor of Computer Science, Oregon State UniversityAdresă de e-mail confirmată pe onid.oregonstate.edu
Vincent Cohen-AddadGoogle Research (former CNRS & Sorbonne Université)Adresă de e-mail confirmată pe lip6.fr
Clifford SteinProfessor of IEOR and CS, Columbia UniversityAdresă de e-mail confirmată pe ieor.columbia.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityAdresă de e-mail confirmată pe cs.princeton.edu
Neal E. YoungUniversity of California, RiversideAdresă de e-mail confirmată pe ucr.edu
shay mozesReichman University (formerly IDC Herzliya)Adresă de e-mail confirmată pe runi.ac.il
Eva TardosProfessor of Computer Science, Cornell UniversityAdresă de e-mail confirmată pe cornell.edu
David KargerProfessor of Computer Science, MITAdresă de e-mail confirmată pe mit.edu
Dániel MarxCISPA Helmholtz Center for Information SecurityAdresă de e-mail confirmată pe cispa.saarland
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkAdresă de e-mail confirmată pe cs.umd.edu
Hsueh-I LuDistinguished Professor of Computer Science and Information Engineering, National Taiwan UniversityAdresă de e-mail confirmată pe csie.ntu.edu.tw
John ReifA. Hollis Edens Distinguished Professor, Department of Computer Science, Duke UniversityAdresă de e-mail confirmată pe cs.duke.edu
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Adresă de e-mail confirmată pe ist.ac.at
Richard ColeProfessor of Computer Science, Courant Institute, New York UniversityAdresă de e-mail confirmată pe cs.nyu.edu
Srikanta TirthapuraProfessor of Computer Engineering, Iowa State UniversityAdresă de e-mail confirmată pe iastate.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyAdresă de e-mail confirmată pe mit.edu
Christian SommerApple Inc.Adresă de e-mail confirmată pe apple.com

Urmăriți

Philip Klein

Professor of Computer Science, Brown University

Adresă de e-mail confirmată pe brown.edu

Algorithms graphs approximation algorithms combinatorial optimization


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
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	976	2004
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	665	1991
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	636	1995
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	536	1997
On aligning curves TB Sebastian, PN Klein, BB Kimia IEEE transactions on pattern analysis and machine intelligence 25 (1), 116-125, 2003	508	2003
A nearly best-possible approximation algorithm for node-weighted Steiner trees P Klein, R Ravi Journal of Algorithms 19 (1), 104-115, 1995	499	1995
Recognition of shapes by editing shock graphs. TB Sebastian, PN Klein, BB Kimia ICCV 1, 755-762, 2001	445	2001
Computing the edit-distance between unrooted ordered trees PN Klein European Symposium on Algorithms, 91-102, 1998	384	1998
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	293	1993
Finding the closest lattice vector when it's unusually close P Klein Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000	282	2000
Multiple-source shortest paths in planar graphs PN Klein Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005	225	2005
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	210	1999
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	201	1994
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	190	1994
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	183	2009
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	172	1998
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	168	2019
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	168	2009
Approximation through multicommodity flow P Klein, A Agrawal, R Ravi, S Rao Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	159	1990
Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time G Borradaile, PN Klein, S Mozes, Y Nussbaum, C Wulff-Nilsen SIAM Journal on Computing 46 (4), 1280-1303, 2017	147	2017

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori