A Faster FPTAS for the Subset-Sums Ratio Problem. - Nikolaos Melissinos; Aris Pagourtzis (COCOON, 2018)

Approximation Schemes for Subset Sum Ratio Problems. - Nikolaos Melissinos; Aris Pagourtzis; Theofilos Triommatis (FAW, 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 (TTCS, 2020)

Approximating Subset Sum Ratio via Subset Sum Computations. - Giannis Alonistiotis; Antonis Antonopoulos; Nikolaos Melissinos; Aris Pagourtzis; Stavros Petsalakis; Manolis Vasilakis (IWOCA, 2022)

Complexity of Finding Maximum Locally Irregular Induced Subgraphs. - Foivos Fioravantes; Nikolaos Melissinos; Theofilos Triommatis (SWAT, 2022)

(In)approximability of maximum minimal FVS. - Louis Dublois; Tesshu Hanaka; Mehdi Khosravian Ghadikolaei; Michael Lampis; Nikolaos Melissinos (J. Comput. Syst. 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)

Approximation schemes for subset-sums ratio problems. - Nikolaos Melissinos; Aris Pagourtzis; Theofilos Triommatis (Theor. Comput. Sci., 2022)

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

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)

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (AAAI, 2024)

Parameterised Distance to Local Irregularity. - Foivos Fioravantes; Nikolaos Melissinos; Theofilos Triommatis (IPEC, 2024)

Filling crosswords is very hard. - Laurent Gourvès; Ararat Harutyunyan; Michael Lampis; Nikolaos Melissinos (Theor. Comput. Sci., 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., 2024)

Approximating subset sum ratio via partition computations. - Giannis Alonistiotis; Antonis Antonopoulos; Nikolaos Melissinos; Aris Pagourtzis; Stavros Petsalakis; Manolis Vasilakis (Acta Informatica, 2024)

Digraph Coloring and Distance to Acyclicity. - Ararat Harutyunyan; Michael Lampis; Nikolaos Melissinos (Theory Comput. Syst., 2024)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size. - Foivos Fioravantes; Harmender Gahlawat; Nikolaos Melissinos (AAAI, 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 (AAAI, 2025)

Solving Multiagent Path Finding on Highly Centralized Networks. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler; Tung Anh Vu (AAAI, 2025)

Satisfactory Budget Division. - Laurent Gourvès; Michael Lampis; Nikolaos Melissinos; Aris Pagourtzis (AAMAS, 2025)

Maximum locally irregular induced subgraphs via minimum irregulators. - Foivos Fioravantes; Nikolaos Melissinos; Theofilos Triommatis (Discret. Appl. Math., 2025)

Parameterized Max Min Feedback Vertex Set. - Michael Lampis; Nikolaos Melissinos; Manolis Vasilakis (SIAM J. Discret. Math., 2025)

Exact Algorithms for Distance to Unique Vertex Cover. - Foivos Fioravantes; Dusan Knop; Nikolaos Melissinos; Michal Opler; Manolis Vasilakis (CoRR, 2025)

Odd chromatic number of graph classes. - Rémy Belmonte; Ararat Harutyunyan; Noleen Köhler; Nikolaos Melissinos (J. Graph Theory, 2025)

Parameterized Critical Node Cut Revisited. - Dusan Knop; Nikolaos Melissinos; Manolis Vasilakis (CoRR, 2025)

Structural Parameters for Steiner Orientation. - Tesshu Hanaka; Michael Lampis; Nikolaos Melissinos; Edouard Nemery; Hirotaka Ono 001; Manolis Vasilakis (CoRR, 2025)

Bandwidth Parameterized by Cluster Vertex Deletion Number. - Tatsuya Gima; Eun Jung Kim 002; Noleen Köhler; Nikolaos Melissinos; Manolis Vasilakis (Algorithmica, 2025)

When Agents Break Down in Multiagent Path Finding. - Foivos Fioravantes; Dusan Knop; Nikolaos Melissinos; Michal Opler (CoRR, 2025)