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

Foreword., , and . Algorithmica, 26 (1): 1-2 (2000)A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs., and . Combinatorica, 15 (1): 135-150 (1995)Generating Graphs with Predefined k-Core Structure, , , , and . Proceedings of the European Conference of Complex Systems, (October 2007)Communicating Centrality in Policy Network Drawings., , and . IEEE Trans. Vis. Comput. Graph., 9 (2): 241-253 (2003)Dynamic Time-Dependent Route Planning in Road Networks with User Preferences., , , and . CoRR, (2015)Customizable Contraction Hierarchies., , and . ACM Journal of Experimental Algorithmics, 21 (1): 1.5:1-1.5:49 (2016)Book review.. ZOR Methods Model. Oper. Res., 36 (1): 106-109 (1992)α-Vertex separator is NP-hard even for 3-regular graphs., and . Computing, 46 (4): 343-353 (1991)Preventing Critical Edges when Designing Transmission Networks., and . e-Energy, page 264-278. ACM, (2020)Erratum: Customizable Contraction Hierarchies., , and . SEA, volume 8504 of Lecture Notes in Computer Science, Springer, (2014)