Nicolaos Matsakis

13 papers A* 2A 1B 2Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A conf
Streaming Diameter of High-Dimensional Points.
ESA
Magnús M. Halldórsson, Nicolaos Matsakis, Pavel Veselý
2025 J jnl
Streaming Diameter of High-Dimensional Points.
CoRR
Magnús M. Halldórsson, Nicolaos Matsakis, Pavel Veselý
2024 J jnl
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop.
ACM Trans. Algorithms
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2023 B conf
Approximation Guarantees for Shortest Superstrings: Simpler and Better.
ISAAC
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2022 A* conf
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios.
STOC
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2021 A* conf
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop.
ICALP
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2021 J jnl
Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios.
CoRR
Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2020 J jnl
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop.
CoRR
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý
2016 — conf
LQD is 1.5-competitive for 3-port Shared-Memory Switches.
SOFSEM (Student Research Forum Papers / Posters)
Nicolaos Matsakis
2015 — —
Approximation algorithms for packing and buffering problems.
Nicolaos Matsakis
2014 B conf
New Bounds for Online Packing LPs.
LATIN
Matthias Englert, Nicolaos Matsakis, Marcin Mucha
2010 J jnl
Solving the Rural Postman problem using the Adleman-Lipton model
CoRR
Nicolaos Matsakis
2010 J jnl
Transforming a random graph drawing into a Lombardi drawing
CoRR
Nicolaos Matsakis