default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolaos Matsakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Antonios Antoniadis
, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. ACM Trans. Algorithms 20(4): 38:1-38:29 (2024)- 2023
- [c5]Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Approximation Guarantees for Shortest Superstrings: Simpler and Better. ISAAC 2023: 29:1-29:17 - 2022
- [c4]Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. STOC 2022: 317-330 - 2021
- [c3]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. ICALP 2021: 17:1-17:20 - [i4]Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios. CoRR abs/2111.03968 (2021) - 2020
- [i3]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. CoRR abs/2012.03906 (2020)
2010 – 2019
- 2016
- [c2]Nicolaos Matsakis:
LQD is 1.5-competitive for 3-port Shared-Memory Switches. SOFSEM (Student Research Forum Papers / Posters) 2016: 43-58 - 2015
- [b1]Nicolaos Matsakis:
Approximation algorithms for packing and buffering problems. University of Warwick, UK, 2015 - 2014
- [c1]Matthias Englert, Nicolaos Matsakis, Marcin Mucha:
New Bounds for Online Packing LPs. LATIN 2014: 318-329 - 2010
- [i2]Nicolaos Matsakis:
Transforming a random graph drawing into a Lombardi drawing. CoRR abs/1012.2202 (2010) - [i1]Nicolaos Matsakis:
Solving the Rural Postman problem using the Adleman-Lipton model. CoRR abs/1012.2527 (2010)
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-11-07 21:34 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:
