Klein, Philip N.

1. On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs
   2020/09/10 by Vincent Cohen-Addad, Arnold Filtser, Cohen-Addad, Vincent +5 · 2 citations
   Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Smart Parking Systems Research
2. Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
   2011/05/11 by Borradaile, Glencora, Klein, Philip N., Mozes, Shay +2 · 1 citation
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
3. Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics
   2016/03/31 by Cohen-Addad, Vincent, Klein, Philip N., Mathieu, Claire · 1 citation
   #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. Balanced power diagrams for redistricting
   2017/10/10 by Cohen-Addad, Vincent, Klein, Philip N., Young, Neal E. · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
5. On the computational tractability of a geographic clustering problem arising in redistricting
   2020/09/01 by Cohen-Addad, Vincent, Klein, Philip N., Marx, Dániel · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences