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.
Exploring Subexponential Parameterized Complexity of Completion Problems [link]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