LAMSADE
Melissinos Nikolaos
Phd Student
Publications
Articles
Gourvès L., Harutyunyan A., Lampis M., Melissinos N. (2024), Filling crosswords is very hard, Theoretical Computer Science, vol. 982, p. 114275 
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
Communications avec actes
Gima T., Kim E., Khöler N., Melissinos N., Vasilakis M. (2023), Bandwidth Parameterized by Cluster Vertex Deletion Number, in Neeldhara Misra ; Magnus Wahlström, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 21:1-21:15 p.
Belmonte R., Harutyunyan A., Kohler N., Melissinos N. (2023), Odd Chromatic Number of Graph Classes, in Daniël Paulusma ; Bernard Ries, Graph-Theoretic Concepts in Computer Science, Springer Nature Switzerland, 44-58 p.
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.
Harutyunyan A., Lampis M., Melissinos N. (2021), Digraph Coloring and Distance to Acyclicity, in Markus Bläser, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 41:1-41:15 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.
Communications sans actes
Fioravantes F., Melissinos N., Triommatis T. (2022), Complexity of Finding Maximum Locally Irregular Induced Subgraphs, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), Torshavn, FÉroÉ, Îles