Transforming a random graph drawing into a Lombardi drawing - Nicolaos Matsakis (CoRR, 2010)

Solving the Rural Postman problem using the Adleman-Lipton model - Nicolaos Matsakis (CoRR, 2010)

New Bounds for Online Packing LPs. - Matthias Englert; Nicolaos Matsakis; Marcin Mucha (LATIN, 2014)

Approximation algorithms for packing and buffering problems. - Nicolaos Matsakis (2015)

LQD is 1.5-competitive for 3-port Shared-Memory Switches. - Nicolaos Matsakis (SOFSEM (Student Research Forum Papers / Posters), 2016)

Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. - Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (STOC, 2022)

Approximation Guarantees for Shortest Superstrings: Simpler and Better. - Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (ISAAC, 2023)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. - Antonios Antoniadis 001; Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (ACM Trans. Algorithms, 2024)

Streaming Diameter of High-Dimensional Points. - Magnús M. Halldórsson; Nicolaos Matsakis; Pavel Veselý 001 (CoRR, 2025)