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

Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh. Hardness of r-dominating set on Graphs of Diameter (r + 1). In Gregory Gutin, Stefan Szeider, editors, Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. Volume 8246 of Lecture Notes in Computer Science, pages 255-267, Springer, 2013. [doi]

Abstract

Abstract is missing.