Hardness and approximation of minimum maximal matchings. - Marc Demange; Tínaz Ekim; Cerasela Tanasescu (Int. J. Comput. Math., 2014)

About some robustness and complexity properties of G-graphs networks. - Jean-François Culus; Marc Demange; Ruxandra Marinescu-Ghemeci; Cerasela Tanasescu (Discret. Appl. Math., 2015)

On some applications of the selective graph coloring problem. - Marc Demange; Tínaz Ekim; Bernard Ries; Cerasela Tanasescu (Eur. J. Oper. Res., 2015)

A Multi-period Vertex Cover Problem and Application to Fuel Management. - Marc Demange; Cerasela Tanasescu (ICORES, 2016)