default search action
Manolis Vasilakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Giannis Alonistiotis
, Antonis Antonopoulos
Approximating subset sum ratio via partition computations. Acta Informatica 61(2): 101-113 (2024) - [j2]Michael Lampis, Manolis Vasilakis:
Structural Parameterizations for Two Bounded Degree Problems Revisited. ACM Trans. Comput. Theory 16(3): 17:1-17:51 (2024) - [c6]Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari:
Parameterized Vertex Integrity Revisited. MFCS 2024: 58:1-58:14 - [i8]Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari:
Parameterized Vertex Integrity Revisited. CoRR abs/2402.09971 (2024) - [i7]Michael Lampis, Manolis Vasilakis:
Parameterized Maximum Node-Disjoint Paths. CoRR abs/2404.14849 (2024) - [i6]Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz:
Parameterized Spanning Tree Congestion. CoRR abs/2410.08314 (2024) - 2023
- [j1]Antonis Antonopoulos
Faster algorithms for k-subset sum and variations. J. Comb. Optim. 45(1): 24 (2023) - [c5]Michael Lampis, Manolis Vasilakis:
Structural Parameterizations for Two Bounded Degree Problems Revisited. ESA 2023: 77:1-77:16 - [c4]Tatsuya Gima
Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC 2023: 21:1-21:15 - [c3]Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis:
Parameterized Max Min Feedback Vertex Set. MFCS 2023: 62:1-62:15 - [i5]Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis:
Parameterized Max Min Feedback Vertex Set. CoRR abs/2302.09604 (2023) - [i4]Michael Lampis, Manolis Vasilakis:
Structural Parameterizations for Two Bounded Degree Problems Revisited. CoRR abs/2304.14724 (2023) - [i3]Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. CoRR abs/2309.17204 (2023) - 2022
- [c2]Giannis Alonistiotis
Approximating Subset Sum Ratio via Subset Sum Computations. IWOCA 2022: 73-85 - [i2]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
- [c1]Antonis Antonopoulos
Faster Algorithms for k-Subset Sum and Variations. IJTCS-FAW 2021: 37-52 - [i1]Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis:
Faster Algorithms for k-Subset Sum and Variations. CoRR abs/2112.04244 (2021)
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-09 22:15 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: