Dublois L., Hanaka T., Khosravian Ghadikolaei M., Lampis M., Melissinos N. (2022), (In)approximability of maximum minimal FVS, Journal of Computer and System Sciences, vol. 124, p. 26-40
Khosravian Ghadikolaei M., Melissinos N., Monnot J., Pagourtzis A. (2022), Extension and its price for the connected vertex cover problem, Theoretical Computer Science, vol. 904, p. 66-80
Alonistiotis G., Antonopoulos A., Melissinos N., Pagourtzis A., Petsalakis S., Vasilakis M. (2022), Approximating Subset Sum Ratio via Subset Sum Computations, in , Berlin Heidelberg, Springer International Publishing, 73–85 p.
Gourvès L., Harutyunyan A., Lampis M., Melissinos N. (2021), Filling Crosswords is Very Hard, in , Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Harutyunyan A., Khosravian Ghadikolaei M., Melissinos N., Monnot J., Pagourtzis A. (2020), On the Complexity of the Upper r-Tolerant Edge Cover Problem, in Luís S. Barbosa, Mohammad Ali Abam, Springer, 32-47 p.
Khosravian Ghadikolaei M., Melissinos N., Monnot J., Pagourtzis A. (2019), Extension and its price for the connected vertex cover problem, in Colbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia, Combinatorial Algorithms 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings, Berlin Heidelberg, Springer, 315-326 p.