Go to the corresponding LIPIcs Volume Portal 
Fertin, Guillaume ; Komusiewicz, Christian
pdfformat: 

@InProceedings{fertin_et_al:LIPIcs:2016:6083, author = {Guillaume Fertin and Christian Komusiewicz}, title = {{Graph Motif Problems Parameterized by Dual}}, booktitle = {27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)}, pages = {7:17:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770125}, ISSN = {18688969}, year = {2016}, volume = {54}, editor = {Roberto Grossi and Moshe Lewenstein}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6083}, URN = {urn:nbn:de:0030drops60837}, doi = {10.4230/LIPIcs.CPM.2016.7}, annote = {Keywords: NPhard problem, subgraph problem, fixedparameter algorithm, lowerbounds, kernelization} }
Keywords:  NPhard problem, subgraph problem, fixedparameter algorithm, lowerbounds, kernelization  
Collection:  27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)  
Issue Date:  2016  
Date of publication:  27.06.2016 