Book Chapter

Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon

Glencora Borradaile, Philip N. Klein and Claire Mathieu

Lecture Notes in Computer Science, 2007, Volume 4619, Algorithms and Data Structures, Pages 275-286

• Download PDF (511.2 KB)

Book Chapter

Maximum Flow in Directed Planar Graphs with Vertex Capacities

Haim Kaplan and Yahav Nussbaum

Lecture Notes in Computer Science, 2009, Volume 5757, Algorithms - ESA 2009, Pages 397-407

• Download PDF (228.1 KB)

Book Chapter

Improved parallel depth-first search in undirected planar graphs

Ming-Yang Kao, Shang-Hua Teng and Kentaro Toyama

Lecture Notes in Computer Science, 1993, Volume 709, Algorithms and Data Structures, Pages 409-420

• Download PDF (642.3 KB)

Book Chapter

Colourings of Maps

Graduate Texts in Mathematics, 1, Volume 244, Graph Theory, Pages 391-411

• Download PDF (282.0 KB)

Book Chapter

The Induced Disjoint Paths Problem

Ken-ichi Kawarabayashi and Yusuke Kobayashi

Lecture Notes in Computer Science, 2008, Volume 5035, Integer Programming and Combinatorial Optimization, Pages 47-61

• Download PDF (250.6 KB)

Book Chapter

On Shortest Disjoint Paths in Planar Graphs

Yusuke Kobayashi and Christian Sommer

Lecture Notes in Computer Science, 2009, Volume 5878, Algorithms and Computation, Pages 293-302

• Download PDF (205.2 KB)

Book Chapter

Formalization of planar graphs

Mitsuharu Yamamoto, Shin-ya Nishizaki, Masami Hagiya and Yozo Toda

Lecture Notes in Computer Science, 1995, Volume 971, Higher Order Logic Theorem Proving and Its Applications, Pages 369-384

• Download PDF (861.9 KB)

Book Chapter

Edge-disjoint (s, t)-paths in undirected planar graphs in linear time

Karsten Weihe

Lecture Notes in Computer Science, 1994, Volume 855, Algorithms — ESA '94, Pages 130-140

• Download PDF (568.0 KB)