Nikolaos Melissinos

According to our database, Nikolaos Melissinos authored at least 28 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

When Agents Break Down in Multiagent Path Finding.

Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler

CoRR, August, 2025

Bandwidth Parameterized by Cluster Vertex Deletion Number.

Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis

Algorithmica, August, 2025

Structural Parameters for Steiner Orientation.

Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis

CoRR, July, 2025

Parameterized Critical Node Cut Revisited.

Dusan Knop, Nikolaos Melissinos, Manolis Vasilakis

CoRR, June, 2025

Odd chromatic number of graph classes.

Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos

J. Graph Theory, April, 2025

Exact Algorithms for Distance to Unique Vertex Cover.

Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis

CoRR, February, 2025

Parameterized Max Min Feedback Vertex Set.

Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis

SIAM J. Discret. Math., 2025

Maximum locally irregular induced subgraphs via minimum irregulators.

Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis

Discret. Appl. Math., 2025

Satisfactory Budget Division.

Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Solving Multiagent Path Finding on Highly Centralized Networks.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size.

Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

Digraph Coloring and Distance to Acyclicity.

Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos

Theory Comput. Syst., August, 2024

Approximating subset sum ratio via partition computations.

Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis

Acta Informatica, June, 2024

Average-case complexity of a branch-and-bound algorithm for Min Dominating Set.

Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos

Discret. Appl. Math., March, 2024

Filling crosswords is very hard.

Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos

Theor. Comput. Sci., January, 2024

Parameterised Distance to Local Irregularity.

Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

CoRR, 2023

2022

Contributions to approximation and parameterization in combinatorial optimization. (Contributions à l'approximation et à la paramétrisation en optimisation combinatoire).

Nikolaos Melissinos

PhD thesis, 2022

Approximation schemes for subset-sums ratio problems.

Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis

Theor. Comput. Sci., 2022

Extension and its price for the connected vertex cover problem.

Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis

Theor. Comput. Sci., 2022

(In)approximability of maximum minimal FVS.

Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos

J. Comput. Syst. Sci., 2022

Complexity of Finding Maximum Locally Irregular Induced Subgraphs.

Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Approximating Subset Sum Ratio via Subset Sum Computations.

Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2020

On the Complexity of the Upper r-Tolerant Edge Cover Problem.

Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis

Proceedings of the Topics in Theoretical Computer Science, 2020

Approximation Schemes for Subset Sum Ratio Problems.

Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis

Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

2018

A Faster FPTAS for the Subset-Sums Ratio Problem.

Nikolaos Melissinos, Aris Pagourtzis

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018