Παρακολούθηση
Nikolaos Melissinos
Nikolaos Melissinos
Άγνωστη συνεργασία
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα dauphine.eu - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
(In) approximability of maximum minimal FVS
L Dublois, T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos
arXiv preprint arXiv:2009.09971, 2020
72020
Extension and its price for the connected vertex cover problem
M Khosravian Ghadikoalei, N Melissinos, J Monnot, A Pagourtzis
International Workshop on Combinatorial Algorithms, 315-326, 2019
5*2019
A faster FPTAS for the subset-sums ratio problem
N Melissinos, A Pagourtzis
International Computing and Combinatorics Conference, 602-614, 2018
52018
Digraph coloring and distance to acyclicity
A Harutyunyan, M Lampis, N Melissinos
arXiv preprint arXiv:2010.06317, 2020
42020
On the Complexity of the Upper r-Tolerant Edge Cover Problem
A Harutyunyan, MK Ghadikolaei, N Melissinos, J Monnot, A Pagourtzis
International Conference on Topics in Theoretical Computer Science, 32-47, 2020
42020
31st International Symposium on Algorithms and Computation (ISAAC 2020)
S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
32020
Complexity of Finding Maximum Locally Irregular Induced Subgraphs
F Fioravantes, N Melissinos, T Triommatis
22021
Approximation schemes for subset-sums ratio problems
N Melissinos, A Pagourtzis, T Triommatis
Theoretical Computer Science 931, 17-30, 2022
12022
Approximating Subset Sum Ratio via Subset Sum Computations
G Alonistiotis, A Antonopoulos, N Melissinos, A Pagourtzis, S Petsalakis, ...
International Workshop on Combinatorial Algorithms, 73-85, 2022
12022
Filling Crosswords is Very Hard
L Gourvès, A Harutyunyan, M Lampis, N Melissinos
arXiv preprint arXiv:2109.11203, 2021
2021
Louis Dublois
T Hanaka, MK Ghadikolaei, M Lampis, N Melissinos
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–11