Hardness of r-dominating set on Graphs of Diameter (r + 1)

Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Ramanujan, M. S.; Saurabh, Saket

doi:10.1007/978-3-319-03898-8_22

by Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh

Reference:

Hardness of r-dominating set on Graphs of Diameter (r + 1)Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket SaurabhParameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pages 255–267, 2013.

Bibtex Entry:

@inproceedings{LokshtanovMPRamanujanS13,
  author    = {Daniel Lokshtanov and
               Neeldhara Misra and
               Geevarghese Philip and
               M. S. Ramanujan and
               Saket Saurabh},
  title     = {Hardness of r-dominating set on Graphs of Diameter (r + 1)},
  booktitle = {Parameterized and Exact Computation - 8th International Symposium,
               {IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
               Selected Papers},
  pages     = {255--267},
  year      = {2013},
  url       = {10.1007/978-3-319-03898-8_22">http://dx.doi.org/10.1007/978-3-319-03898-8_22},
  doi       = {10.1007/978-3-319-03898-8_22},
  timestamp = {Sun, 08 Dec 2013 12:48:36 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/iwpec/LokshtanovMPRS13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}