Efficient algorithms for disjoint paths in planar graphs

Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe. Efficient algorithms for disjoint paths in planar graphs. In William J. Cook, László Lovász, Paul D. Seymour, editors, Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93. Volume 20 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 295-354, DIMACS/AMS, 1993.

@inproceedings{Ripphausen-Lipa93-0,
  title = {Efficient algorithms for disjoint paths in planar graphs},
  author = {Heike Ripphausen-Lipa and Dorothea Wagner and Karsten Weihe},
  year = {1993},
  researchr = {https://researchr.org/publication/Ripphausen-Lipa93-0},
  cites = {0},
  citedby = {0},
  pages = {295-354},
  booktitle = {Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93},
  editor = {William J. Cook and László Lovász and Paul D. Seymour},
  volume = {20},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}