Follow
Philip Klein
Philip Klein
Professor of Computer Science, Brown University
Verified email at brown.edu
Title
Cited by
Year
Correlation clustering and two-edge-connected augmentation for planar graphs
PN Klein, C Mathieu, H Zhou
Algorithmica 85 (10), 3024-3057, 2023
12023
A quasipolynomial (2 + ε)-approximation for planar sparsest cut
V Cohen-Addad, A Gupta, PN Klein, J Li
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
62021
A Quasipolynomial (2+ ε)-Approximation for Planar Sparsest Cut
A Gupta, J Li, PN Klein, VP Cohen-addad
2021
On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs
V Cohen-Addad, A Filtser, PN Klein, H Le
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
332020
The impact of highly compact algorithmic redistricting on the rural-versus-urban balance
A Wheeler, PN Klein
Proceedings of the 28th International Conference on Advances in Geographic …, 2020
52020
On the computational tractability of a geographic clustering problem arising in redistricting
V Cohen-Addad, PN Klein, D Marx
arXiv preprint arXiv:2009.00188, 2020
92020
New hardness results for planar graph problems in p and an algorithm for sparsest cut
A Abboud, V Cohen-Addad, PN Klein
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
152020
Approximation Schemes for Routing Problems in Minor-Free Metrics
A Filtser, H Le, PN Klein, VP Cohen-addad
2020
A near-linear time minimum Steiner cut algorithm for planar graphs
S Jue, PN Klein
arXiv preprint arXiv:1912.11103, 2019
42019
System for efficiently carrying out a dynamic program for optimization in a graph
PN Klein
US Patent App. 16/012,328, 2019
12019
A PTAS for bounded-capacity vehicle routing in planar graphs
A Becker, PN Klein, A Schild
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
272019
Embedding planar graphs into low-treewidth graphs with applications to efficient approximation schemes for metric problems
E Fox-Epstein, PN Klein, A Schild
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
262019
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
1592019
Balanced centroidal power diagrams for redistricting
V Cohen-Addad, PN Klein, NE Young
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances …, 2018
382018
Polynomial-time approximation schemes for k-center, k-median, and capacitated vehicle routing in bounded highway dimension
A Becker, PN Klein, D Saulpic
26th Annual European Symposium on Algorithms (ESA 2018), 2018
332018
Balanced power diagrams for redistricting
V Cohen-Addad, PN Klein, NE Young
arXiv preprint arXiv:1710.03358, 2017
132017
Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Graphs with Bounded Highway Dimension
A Becker, PN Klein, D Saulpic
arXiv preprint arXiv:1707.08270, 2017
12017
Polynomial-time approximation schemes for k-center and bounded-capacity vehicle routing in metrics with bounded highway dimension
A Becker, PN Klein, D Saulpic
arXiv preprint arXiv:1707.08270, 2017
82017
Methods and apparatus for identifying subject matter in view data
JL Mundy, B Kimia, PN Klein, K Kang, HC Aras
US Patent 9,576,198, 2017
32017
LIPIcs, Volume 75, SEA'17, Complete Volume}}
CS Iliopoulos, SP Pissis, SJ Puglisi, R Raman, R Baltean-Lugojan, ...
16th International Symposium on Experimental Algorithms (SEA 2017) 75, 9, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20