See How Your Research Aligns
Create a free account to analyze your research alignment,
identify potential research gaps, and generate personalized
application documents for this professor.
Create Free Account
Philip Klein
Graph Theory
Combinatorial Optimization
Network Optimization Techniques
About
Philip Klein is a Professor of Computer Science at Brown University, recognized as a leading figure in the field of algorithms, particularly in graph theory and combinatorial optimization. His work focuses on developing efficient techniques to find optimal or near-optimal solutions for complex network problems. He is an ACM Fellow (2010) and has been awarded the NSF Presidential Young Investigator Award. Beyond his research, he is celebrated for his pedagogical contributions, having received the Philip J. Bray Award for Excellence in Teaching and authoring the widely used textbook Coding the Matrix.
Research Performance Summary
1984-2023
Active Research Span
First Recorded Paper
Stacktracking: parallel acceptance of deterministic context-free languages
Year:
1984
Citations:
4
Venue:
Harvard University
Latest Recorded Paper
Correlation clustering and two-edge-connected augmentation for planar graphs
Year:
2023
Citations:
6
Venue:
Algorithmica 85 (10)
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.
Publication Venues and Collaboration
Journal, Conference, and Book Publication Breakdown
Top Coauthors
Klein
Kimia
Ravi
Research Impact by Period
Papers
9
Citations
101
Avg. Citations / Paper
11.2
H-Index
6
Papers
28
Citations
736
Avg. Citations / Paper
26.3
H-Index
12
Papers
24
Citations
808
Avg. Citations / Paper
33.7
H-Index
14
Papers
14
Citations
1026
Avg. Citations / Paper
73.3
H-Index
10
Papers
14
Citations
2912
Avg. Citations / Paper
208
H-Index
12
Papers
23
Citations
3266
Avg. Citations / Paper
142
H-Index
16
Papers
44
Citations
2417
Avg. Citations / Paper
54.9
H-Index
20
Papers
6
Citations
272
Avg. Citations / Paper
45.3
H-Index
4
Papers
1
Citations
4
Avg. Citations / Paper
4
H-Index
1
Contact and Professional Links
Detected Research Keywords
Polynomial Time Approximation
Time Approximation Scheme
Paths Planar Graphs
Directed Planar Graphs
Minimum Spanning Trees
Algorithms Planar Graphs
Node Weighted Steiner
Shortest Paths Planar
Steiner Tree Planar
Tree Planar Graphs