@InProceedings{fertin_et_al:LIPIcs.CPM.2016.7,
author = {Fertin, Guillaume and Komusiewicz, Christian},
title = {{Graph Motif Problems Parameterized by Dual}},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
pages = {7:1--7:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-012-5},
ISSN = {1868-8969},
year = {2016},
volume = {54},
editor = {Grossi, Roberto and Lewenstein, Moshe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.7},
URN = {urn:nbn:de:0030-drops-60837},
doi = {10.4230/LIPIcs.CPM.2016.7},
annote = {Keywords: NP-hard problem, subgraph problem, fixed-parameter algorithm, lowerbounds, kernelization}
}