Nikolaos Melissinos
Nikolaos Melissinos
Unknown affiliation
Verified email at - Homepage
Cited by
Cited by
(In) approximability of maximum minimal FVS
L Dublois, T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos
Journal of Computer and System Sciences 124, 26-40, 2022
A faster FPTAS for the subset-sums ratio problem
N Melissinos, A Pagourtzis
Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 2018
Digraph coloring and distance to acyclicity
A Harutyunyan, M Lampis, N Melissinos
Theory of Computing Systems, 1-28, 2022
Extension and its price for the connected vertex cover problem
M Khosravian Ghadikoalei, N Melissinos, J Monnot, A Pagourtzis
Combinatorial Algorithms: 30th International Workshop, IWOCA 2019, Pisa …, 2019
On the Complexity of the Upper r-Tolerant Edge Cover Problem
A Harutyunyan, MK Ghadikolaei, N Melissinos, J Monnot, A Pagourtzis
Topics in Theoretical Computer Science: Third IFIP WG 1.8 International …, 2020
Complexity of finding maximum locally irregular induced subgraphs
F Fioravantes, N Melissinos, T Triommatis
Inria; I3S; Université Côte d'Azur, 2021
31st International Symposium on Algorithms and Computation (ISAAC 2020)
S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
Approximation schemes for subset sum ratio problems
N Melissinos, A Pagourtzis, T Triommatis
Frontiers in Algorithmics: 14th International Workshop, FAW 2020, Haikou …, 2020
Approximating subset sum ratio via subset sum computations
G Alonistiotis, A Antonopoulos, N Melissinos, A Pagourtzis, S Petsalakis, ...
Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier …, 2022
Odd Chromatic Number of Graph Classes
R Belmonte, A Harutyunyan, N Köhler, N Melissinos
arXiv preprint arXiv:2303.03225, 2023
Parameterized Max Min Feedback Vertex Set
M Lampis, N Melissinos, M Vasilakis
arXiv preprint arXiv:2302.09604, 2023
Contributions to approximation and parameterization in combinatorial optimization
N Melissinos
Université Paris sciences et lettres, 2022
Filling Crosswords is Very Hard
L Gourvès, A Harutyunyan, M Lampis, N Melissinos
arXiv preprint arXiv:2109.11203, 2021
Louis Dublois
T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos
The system can't perform the operation now. Try again later.
Articles 1–14