Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set

Qianping Gu, Navid Imani. Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set. In Alejandro López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Volume 6034 of Lecture Notes in Computer Science, pages 26-37, Springer, 2010. [doi]

@inproceedings{GuI10,
  title = {Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set},
  author = {Qianping Gu and Navid Imani},
  year = {2010},
  doi = {10.1007/978-3-642-12200-2_4},
  url = {http://dx.doi.org/10.1007/978-3-642-12200-2_4},
  researchr = {https://researchr.org/publication/GuI10},
  cites = {0},
  citedby = {0},
  pages = {26-37},
  booktitle = {LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings},
  editor = {Alejandro López-Ortiz},
  volume = {6034},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-12199-9},
}