- Home
- Best Scientists - Computer Science
- Philip N. Klein

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
53
Citations
10,374
145
World Ranking
3218
National Ranking
1666

2010 - ACM Fellow For contributions to graph algorithms.

- Algorithm
- Combinatorics
- Discrete mathematics

His main research concerns Combinatorics, Discrete mathematics, Approximation algorithm, Planar graph and Outerplanar graph. His biological study spans a wide range of topics, including Node and Algorithm, Combinatorial optimization. His work on Planar straight-line graph, Book embedding and Polynomial-time approximation scheme as part of general Discrete mathematics study is frequently linked to k-minimum spanning tree, bridging the gap between disciplines.

His Approximation algorithm research integrates issues from Linear programming and Multi-commodity flow problem. Philip N. Klein focuses mostly in the field of Planar graph, narrowing it down to matters related to 1-planar graph and, in some cases, Treewidth. The various areas that he examines in his Steiner tree problem study include Network planning and design and Performance guarantee.

- Recognition of shapes by editing their shock graphs (666 citations)
- Faster Shortest-Path Algorithms for Planar Graphs (358 citations)
- When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks (355 citations)

Philip N. Klein mainly focuses on Combinatorics, Discrete mathematics, Planar graph, Approximation algorithm and Time complexity. Steiner tree problem, 1-planar graph, Book embedding, Pathwidth and Chordal graph are among the areas of Combinatorics where Philip N. Klein concentrates his study. His studies deal with areas such as Scheme and Bounded function as well as Discrete mathematics.

His Planar graph study also includes

- Outerplanar graph together with Shortest Path Faster Algorithm,
- Algorithm and related Upper and lower bounds, Floyd–Warshall algorithm and Theoretical computer science. His Approximation algorithm research is multidisciplinary, incorporating perspectives in Binary logarithm, Class, Multi-commodity flow problem and Graph. His study in Time complexity is interdisciplinary in nature, drawing from both Vertex, Minimum cut and Constant.

- Combinatorics (64.83%)
- Discrete mathematics (53.79%)
- Planar graph (39.31%)

- Planar graph (39.31%)
- Discrete mathematics (53.79%)
- Combinatorics (64.83%)

Philip N. Klein mainly investigates Planar graph, Discrete mathematics, Combinatorics, Bounded function and Vehicle routing problem. Philip N. Klein interconnects Upper and lower bounds, Algorithm, Optimization problem and Graph in the investigation of issues within Planar graph. His Discrete mathematics study combines topics from a wide range of disciplines, such as Travelling salesman problem and Approximation algorithm.

His Treewidth study in the realm of Combinatorics interacts with subjects such as Redistricting. His Treewidth study combines topics in areas such as Spanner, Shortest path problem and Steiner tree problem. His study explores the link between Bounded function and topics such as Time complexity that cross with problems in Embedding and Vertex.

- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (25 citations)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (19 citations)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (15 citations)

- Algorithm
- Combinatorics
- Discrete mathematics

His scientific interests lie mostly in Combinatorics, Planar graph, Additive error, Embedding and Treewidth. His work blends Combinatorics and Redistricting studies together. Planar graph is a subfield of Discrete mathematics that Philip N. Klein explores.

Discrete mathematics is closely attributed to Flow network in his study. His Additive error research incorporates elements of Time complexity, Vertex, Independent set and Metric. In general Regular polygon, his work in Convex polygon is often linked to Power linking many areas of study.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Recognition of shapes by editing their shock graphs

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

IEEE Transactions on Pattern Analysis and Machine Intelligence **(2004)**

954 Citations

Recognition of shapes by editing their shock graphs

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

IEEE Transactions on Pattern Analysis and Machine Intelligence **(2004)**

954 Citations

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

Ajit Agrawal;Philip Klein;R. Ravi.

SIAM Journal on Computing **(1995)**

626 Citations

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

Ajit Agrawal;Philip Klein;R. Ravi.

SIAM Journal on Computing **(1995)**

626 Citations

A randomized linear-time algorithm to find minimum spanning trees

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

Journal of the ACM **(1995)**

597 Citations

A randomized linear-time algorithm to find minimum spanning trees

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

Journal of the ACM **(1995)**

597 Citations

On aligning curves

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

IEEE Transactions on Pattern Analysis and Machine Intelligence **(2003)**

502 Citations

On aligning curves

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

IEEE Transactions on Pattern Analysis and Machine Intelligence **(2003)**

502 Citations

Faster Shortest-Path Algorithms for Planar Graphs

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

conference on learning theory **(1997)**

490 Citations

Faster Shortest-Path Algorithms for Planar Graphs

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

conference on learning theory **(1997)**

490 Citations

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

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Carnegie Mellon University

Brown University

University of California, Riverside

University of California, Berkeley

Columbia University

Saarland University

MIT

Princeton University

Stanford University

Cornell University

University of Würzburg

Microsoft (United States)

Tianjin University

University of Michigan–Ann Arbor

University of Guelph

Université Paris Cité

Hainan University

Wageningen University & Research

University of Cambridge

University of Rochester

National Institutes of Health

McGill University Health Centre

Carleton University

University of Florence

Ludwig-Maximilians-Universität München

University of Colorado Boulder

Something went wrong. Please try again later.