1. Efficient edge domination on hole-free graphs in polynomial time;Brandstädt,2010
2. Efficient dominating and edge dominating sets for graphs and hypergraphs;Brandstädt,2012
3. Dominating induced matchings for P7-free graphs in linear time;Brandstädt;Algorithmica,2013
4. Efficient edge domination in regular graphs;Cardoso;Discrete Appl. Math.,2008
5. On the complexity of the dominating induced matching problem in hereditary classes of graphs;Cardoso;Discrete Applied Math.,2011