]
"Edge extremal Graphs Under Degree and Matching Number Restrictions",
17th Haifa Workshop on Interdisciplinary Applications of Graphs – CRI, 2017.
"Linear-Time Generation of Random Chordal Graphs",
International Conference on Algorithms and Complexity: Springer, 2017.
"Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded",
Discrete Mathematics, vol. 340, pp. 927 - 934, 2017.
"Recent results on equimatchable graphs",
Combinatorial Potlatch, 2017.
"Equimatchable graphs are C2k+ 1-free for k≥ 4",
Discrete Mathematics, vol. 339, pp. 2964–2969, 2016.
"Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I",
Discrete Applied Mathematics, vol. 215, pp. 47–60, 2016.
"On the minimum and maximum selective graph coloring problems in some graph classes",
Discrete Applied Mathematics, vol. 204, pp. 77–89, 2016.
"Block decomposition approach to compute a minimum geodetic set",
RAIRO-Operations Research, vol. 48, no. 04: EDP Sciences, pp. 497–507, 2014.
"Efficient recognition of equimatchable graphs",
Information Processing Letters, vol. 114, no. 1: Elsevier, pp. 66–71, 2014.
"Polar cographs",
Discrete Applied Mathematics, vol. 171, no. EPFL-ARTICLE-199582: Elsevier Science Bv, pp. 158–158, 2014.
"On some applications of the selective graph coloring problem",
European Journal of Operational Research: North-Holland, 2014.
"Decomposition Algorithms for Solving the Minimum Weight Maximal Matching Problem",
Networks, vol. 62, no. 4, pp. 273–287, 2013.
"Hardness and approximation of minimum maximal matchings",
International Journal of Computer Mathematics, no. ahead-of-print: Taylor & Francis, pp. 1–20, 2013.
"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.
"Perfectness of clustered graphs",
Discrete Optimization, vol. 10, no. 4: Elsevier, pp. 296–303, 2013.
"Polar permutation graphs are polynomial-time recognisable",
European Journal of Combinatorics, vol. 34, no. 3: Academic Press, pp. 576–592, 2013.
"Some Defective Parameters in Graphs",
Graphs and Combinatorics, vol. 29, no. 2: Springer Japan, pp. 213–224, 2013.
"Computing minimum geodetic sets of proper interval graphs",
LATIN 2012: Theoretical Informatics: Springer Berlin Heidelberg, pp. 279–290, 2012.
"Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem",
Optimization Letters, vol. 6(6), pp. 1161-1171, 2012.
"Recognizing line-polar bipartite graphs in time O (n)",
Discrete Applied Mathematics, vol. 158, no. 15: Elsevier, pp. 1593–1598, 2010.
"Split-critical and uniquely split-colorable graphs",
Discrete Mathematics and Theoretical Computer Science, vol. 12, no. 5, pp. 1–24, 2010.
"Partitioning graphs into complete and empty graphs",
Discrete Mathematics, vol. 309, no. 19: Elsevier, pp. 5849–5856, 2009.
"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.
"Construction of balanced sports schedules using partitions into subleagues",
Operations Research Letters, vol. 36, no. 3: North-Holland, pp. 279–282, 2008.
"Minimum maximal matching is NP-hard in regular bipartite graphs",
Theory and Applications of Models of Computation: Springer, pp. 364–374, 2008.
"Polar cographs",
Discrete Applied Mathematics, vol. 156, no. 10: North-Holland, pp. 1652–1660, 2008.
"Polarity of chordal graphs",
Discrete Applied Mathematics, vol. 156, no. 13: Elsevier, pp. 2469–2479, 2008.
"On the approximation of Min Split-coloring and Min Cocoloring.",
J. Graph Algorithms Appl., vol. 10, no. 2, pp. 297–315, 2006.
"Construction of sports schedules with multiple venues",
Discrete Applied Mathematics, vol. 154, no. 1: North-Holland, pp. 47–58, 2006.