Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem

Christophe Paul, Anthony Perez, Stéphan Thomassé. Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. In Filip Murlak, Piotr Sankowski, editors, Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. Volume 6907 of Lecture Notes in Computer Science, pages 497-507, Springer, 2011. [doi]

@inproceedings{PaulPT11,
  title = {Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem},
  author = {Christophe Paul and Anthony Perez and Stéphan Thomassé},
  year = {2011},
  doi = {10.1007/978-3-642-22993-0_45},
  url = {http://dx.doi.org/10.1007/978-3-642-22993-0_45},
  researchr = {https://researchr.org/publication/PaulPT11},
  cites = {0},
  citedby = {0},
  pages = {497-507},
  booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
  editor = {Filip Murlak and Piotr Sankowski},
  volume = {6907},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-22992-3},
}