1. Linear time algorithms for finding a dominating set of fixed size in degenerated graphs;Alon;Algorithmica,2009
2. On interval number in cycle convexity;Araujo;Discrete Math. Theor. Comput. Sci.,2018
3. The convexity of induced paths of order three and applications: Complexity aspects;Araújo;Discrete Appl. Math.,2018
4. Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,2002
5. Complexity results for k-domination and a-domination problems and their variants;Bakhshesh;Ars Combin.,2019