A Completeness Theory for Polynomial (Turing) Kernelization

Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu. A Completeness Theory for Polynomial (Turing) Kernelization. Algorithmica, 71(3):702-730, 2015. [doi]

@article{HermelinKSWW15,
  title = {A Completeness Theory for Polynomial (Turing) Kernelization},
  author = {Danny Hermelin and Stefan Kratsch and Karolina Soltys and Magnus Wahlström and Xi Wu},
  year = {2015},
  doi = {10.1007/s00453-014-9910-8},
  url = {http://dx.doi.org/10.1007/s00453-014-9910-8},
  researchr = {https://researchr.org/publication/HermelinKSWW15},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {71},
  number = {3},
  pages = {702-730},
}