Philip Klein

Philip Klein

Brown University

H-index: 52

North America-United States

About Philip Klein

Philip Klein, With an exceptional h-index of 52 and a recent h-index of 27 (since 2020), a distinguished researcher at Brown University, specializes in the field of Algorithms, graphs, approximation algorithms, combinatorial optimization.

His recent articles reflect a diverse array of research interests and contributions to the field:

Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs

A quasipolynomial (2 + ε)-approximation for planar sparsest cut

A Quasipolynomial (2+ ε)-Approximation for Planar Sparsest Cut

New hardness results for planar graph problems in p and an algorithm for sparsest cut

Approximation Schemes for Routing Problems in Minor-Free Metrics

On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs

The impact of highly compact algorithmic redistricting on the rural-versus-urban balance

On the computational tractability of a geographic clustering problem arising in redistricting

Philip Klein Information

University

Position

Professor of Computer Science

Citations(all)

10779

Citations(since 2020)

2139

Cited By

9737

hIndex(all)

52

hIndex(since 2020)

27

i10Index(all)

99

i10Index(since 2020)

53

Email

University Profile Page

Google Scholar

Philip Klein Skills & Research Interests

Algorithms

graphs

approximation algorithms

combinatorial optimization

Top articles of Philip Klein

Title

Journal

Author(s)

Publication Date

Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs

Algorithmica

Philip N Klein

Claire Mathieu

Hang Zhou

2023/10

A quasipolynomial (2 + ε)-approximation for planar sparsest cut

Vincent Cohen-Addad

Anupam Gupta

Philip N Klein

Jason Li

2021/6/15

A Quasipolynomial (2+ ε)-Approximation for Planar Sparsest Cut

Anupam Gupta

Jason Li

Philip N Klein

Vincent Pierre Cohen-addad

2021

New hardness results for planar graph problems in p and an algorithm for sparsest cut

Amir Abboud

Vincent Cohen-Addad

Philip N Klein

2020/6/22

Approximation Schemes for Routing Problems in Minor-Free Metrics

Arnold Filtser

Hung Le

Philip N Klein

Vincent Pierre Cohen-addad

2020

On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs

Vincent Cohen-Addad

Arnold Filtser

Philip N Klein

Hung Le

2020/11/16

The impact of highly compact algorithmic redistricting on the rural-versus-urban balance

Archer Wheeler

Philip N Klein

2020/11/3

On the computational tractability of a geographic clustering problem arising in redistricting

arXiv preprint arXiv:2009.00188

Vincent Cohen-Addad

Philip N Klein

Dániel Marx

2020/9/1

See List of Professors in Philip Klein University(Brown University)

Co-Authors

academic-engine