Exploring Subexponential Parameterized Complexity of Completion Problems. Grønås Drange, P., Fomin, F. V., Pilipczuk, M., & Villanger, Y. In Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS), pages 288-299, 2014. Paper bibtex @inproceedings{ dblp2161141,
title = {Exploring Subexponential Parameterized Complexity of Completion Problems},
author = {Pål Grønås Drange and Fedor V. Fomin and Michal Pilipczuk and Yngve Villanger},
author_short = {Grønås Drange, P. and Fomin, F. V. and Pilipczuk, M. and Villanger, Y.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2014},
key = {dblp2161141},
id = {dblp2161141},
biburl = {http://www.dblp.org/rec/bibtex/conf/stacs/DrangeFPV14},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2014.288},
conference = {STACS},
pages = {288-299},
text = {STACS 2014:288-299},
booktitle = {Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS)}
}
Downloads: 0
{"_id":"454stWTrSYJnokDu7","bibbaseid":"grnsdrange-fomin-pilipczuk-villanger-exploringsubexponentialparameterizedcomplexityofcompletionproblems-2014","downloads":0,"creationDate":"2015-06-23T17:42:39.342Z","title":"Exploring Subexponential Parameterized Complexity of Completion Problems","author_short":["Grønås Drange, P.","Fomin, F. V.","Pilipczuk, M.","Villanger, Y."],"year":2014,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/stacs/DrangeFPV14","bibdata":{"title":"Exploring Subexponential Parameterized Complexity of Completion Problems","author":["Pål Grønås Drange","Fedor V. Fomin","Michal Pilipczuk","Yngve Villanger"],"author_short":["Grønås Drange, P.","Fomin, F. V.","Pilipczuk, M.","Villanger, Y."],"bibtype":"inproceedings","type":"inproceedings","year":"2014","key":"dblp2161141","id":"dblp2161141","biburl":"http://www.dblp.org/rec/bibtex/conf/stacs/DrangeFPV14","url":"http://dx.doi.org/10.4230/LIPIcs.STACS.2014.288","conference":"STACS","pages":"288-299","text":"STACS 2014:288-299","booktitle":"Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS)","bibtex":"@inproceedings{ dblp2161141,\n title = {Exploring Subexponential Parameterized Complexity of Completion Problems},\n author = {Pål Grønås Drange and Fedor V. Fomin and Michal Pilipczuk and Yngve Villanger},\n author_short = {Grønås Drange, P. and Fomin, F. V. and Pilipczuk, M. and Villanger, Y.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2014},\n key = {dblp2161141},\n id = {dblp2161141},\n biburl = {http://www.dblp.org/rec/bibtex/conf/stacs/DrangeFPV14},\n url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2014.288},\n conference = {STACS},\n pages = {288-299},\n text = {STACS 2014:288-299},\n booktitle = {Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS)}\n}","bibbaseid":"grnsdrange-fomin-pilipczuk-villanger-exploringsubexponentialparameterizedcomplexityofcompletionproblems-2014","role":"author","urls":{"Paper":"http://dx.doi.org/10.4230/LIPIcs.STACS.2014.288"},"downloads":0},"search_terms":["exploring","subexponential","parameterized","complexity","completion","problems","grønås drange","fomin","pilipczuk","villanger"],"keywords":[],"authorIDs":[],"dataSources":["b3byX4PihoY44SMyY"]}