Kernelization and Sparseness: the Case of Dominating Set

Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sanchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar. Kernelization and Sparseness: the Case of Dominating Set. In Nicolas Ollinger, Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. Volume 47 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

@inproceedings{DrangeDFKLPPRVS16,
  title = {Kernelization and Sparseness: the Case of Dominating Set},
  author = {Pål Grønås Drange and Markus Sortland Dregi and Fedor V. Fomin and Stephan Kreutzer and Daniel Lokshtanov and Marcin Pilipczuk and Michal Pilipczuk and Felix Reidl and Fernando Sanchez Villaamil and Saket Saurabh and Sebastian Siebertz and Somnath Sikdar},
  year = {2016},
  doi = {10.4230/LIPIcs.STACS.2016.31},
  url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2016.31},
  researchr = {https://researchr.org/publication/DrangeDFKLPPRVS16},
  cites = {0},
  citedby = {0},
  booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France},
  editor = {Nicolas Ollinger and Heribert Vollmer},
  volume = {47},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-001-9},
}