]
"On the approximation of Min Split-coloring and Min Cocoloring.",
J. Graph Algorithms Appl., vol. 10, no. 2, pp. 297–315, 2006.
"Efficient recognition of equimatchable graphs",
Information Processing Letters, vol. 114, no. 1: Elsevier, pp. 66–71, 2014.
"Hardness and approximation of minimum maximal matchings",
International Journal of Computer Mathematics, no. ahead-of-print: Taylor & Francis, pp. 1–20, 2013.
"On the minimum and maximum selective graph coloring problems in some graph classes",
Discrete Applied Mathematics, vol. 204, pp. 77–89, 2016.
"Minimum maximal matching is NP-hard in regular bipartite graphs",
Theory and Applications of Models of Computation: Springer, pp. 364–374, 2008.
"A note on the NP-hardness of two matching problems in induced subgrids",
Discrete Mathematics and Theoretical Computer Science, vol. 15, no. 2, pp. 233–242, 2013.
"(p, k)-coloring problems in line graphs",
Theoretical computer science, vol. 349, no. 3: Elsevier, pp. 462–474, 2005.
"Partitioning cographs into cliques and stable sets",
Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.
"On some applications of the selective graph coloring problem",
European Journal of Operational Research: North-Holland, 2014.
"A tutorial on the use of graph coloring for some problems in robotics",
European Journal of Operational Research, vol. 192, no. 1: North-Holland, pp. 41–55, 2009.
