Nikolaos Melissinos

56 papers A* 5A 2B 7C 2Misc 2Journal 35Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Exact Algorithms for Distance to Unique Vertex Cover. AAAI Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis
2026	J	`jnl`	Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. J. Artif. Intell. Res. Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2026	J	`jnl`	Exact Algorithms for Resource Reallocation Under Budgetary Constraints. CoRR Arun Kumar Das, Sandip Das, Sweta Das, Foivos Fioravantes, Nikolaos Melissinos
2026	J	`jnl`	Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs. CoRR Tesshu Hanaka, Nikolaos Melissinos, Hirotaka Ono
2026	J	`jnl`	Individual Rationality in Constrained Hedonic Games: Additively Separable and Fractional Preferences. CoRR Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos, Simon Schierreich
2025	J	`jnl`	Bandwidth Parameterized by Cluster Vertex Deletion Number. Algorithmica Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
2025	A*	`conf`	Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size. AAAI Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos
2025	J	`jnl`	Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size. CoRR Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos
2025	J	`jnl`	Exact Algorithms for Distance to Unique Vertex Cover. CoRR Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis
2025	A*	`conf`	Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. AAAI Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2025	J	`jnl`	Maximum locally irregular induced subgraphs via minimum irregulators. Discret. Appl. Math. Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis
2025	J	`jnl`	Odd chromatic number of graph classes. J. Graph Theory Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
2025	J	`jnl`	Parameterised distance to local irregularity. Discret. Math. Theor. Comput. Sci. Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis
2025	J	`jnl`	Parameterized Critical Node Cut Revisited. CoRR Dusan Knop, Nikolaos Melissinos, Manolis Vasilakis
2025	J	`jnl`	Parameterized Max Min Feedback Vertex Set. SIAM J. Discret. Math. Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
2025	A	`conf`	Satisfactory Budget Division. AAMAS Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis
2025	J	`jnl`	Satisfactory Budget Division. CoRR Laurent Gourvès, Michael Lampis, Nikolaos Melissinos, Aris Pagourtzis
2025	A*	`conf`	Solving Multiagent Path Finding on Highly Centralized Networks. AAAI Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu
2025	B	`conf`	Structural Parameters for Steiner Orientation. ISAAC Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
2025	J	`jnl`	Structural Parameters for Steiner Orientation. CoRR Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis
2025	J	`jnl`	When Agents Break Down in Multiagent Path Finding. CoRR Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler
2024	J	`jnl`	Approximating subset sum ratio via partition computations. Acta Informatica Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2024	J	`jnl`	Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discret. Appl. Math. Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos
2024	J	`jnl`	Digraph Coloring and Distance to Acyclicity. Theory Comput. Syst. Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2024	A*	`conf`	Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. AAAI Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2024	J	`jnl`	Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. CoRR Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2024	J	`jnl`	Filling crosswords is very hard. Theor. Comput. Sci. Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2024	B	`conf`	Parameterised Distance to Local Irregularity. IPEC Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis
2024	J	`jnl`	Solving Multiagent Path Finding on Highly Centralized Networks. CoRR Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu
2023	B	`conf`	Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
2023	J	`jnl`	Bandwidth Parameterized by Cluster Vertex Deletion Number. CoRR Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
2023	J	`jnl`	Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. CoRR Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2023	B	`conf`	Odd Chromatic Number of Graph Classes. WG Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
2023	J	`jnl`	Odd Chromatic Number of Graph Classes. CoRR Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
2023	J	`jnl`	Parameterised distance to local irregularity. CoRR Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis
2023	B	`conf`	Parameterized Max Min Feedback Vertex Set. MFCS Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
2023	J	`jnl`	Parameterized Max Min Feedback Vertex Set. CoRR Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis
2022	J	`jnl`	(In)approximability of maximum minimal FVS. J. Comput. Syst. Sci. Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2022	C	`conf`	Approximating Subset Sum Ratio via Subset Sum Computations. IWOCA Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2022	J	`jnl`	Approximating Subset Sum Ratio via Subset Sum Computations. CoRR Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis
2022	J	`jnl`	Approximation schemes for subset-sums ratio problems. Theor. Comput. Sci. Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
2022	—	`conf`	Complexity of Finding Maximum Locally Irregular Induced Subgraphs. SWAT Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis
2022	—	`—`	Contributions to approximation and parameterization in combinatorial optimization. (Contributions à l'approximation et à la paramétrisation en optimisation combinatoire). Nikolaos Melissinos
2022	J	`jnl`	Extension and its price for the connected vertex cover problem. Theor. Comput. Sci. Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2021	A	`conf`	Digraph Coloring and Distance to Acyclicity. STACS Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021	B	`conf`	Filling Crosswords Is Very Hard. ISAAC Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2021	J	`jnl`	Filling Crosswords is Very Hard. CoRR Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2020	B	`conf`	(In)approximability of Maximum Minimal FVS. ISAAC Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2020	J	`jnl`	(In)approximability of Maximum Minimal FVS. CoRR Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos
2020	Misc	`conf`	Approximation Schemes for Subset Sum Ratio Problems. FAW Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
2020	J	`jnl`	Approximation Schemes for Subset Sum Ratio Problems. CoRR Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
2020	J	`jnl`	Digraph Coloring and Distance to Acyclicity. CoRR Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
2020	—	`conf`	On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2019	C	`conf`	Extension and Its Price for the Connected Vertex Cover Problem. IWOCA Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2018	Misc	`conf`	A Faster FPTAS for the Subset-Sums Ratio Problem. COCOON Nikolaos Melissinos, Aris Pagourtzis
2018	J	`jnl`	A Faster FPTAS for the Subset-Sums Ratio Problem. CoRR Nikolaos Melissinos, Aris Pagourtzis