( en | de | ru )

 

Disambiguation of "Klein, Philip N."

Author of the publication

copydeleteadd this publication to your clipboard
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.

, , , , and . SIAM J. Comput., 46 (4): 1280-1303 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

n n n

Johannes E M N Klein

n AÊ¿w n

N -L N Nguyen

n-hy n Yi

 

Other publications of authors with the same name

Approximation Algorithms., and . Algorithms and Theory of Computation Handbook, CRC Press, (1999)Recognition of Shapes by Editing Their Shock Graphs., , and . IEEE Trans. Pattern Anal. Mach. Intell., 26 (5): 550-571 (2004)Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time., and . WADS, volume 6844 of Lecture Notes in Computer Science, page 571-582. Springer, (2011)Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract)., , and . ESA, volume 1136 of Lecture Notes in Computer Science, page 445-459. Springer, (1996)A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs., , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 99-111. Springer, (2019)Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs., , , and . SEA, volume 75 of LIPIcs, page 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension., , and . ESA, volume 112 of LIPIcs, page 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Coding the Matrix: Linear Algebra through Applications to Computer Science. Newtonian Press, 1 edition, (Sep 3, 2013)Balanced centroidal power diagrams for redistricting., , and . SIGSPATIAL/GIS, page 389-396. ACM, (2018)A randomized linear-time algorithm for finding minimum spanning trees., and . STOC, page 9-15. ACM, (1994)