Nikolaos Melissinos

Orcid: 0000-0002-0864-9803

According to our database1, Nikolaos Melissinos authored at least 22 papers between 2018 and 2025.

Collaborative distances:

Timeline

2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
7
8
9
1
6
1
3
2
3
2
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Maximum locally irregular induced subgraphs via minimum irregulators.
Discret. Appl. Math., 2025

2024
Digraph Coloring and Distance to Acyclicity.
Theory Comput. Syst., August, 2024

Approximating subset sum ratio via partition computations.
Acta Informatica, June, 2024

Average-case complexity of a branch-and-bound algorithm for Min Dominating Set.
Discret. Appl. Math., March, 2024

Filling crosswords is very hard.
Theor. Comput. Sci., January, 2024

Solving Multiagent Path Finding on Highly Centralized Networks.
CoRR, 2024

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

Parameterised Distance to Local Irregularity.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

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

Odd Chromatic Number of Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Parameterized Max Min Feedback Vertex Set.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Bandwidth Parameterized by Cluster Vertex Deletion Number.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

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

Approximation schemes for subset-sums ratio problems.
Theor. Comput. Sci., 2022

Extension and its price for the connected vertex cover problem.
Theor. Comput. Sci., 2022

(In)approximability of maximum minimal FVS.
J. Comput. Syst. Sci., 2022

Complexity of Finding Maximum Locally Irregular Induced Subgraphs.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Approximating Subset Sum Ratio via Subset Sum Computations.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2020
On the Complexity of the Upper r-Tolerant Edge Cover Problem.
Proceedings of the Topics in Theoretical Computer Science, 2020

Approximation Schemes for Subset Sum Ratio Problems.
Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

2018
A Faster FPTAS for the Subset-Sums Ratio Problem.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018


  Loading...