A linear time algorithm for the induced disjoint paths problem in planar graphs

Ken-ichi Kawarabayashi, Yusuke Kobayashi. A linear time algorithm for the induced disjoint paths problem in planar graphs. J. Comput. Syst. Sci., 78(2):670-680, 2012. [doi]

@article{KawarabayashiK12-2,
  title = {A linear time algorithm for the induced disjoint paths problem in planar graphs},
  author = {Ken-ichi Kawarabayashi and Yusuke Kobayashi},
  year = {2012},
  doi = {10.1016/j.jcss.2011.10.004},
  url = {http://dx.doi.org/10.1016/j.jcss.2011.10.004},
  researchr = {https://researchr.org/publication/KawarabayashiK12-2},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {78},
  number = {2},
  pages = {670-680},
}