Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem

Stefan Kratsch. Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012. pages 114-122, SIAM, 2012. [doi]

@inproceedings{Kratsch12-0,
  title = {Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem},
  author = {Stefan Kratsch},
  year = {2012},
  url = {http://portal.acm.org/citation.cfm?id=2095126&CFID=63838676&CFTOKEN=79617016},
  researchr = {https://researchr.org/publication/Kratsch12-0},
  cites = {0},
  citedby = {0},
  pages = {114-122},
  booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012},
  editor = {Yuval Rabani},
  publisher = {SIAM},
}