On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno. On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. In Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam, editors, Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings. Volume 8283 of Lecture Notes in Computer Science, pages 339-349, Springer, 2013. [doi]

@inproceedings{KanteLMNU13,
  title = {On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs},
  author = {Mamadou Moustapha Kanté and Vincent Limouzy and Arnaud Mary and Lhouari Nourine and Takeaki Uno},
  year = {2013},
  doi = {10.1007/978-3-642-45030-3_32},
  url = {http://dx.doi.org/10.1007/978-3-642-45030-3_32},
  researchr = {https://researchr.org/publication/KanteLMNU13},
  cites = {0},
  citedby = {0},
  pages = {339-349},
  booktitle = {Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings},
  editor = {Leizhen Cai and Siu-Wing Cheng and Tak Wah Lam},
  volume = {8283},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-45029-7},
}