Radio number for some thorn graphs. - Ruxandra Marinescu-Ghemeci (Discuss. Math. Graph Theory, 2010)

On path partition dimension of trees. - Ruxandra Marinescu-Ghemeci (Ars Comb., 2015)

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)

Extremal Graphs with Respect to the Modified First Zagreb Connection Index. - Guillaume Ducoffe; Ruxandra Marinescu-Ghemeci; Camelia Obreja; Alexandru Popa 001; Rozica Maria Tache (SYNASC, 2018)

On radio connection number of graphs. - Ruxandra Marinescu-Ghemeci (Discuss. Math. Graph Theory, 2019)

On the (di)graphs with (directed) proper connection number two. - Guillaume Ducoffe; Ruxandra Marinescu-Ghemeci; Alexandru Popa 001 (Discret. Appl. Math., 2020)

Algorithms on a Path Covering Problem with Applications in Transportation. - Ruxandra Marinescu-Ghemeci; Alexandru Popa 001; Tiberiu Sîrbu (COCOA (1), 2023)

Towards Understanding News Plagiarism: Theoretical and Experimental Analysis. - Ruxandra Marinescu-Ghemeci; Adrian Miclaus; Ionut Muraretu; Alexandru Popa 001 (AAIM (2), 2024)

Approximate and exact results for the harmonious chromatic number. - Ruxandra Marinescu-Ghemeci; Camelia Obreja; Alexandru Popa 001 (Discuss. Math. Graph Theory, 2024)