If you made any changes in Pure these will be visible here soon.

Research Output 2006 2019

  • 192 Citations
  • 7 h-Index
  • 39 Article
  • 24 Conference contribution
  • 1 Chapter
Filter
Chapter
2014

Minimum-cost b-Edge dominating sets on trees

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2014, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Springer Verlag, Vol. 8889. p. 195-207 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8889).

Research output: Chapter in Book/Report/Conference proceedingChapter

Dominating Set
Polynomials
Costs
Polynomial-time Algorithm
Computational complexity