| A faster FPTAS for the subset-sums ratio problem N Melissinos, A Pagourtzis Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 2018 | 13 | 2018 |
| (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 | 9 | 2022 |
| Digraph coloring and distance to acyclicity A Harutyunyan, M Lampis, N Melissinos Theory of Computing Systems 68 (4), 986-1013, 2024 | 8 | 2024 |
| Parameterized max min feedback vertex set M Lampis, N Melissinos, M Vasilakis arXiv preprint arXiv:2302.09604, 2023 | 7 | 2023 |
| Approximation schemes for subset-sums ratio problems N Melissinos, A Pagourtzis, T Triommatis Theoretical Computer Science 931, 17-30, 2022 | 5 | 2022 |
| Approximating subset sum ratio via subset sum computations G Alonistiotis, A Antonopoulos, N Melissinos, A Pagourtzis, S Petsalakis, ... International Workshop on Combinatorial Algorithms, 73-85, 2022 | 5 | 2022 |
| Complexity of finding maximum locally irregular induced subgraphs F Fioravantes, N Melissinos, T Triommatis Inria; I3S; Université Côte d'Azur, 2021 | 5 | 2021 |
| 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 | 5 | 2020 |
| Extension and its price for the connected vertex cover problem M Khosravian Ghadikoalei, N Melissinos, J Monnot, A Pagourtzis International Workshop on Combinatorial Algorithms, 315-326, 2019 | 5* | 2019 |
| Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology F Fioravantes, D Knop, JM Křištan, N Melissinos, M Opler Proceedings of the AAAI Conference on Artificial Intelligence 38 (16), 17380 …, 2024 | 3 | 2024 |
| Average-case complexity of a branch-and-bound algorithm for Min Dominating Set T Denat, A Harutyunyan, N Melissinos, VT Paschos Discrete Applied Mathematics 345, 4-8, 2024 | 3 | 2024 |
| 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 | 3 | 2020 |
| Filling crosswords is very hard L Gourvès, A Harutyunyan, M Lampis, N Melissinos Theoretical Computer Science 982, 114275, 2024 | 2 | 2024 |
| Approximating subset sum ratio via partition computations G Alonistiotis, A Antonopoulos, N Melissinos, A Pagourtzis, S Petsalakis, ... Acta Informatica 61 (2), 101-113, 2024 | 1 | 2024 |
| Bandwidth parameterized by cluster vertex deletion number T Gima, EJ Kim, N Köhler, N Melissinos, M Vasilakis arXiv preprint arXiv:2309.17204, 2023 | 1 | 2023 |
| Maximum locally irregular induced subgraphs via minimum irregulators F Fioravantes, N Melissinos, T Triommatis Discrete Applied Mathematics 363, 168-189, 2025 | | 2025 |
| Solving Multiagent Path Finding on Highly Centralized Networks F Fioravantes, D Knop, JM Křišťan, N Melissinos, M Opler, TA Vu arXiv preprint arXiv:2412.09433, 2024 | | 2024 |
| Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures F Fioravantes, D Knop, JM Křišťan, N Melissinos, M Opler arXiv preprint arXiv:2412.08556, 2024 | | 2024 |
| A parameterized point of view on forming small coalitions F Fioravantes, H Gahlawat, N Melissinos | | 2024 |
| Parameterised distance to local irregularity F Fioravantes, N Melissinos, T Triommatis arXiv preprint arXiv:2307.04583, 2023 | | 2023 |
