Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{eppstein_et_al:LIPIcs:2018:8549, author = {David Eppstein and Denis Kurz}, title = {{KBest Solutions of MSO Problems on TreeDecomposable Graphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {16:116: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/8549}, URN = {urn:nbn:de:0030drops85494}, doi = {10.4230/LIPIcs.IPEC.2017.16}, annote = {Keywords: graph algorithm, kbest, monadic secondorder logic, treewidth} }
Keywords:  graph algorithm, kbest, monadic secondorder logic, treewidth  
Seminar:  12th International Symposium on Parameterized and Exact Computation (IPEC 2017)  
Issue Date:  2018  
Date of publication:  23.02.2018 