default search action
Nikolaos Melissinos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Giannis Alonistiotis
, Antonis Antonopoulos
Approximating subset sum ratio via partition computations. Acta Informatica 61(2): 101-113 (2024) - [j6]Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discret. Appl. Math. 345: 4-8 (2024) - [j5]Ararat Harutyunyan, Michael Lampis
Digraph Coloring and Distance to Acyclicity. Theory Comput. Syst. 68(4): 986-1013 (2024) - [j4]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling crosswords is very hard. Theor. Comput. Sci. 982: 114275 (2024) - [c14]Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler:
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. AAAI 2024: 17380-17388 - [c13]Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis:
Parameterised Distance to Local Irregularity. IPEC 2024: 18:1-18:15 - 2023
- [c12]Tatsuya Gima
Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC 2023: 21:1-21:15 - [c11]Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis:
Parameterized Max Min Feedback Vertex Set. MFCS 2023: 62:1-62:15 - [c10]Rémy Belmonte
Odd Chromatic Number of Graph Classes. WG 2023: 44-58 - [i11]Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis:
Parameterized Max Min Feedback Vertex Set. CoRR abs/2302.09604 (2023) - [i10]Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos:
Odd Chromatic Number of Graph Classes. CoRR abs/2303.03225 (2023) - [i9]Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis:
Parameterised distance to local irregularity. CoRR abs/2307.04583 (2023) - [i8]Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. CoRR abs/2309.17204 (2023) - [i7]Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler:
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. CoRR abs/2312.09646 (2023) - 2022
- [b1]Nikolaos Melissinos:
Contributions to approximation and parameterization in combinatorial optimization. (Contributions à l'approximation et à la paramétrisation en optimisation combinatoire). PSL University, Paris, France, 2022 - [j3]Louis Dublois, Tesshu Hanaka
(In)approximability of maximum minimal FVS. J. Comput. Syst. Sci. 124: 26-40 (2022) - [j2]Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos
Extension and its price for the connected vertex cover problem. Theor. Comput. Sci. 904: 66-80 (2022) - [j1]Nikolaos Melissinos
Approximation schemes for subset-sums ratio problems. Theor. Comput. Sci. 931: 17-30 (2022) - [c9]Giannis Alonistiotis
Approximating Subset Sum Ratio via Subset Sum Computations. IWOCA 2022: 73-85 - [c8]Foivos Fioravantes
Complexity of Finding Maximum Locally Irregular Induced Subgraphs. SWAT 2022: 24:1-24:20 - [i6]Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Approximating Subset Sum Ratio via Subset Sum Computations. CoRR abs/2201.04165 (2022) - 2021
- [c7]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Filling Crosswords Is Very Hard. ISAAC 2021: 36:1-36:16 - [c6]Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos
Digraph Coloring and Distance to Acyclicity. STACS 2021: 41:1-41:15 - [i5]Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Filling Crosswords is Very Hard. CoRR abs/2109.11203 (2021) - 2020
- [c5]Nikolaos Melissinos
Approximation Schemes for Subset Sum Ratio Problems. FAW 2020: 96-107 - [c4]Louis Dublois, Tesshu Hanaka
(In)approximability of Maximum Minimal FVS. ISAAC 2020: 3:1-3:14 - [c3]Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos
On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS 2020: 32-47 - [i4]Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis:
Approximation Schemes for Subset Sum Ratio Problems. CoRR abs/2003.06622 (2020) - [i3]Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of Maximum Minimal FVS. CoRR abs/2009.09971 (2020) - [i2]Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. CoRR abs/2010.06317 (2020)
2010 – 2019
- 2019
- [c2]Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos
Extension and Its Price for the Connected Vertex Cover Problem. IWOCA 2019: 315-326 - 2018
- [c1]Nikolaos Melissinos
A Faster FPTAS for the Subset-Sums Ratio Problem. COCOON 2018: 602-614 - [i1]Nikolaos Melissinos, Aris Pagourtzis:
A Faster FPTAS for the Subset-Sums Ratio Problem. CoRR abs/1803.09952 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: