Parameterized Complexity of Connected Induced Subgraph Problems

Leizhen Cai, Junjie Ye. Parameterized Complexity of Connected Induced Subgraph Problems. In Qianping Gu, Pavol Hell, Boting Yang, editors, Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings. Volume 8546 of Lecture Notes in Computer Science, pages 219-230, Springer, 2014. [doi]

@inproceedings{CaiY14-0,
  title = {Parameterized Complexity of Connected Induced Subgraph Problems},
  author = {Leizhen Cai and Junjie Ye},
  year = {2014},
  doi = {10.1007/978-3-319-07956-1_20},
  url = {http://dx.doi.org/10.1007/978-3-319-07956-1_20},
  researchr = {https://researchr.org/publication/CaiY14-0},
  cites = {0},
  citedby = {0},
  pages = {219-230},
  booktitle = {Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings},
  editor = {Qianping Gu and Pavol Hell and Boting Yang},
  volume = {8546},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-07955-4},
}