Nikolaos Melissinos

Available identifiers

zbMath Open melissinos.nikolaosMaRDI QIDQ1791023

List of research outcomes

Publication	Date of Publication	Type
Filling crosswords is very hard	2024-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q6147538	2024-01-15	Paper
Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}	2024-01-09	Paper
In)approximability of Maximum Minimal FVS	2023-11-14	Paper
Odd Chromatic Number of Graph Classes	2023-03-06	Paper
Approximation schemes for subset-sums ratio problems	2022-09-01	Paper
Approximating subset sum ratio via subset sum computations	2022-08-30	Paper
Extension and its price for the connected vertex cover problem	2022-02-01	Paper
(In)approximability of maximum minimal FVS	2021-11-25	Paper
Approximation schemes for subset sum ratio problems	2021-07-08	Paper
On the complexity of the upper \(r\)-tolerant edge cover problem	2021-03-01	Paper
Extension and its price for the Connected Vertex Cover problem	2020-02-25	Paper
A faster FPTAS for the subset-sums ratio problem	2018-10-04	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Nikolaos Melissinos