Philip Klein

Cited by

	All	Since 2019
Citations	11033	2336
h-index	53	28
i10-index	100	58

560

280

140

420

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202432 39 54 97 103 101 102 155 164 136 136 182 185 271 315 365 403 438 444 458 547 523 421 537 452 399 430 409 548 416 465 380 466 389 220

Public access

View all

15 articles

0 articles

available

not available

Based on funding mandates

Co-authors

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

Philip Klein

Professor of Computer Science, Brown University

Verified email at brown.edu

Algorithms graphs approximation algorithms combinatorial optimization


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
4.3 Two-edge-connected planar subgraph P Klein Algorithms for Optimization Problems in Planar Graphs, 53, 0
A data structure for bicategories, with application to speeding up an approximation algorithm PN Klein Information Processing Letters 52 (6), 303-307, 1994	20	1994
A dynamic-tree product line D Eisenstat, PN Klein
A Fully Dynamic Approximation Scheme for All-Pairs Paths in Planar Graphs PN Klein, S Subramanian LECTURE NOTES IN COMPUTER SCIENCE, 442-442, 1993		1993
A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs PN Klein, S Subramanian Algorithms and Data Structures: Third Workshop, WADS'93 Montréal, Canada …, 1993	34	1993
A fully dynamic approximation scheme for shortest paths in planar graphs PN Klein, S Subramanian Algorithmica 22 (3), 235-249, 1998	74	1998
A linear-processor polylog-time algorithm for shortest paths in planar graphs PN Klein, S Subramanian Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 259-270, 1993	69	1993
A linear-time approximation scheme for planar weighted TSP PN Klein 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 647-656, 2005	84	2005
A linear-time approximation scheme for TSP in planar graphs with edge-weights PN Klein		2006
A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights PN Klein SIAM Journal on Computing 37 (6), 1926-1952, 2008	82	2008
A near-linear time minimum Steiner cut algorithm for planar graphs S Jue, PN Klein arXiv preprint arXiv:1912.11103, 2019	4	2019
A nearly best-possible approximation algorithm for node-weighted Steiner trees P Klein, R Ravi Journal of Algorithms 19 (1), 104-115, 1995	488	1995
A Parallel A lgorithm for A pproxim ating the P Klein, C ord Stein
A parallel algorithm for approximating the minimum cycle cover P Klein, C Stein Algorithmica 9 (1), 23-31, 1993	3	1993
A parallel algorithm for eliminating cycles in undirected graphs P Klein, C Stein Information Processing Letters 34 (6), 307-312, 1990	16	1990
A parallel randomized approximation scheme for shortest paths PN Klein, S Sairam Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992	51	1992
A polynomial-time approximation scheme for Euclidean Steiner forest G Borradaile, PN Klein, C Mathieu 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 115-124, 2008	21	2008
A polynomial-time approximation scheme for Euclidean Steiner forest G Borradaile, PN Klein, C Mathieu ACM Transactions on Algorithms (TALG) 11 (3), 1-20, 2015	29	2015
A polynomial-time approximation scheme for planar multiway cut MH Bateni, MT Hajiaghayi, PN Klein, C Mathieu Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	29	2012
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	164	1998

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors