pdfformat: 

@InProceedings{jaffke_et_al:LIPIcs:2018:8564, author = {Lars Jaffke and Ojoung Kwon and Jan Arne Telle}, title = {{PolynomialTime Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded MimWidth}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {21:121:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770514}, ISSN = {18688969}, year = {2018}, volume = {89}, editor = {Daniel Lokshtanov and Naomi Nishimura}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8564}, URN = {urn:nbn:de:0030drops85643}, doi = {10.4230/LIPIcs.IPEC.2017.21}, annote = {Keywords: graph width parameters, dynamic programming, graph classes, induced paths, induced topological minors} }
Keywords:  graph width parameters, dynamic programming, graph classes, induced paths, induced topological minors  
Seminar:  12th International Symposium on Parameterized and Exact Computation (IPEC 2017)  
Issue date:  2018  
Date of publication:  2018 