Philip Klein 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	10999	2311
h 指数	53	27
i10 指数	100	56

560

280

140

420

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202432 39 54 97 103 101 102 155 164 136 136 183 185 271 315 364 403 438 444 458 547 522 420 536 450 399 429 409 545 414 467 380 471 388 191

开放获取的出版物数量

查看全部

15 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

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

关注

Philip Klein

Professor of Computer Science, Brown University

在 brown.edu 的电子邮件经过验证

Algorithms graphs approximation algorithms combinatorial optimization


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	970	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	654	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	630	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	526	1997
On aligning curves TB Sebastian, PN Klein, BB Kimia IEEE transactions on pattern analysis and machine intelligence 25 (1), 116-125, 2003	505	2003
A nearly best-possible approximation algorithm for node-weighted Steiner trees P Klein, R Ravi Journal of Algorithms 19 (1), 104-115, 1995	487	1995
Recognition of shapes by editing shock graphs. TB Sebastian, PN Klein, BB Kimia ICCV 1, 755-762, 2001	441	2001
Computing the edit-distance between unrooted ordered trees PN Klein European Symposium on Algorithms, 91-102, 1998	376	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	279	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	268	2000
Multiple-source shortest paths in planar graphs PN Klein Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005	219	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	205	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	203	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	188	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	178	2009
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	165	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	163	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	158	2019
Approximation through multicommodity flow P Klein, A Agrawal, R Ravi, S Rao Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990	155	1990
Shock-based indexing into large shape databases TB Sebastian, PN Klein, BB Kimia Computer Vision—ECCV 2002: 7th European Conference on Computer Vision …, 2002	141	2002

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用