2026 Philip N. Klein: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	58	3690	3587	1760	1697	155	11063

Research.com Recognitions

2010 - ACM Fellow For contributions to graph algorithms.

Overview

Philip N. Klein is a researcher affiliated with Brown University in the United States whose work primarily resides within the fields of Computer Science and Engineering. The main focus of their research includes Computational Theory and Mathematics, Artificial Intelligence, and Signal Processing, with specific interests in Advanced Graph Theory Research, Complexity and Algorithms in Graphs, and Data Management and Algorithms.

Their recent scholarly contributions include the following papers:

Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs (2023), published in Algorithmica
On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting (2021), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Acoustic Indoor Localization Augmentation by Self-Calibration and Machine Learning (2020), published in Sensors
On the computational tractability of a geographic clustering problem arising in redistricting (2020), published on arXiv (Cornell University)
New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut (2020), published on arXiv (Cornell University)

Frequent co-authors who have collaborated extensively with Philip N. Klein include:

Vincent Cohen-Addad
Dániel Marx
Joan Bordoy
Dominik Jan Schott
Jizhou Xie

Their publications appear notably in venues such as:

arXiv (Cornell University)
Sensors
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Algorithmica
SAE technical papers on CD-ROM/SAE technical paper series

Philip N. Klein's research addresses a range of topics including:

Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Data Management and Algorithms
Indoor and Outdoor Localization Technologies
Speech and Audio Processing
Underwater Vehicles and Communication Systems
Advanced Combinatorial Mathematics

In recognition of contributions to the field of graph algorithms, Philip N. Klein was awarded the title of ACM Fellow in 2010.

Best Publications

Recognition of shapes by editing their shock graphs

T.B. Sebastian;P.N. Klein;B.B. Kimia

979
Citations
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

Ajit Agrawal;Philip Klein;R. Ravi

646
Citations
A randomized linear-time algorithm to find minimum spanning trees

David R. Karger;Philip N. Klein;Robert E. Tarjan

626
Citations
Faster Shortest-Path Algorithms for Planar Graphs

Monika R Henzinger;Philip Klein;Satish Rao;Sairam Subramanian

517
Citations
On aligning curves

T.B. Sebastian;P.N. Klein;B.B. Kimia

510
Citations
A Nearly best-possible approximation algorithm for node-weighted Steiner trees

Philip Klein;R. Ravi

464
Citations
Recognition of Shapes by Editing Shock Graphs

Thomas B. Sebastian;Philip N. Klein;Benjamin B. Kimia;Providence Ri

435
Citations
Computing the Edit-Distance between Unrooted Ordered Trees

Philip N. Klein

373
Citations
Excluded minors, network decomposition, and multicommodity flow

Philip Klein;Serge A. Plotkin;Satish Rao

264
Citations
Finding the closest lattice vector when it's unusually close

Philip Klein

209
Citations
Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

Philip Klein;Serge Plotkin;Clifford Stein;Eva Tardos

207
Citations
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

David R. Karger;Philip Klein;Cliff Stein;Mikkel Thorup

203
Citations
Multiple-source shortest paths in planar graphs

Philip N. Klein

198
Citations
Faster shortest-path algorithms for planar graphs

Philip Klein;Satish Rao;Monika Rauch;Sairam Subramanian

180
Citations
An O(n log n) approximation scheme for Steiner tree in planar graphs

Glencora Borradaile;Philip Klein;Claire Mathieu

178
Citations
A polynomial-time approximation scheme for weighted planar graph TSP

Sanjeev Arora;Michelangelo Grigni;David Karger;Philip Klein

160
Citations
An O(n log n) algorithm for maximum st-flow in a directed planar graph

Glencora Borradaile;Philip Klein

154
Citations
Approximation through multicommodity flow

P. Klein;A. Agrawal;R. Ravi;S. Rao

152
Citations
Shock-Based Indexing into Large Shape Databases

Thomas B. Sebastian;Philip N. Klein;Benjamin B. Kimia

145
Citations
A tree-edit-distance algorithm for comparing simple, closed shapes

Philip Klein;Srikanta Tirthapura;Daniel Sharvit;Ben Kimia

144
Citations
A nearly best-possible approximation algorithm for node-weighted Steiner trees.

Philip N. Klein;R. Ravi

11
Citations

Frequent Co-Authors

R. Ravi Carnegie Mellon University

Benjamin B. Kimia Brown University

Neal E. Young University of California, Riverside

Satish Rao University of California, Berkeley

Clifford Stein Columbia University

Dániel Marx Saarland University

David R. Karger MIT

Robert E. Tarjan Princeton University

Éva Tardos Cornell University

Serge Plotkin Stanford University

External Links

Personal website of Philip N. Klein Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online education options can significantly boost your career in Computer Science. Many students are drawn to the flexibility and affordability of these programs, especially as technology fields continue to evolve rapidly.

For those looking to expand their qualifications beyond a bachelor’s, consider the cheapest mba programs online. These MBAs can complement a technical background with valuable business and management skills. If speed is your priority, online one year masters programs offer a fast track to advanced knowledge, letting you upskill without a long-term time commitment.

If your goal is rapid entry into the workforce, there are online degrees specifically designed to lead to high-paying tech jobs. Specializations like artificial intelligence are especially in demand. Explore the best online masters in artificial intelligence for a competitive edge in this cutting-edge field.

By choosing the right online degree pathway, you can unlock new opportunities and start building a rewarding tech career from anywhere in the world.