Melissinos, Nikolaos
48  results:
Search for persons X
?
2

Filling crosswords is very hard:

Gourvès, Laurent ; Harutyunyan, Ararat ; Lampis, Michael.
Theoretical Computer Science.  982 (2024)  - p. 114275 , 2024
 
?
4

Odd Chromatic Number of Graph Classes:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
 
?
5

Approximating Subset Sum Ratio via Subset Sum Computations:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
 
?
8

(In)approximability of maximum minimal FVS:

Dublois, Louis ; Hanaka, Tesshu ; Khosravian Ghadikolaei, Mehdi..
Journal of Computer and System Sciences.  124 (2022)  - p. 26-40 , 2022
 
?
10

Approximation Schemes for Subset Sum Ratio Problems:

, In: Frontiers in Algorithmics; Lecture Notes in Computer Science,
 
?
11

On the Complexity of the Upper r-Tolerant Edge Cover Proble:

, In: Topics in Theoretical Computer Science; Lecture Notes in Computer Science,
 
?
12

Extension and Its Price for the Connected Vertex Cover Prob..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
 
?
13

Bandwidth Parameterized by Cluster Vertex Deletion Number:

Gima, Tatsuya ; Kim, Eun Jung ; Köhler, Noleen..
Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023).  , 2023
 
?
14

Odd Chromatic Number of Graph Classes:

Belmonte, Rémy ; Harutyunyan, Ararat ; Köhler, Noleen.
info:eu-repo/semantics/altIdentifier/arxiv/2303.03225.  , 2023
 
1-15