Lars Jaffke, O-joung Kwon, Jan Arne Telle. Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. In Daniel Lokshtanov, Naomi Nishimura, editors, 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria. Volume 89 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{JaffkeKT17,
title = {Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width},
author = {Lars Jaffke and O-joung Kwon and Jan Arne Telle},
year = {2017},
doi = {10.4230/LIPIcs.IPEC.2017.21},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.21},
researchr = {https://researchr.org/publication/JaffkeKT17},
cites = {0},
citedby = {0},
booktitle = {12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria},
editor = {Daniel Lokshtanov and Naomi Nishimura},
volume = {89},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-051-4},
}