Author of the publication

A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.

, and . ESA, volume 726 of Lecture Notes in Computer Science, page 384-395. Springer, (1993)

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.

 

Other publications of authors with the same name

Erratum: Customizable Contraction Hierarchies., , and . SEA, volume 8504 of Lecture Notes in Computer Science, Springer, (2014)Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study., and . WEA, volume 3503 of Lecture Notes in Computer Science, page 606-609. Springer, (2005)Intriguingly Simple and Fast Transit Routing., , , and . SEA, volume 7933 of Lecture Notes in Computer Science, page 43-54. Springer, (2013)Preventing Critical Edges when Designing Transmission Networks., and . e-Energy, page 264-278. ACM, (2020)Fast, Exact and Scalable Dynamic Ridesharing., , and . CoRR, (2020)Industrial Demand-Side Flexibility: A Benchmark Data Set., , , and . e-Energy, page 460-473. ACM, (2019)User-Constrained Multi-Modal Route Planning., , and . ALENEX, page 118-129. SIAM / Omnipress, (2012)Drawing Graphs on Two and Three Lines., , and . GD, volume 2528 of Lecture Notes in Computer Science, page 31-41. Springer, (2002)Integrating public transport into mobiTopp., , , , , , and . ANT/SEIT, volume 109 of Procedia Computer Science, page 855-860. Elsevier, (2017)Approximating Clustering Coefficient and Transitivity, and . J. Graph Algorithms Appl., 9 (2): 265-275 (2005)