A faster FPTAS for the subset-sums ratio problem N Melissinos, A Pagourtzis Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 2018 | 12 | 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, 1-28, 2022 | 8 | 2022 |

Parameterized max min feedback vertex set M Lampis, N Melissinos, M Vasilakis arXiv preprint arXiv:2302.09604, 2023 | 5 | 2023 |

On the Complexity of the Upper *r*-Tolerant Edge Cover ProblemA Harutyunyan, MK Ghadikolaei, N Melissinos, J Monnot, A Pagourtzis Topics in Theoretical Computer Science: Third IFIP WG 1.8 International …, 2020 | 5 | 2020 |

Complexity of Finding Maximum Locally Irregular Induced Subgraphs 1 F Fioravantes, N Melissinos, T Triommatis Available at SSRN 4350904, 2022 | 4 | 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 | 4 | 2022 |

Approximation schemes for subset sum ratio problems N Melissinos, A Pagourtzis, T Triommatis International Workshop on Frontiers in Algorithmics, 96-107, 2020 | 4 | 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 | 4* | 2019 |

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 |

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 | 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 |

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 | | 2024 |

Approximating subset sum ratio via partition computations G Alonistiotis, A Antonopoulos, N Melissinos, A Pagourtzis, S Petsalakis, ... Acta Informatica, 1-13, 2024 | | 2024 |

Filling crosswords is very hard L Gourvès, A Harutyunyan, M Lampis, N Melissinos Theoretical Computer Science 982, 114275, 2024 | | 2024 |

Parameterised distance to local irregularity F Fioravantes, N Melissinos, T Triommatis arXiv preprint arXiv:2307.04583, 2023 | | 2023 |

Odd Chromatic Number of Graph Classes R Belmonte, A Harutyunyan, N Köhler, N Melissinos International Workshop on Graph-Theoretic Concepts in Computer Science, 44-58, 2023 | | 2023 |

Contributions to approximation and parameterization in combinatorial optimization N Melissinos Université Paris sciences et lettres, 2022 | | 2022 |

Louis Dublois T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos | | |