( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximum st-flow in directed planar graphs via shortest paths

, и . CoRR, (2013)

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.

No persons found for author name Borradaile, Glencora
add a person with the name Borradaile, Glencora
 

Другие публикации лиц с тем же именем

Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets., и . CCCG, стр. 297-302. (2012)Connectivity Oracles for Planar Graphs., , и . SWAT, том 7357 из Lecture Notes in Computer Science, стр. 316-327. Springer, (2012)All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs., , , и . SoCG, том 51 из LIPIcs, стр. 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The 1-Neighbour Knapsack Problem., , и . IWOCA, том 7056 из Lecture Notes in Computer Science, стр. 71-84. Springer, (2011)A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest., , и . FOCS, стр. 115-124. IEEE Computer Society, (2008)Maximum st-Flow in Directed Planar Graphs via Shortest Paths., и . IWOCA, том 8288 из Lecture Notes in Computer Science, стр. 423-427. Springer, (2013)Improving robustness of next-hop routing., , , и . J. Comb. Optim., 31 (3): 1206-1220 (2016)Minimum cycle and homology bases of surface-embedded graphs., , , и . J. Comput. Geom., 8 (2): 58-79 (2017)Minimum Cycle and Homology Bases of Surface Embedded Graphs., , , и . SoCG, том 51 из LIPIcs, стр. 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs., , и . ESA, том 9294 из Lecture Notes in Computer Science, стр. 227-238. Springer, (2015)