Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms

Henning Fernau, David Manlove. Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms. In Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider, editors, Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Volume 7 of Texts in Algorithmics, pages 69-84, King s College, London, 2006.

@inproceedings{FernauM06,
  title = {Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms},
  author = {Henning Fernau and David Manlove},
  year = {2006},
  researchr = {https://researchr.org/publication/FernauM06},
  cites = {0},
  citedby = {0},
  pages = {69-84},
  booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK},
  editor = {Hajo Broersma and Stefan S. Dantchev and Matthew Johnson 0002 and Stefan Szeider},
  volume = {7},
  series = {Texts in Algorithmics},
  publisher = {King s College, London},
  isbn = {1-904987-38-9},
}