Articles with public access mandates - Philip KleinLearn more
Available somewhere: 15
Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
G Borradaile, PN Klein, S Mozes, Y Nussbaum, C Wulff-Nilsen
SIAM Journal on Computing 46 (4), 1280-1303, 2017
Mandates: US National Science Foundation
Structured recursive separator decompositions for planar graphs in linear time
PN Klein, S Mozes, C Sommer
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
Mandates: Swiss National Science Foundation
A subexponential parameterized algorithm for Subset TSP on planar graphs
PN Klein, D Marx
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
Mandates: Hungarian Scientific Research Fund, European Commission
Identifying and bounding ethnic neighborhoods
JR Logan, S Spielman, H Xu, PN Klein
Urban Geography 32 (3), 334-359, 2011
Mandates: US National Institutes of Health
Balanced centroidal power diagrams for redistricting
V Cohen-Addad, PN Klein, NE Young
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances …, 2018
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation
A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
A Becker, PN Klein, D Saulpic
25th Annual European Symposium on Algorithms (ESA 2017), 2017
Mandates: US National Science Foundation
Approximating connectivity domination in weighted bounded-genus graphs
V Cohen-Addad, É Colin de Verdière, PN Klein, C Mathieu, ...
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation, Agence Nationale de la Recherche
Engineering an approximation scheme for traveling salesman in planar graphs
A Becker, E Fox-Epstein, PN Klein, D Meierfrankenfeld
16th International Symposium on Experimental Algorithms (SEA 2017), 2017
Mandates: US National Science Foundation
The two-edge connectivity survivable-network design problem in planar graphs
G Borradaile, P Klein
ACM Transactions on Algorithms (TALG) 12 (3), 1-29, 2016
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
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
Mandates: US National Science Foundation
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
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program