Philip Klein
Affiliations: | Computer Science | Brown University, Providence, RI |
Area:
Algorithms and TheoryGoogle:
"Philip Klein"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Borradaile G, Klein P. (2016) The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs Acm Transactions On Algorithms. 12: 1-29 |
| Fox K, Klein PN, Mozes S. (2016) A polynomial-time bicriteria approximation scheme for planar bisection Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 841-850 |
| Klein PN, Mathieu C, Zhou H. (2015) Correlation clustering and two-edge-connected augmentation for planar graphs Leibniz International Proceedings in Informatics, Lipics. 30: 554-567 |
| Borradaile G, Klein PN, Mathieu C. (2015) A polynomial-time approximation scheme for Euclidean Steiner forest Acm Transactions On Algorithms. 11 |
| Klein P, Young NE. (2015) On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms Siam Journal On Computing. 44: 1154-1172 |
| Demaine ED, Hajiaghayi M, Klein PN. (2014) Node-weighted steiner tree and group steiner tree in planar graphs Acm Transactions On Algorithms. 10 |
| Eisenstat D, Klein PN, Mathieu C. (2014) Approximating k-center in planar graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 617-627 |
| Klein PN, Marx D. (2014) A subexponential parameterized algorithm for Subset TSP on planar graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1812-1830 |
| Eisenstat D, Klein PN. (2013) Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs Proceedings of the Annual Acm Symposium On Theory of Computing. 735-744 |
| Klein PN, Mozes S, Sommer C. (2013) Structured recursive separator decompositions for planar graphs in linear time Proceedings of the Annual Acm Symposium On Theory of Computing. 505-514 |