%0 Conference Paper %1 conf/iwpec/EppsteinK17 %A Eppstein, David %A Kurz, Denis %B IPEC %D 2017 %E Lokshtanov, Daniel %E Nishimura, Naomi %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 16:1-16:13 %T K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. %U http://dblp.uni-trier.de/db/conf/iwpec/ipec2017.html#EppsteinK17 %V 89 %@ 978-3-95977-051-4

@inproceedings{conf/iwpec/EppsteinK17, added-at = {2018-08-23T00:00:00.000+0200}, author = {Eppstein, David and Kurz, Denis}, biburl = {https://www.bibsonomy.org/bibtex/241eaa54e618cf0afc7151d63666a8585/dblp}, booktitle = {IPEC}, crossref = {conf/iwpec/2017}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, ee = {https://doi.org/10.4230/LIPIcs.IPEC.2017.16}, interhash = {856425eb57e89f504a9491f569235bc7}, intrahash = {41eaa54e618cf0afc7151d63666a8585}, isbn = {978-3-95977-051-4}, keywords = {dblp}, pages = {16:1-16:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:52:46.000+0100}, title = {K-Best Solutions of MSO Problems on Tree-Decomposable Graphs.}, url = {http://dblp.uni-trier.de/db/conf/iwpec/ipec2017.html#EppsteinK17}, volume = 89, year = 2017 }