Nicolaos Matsakis

According to our database, Nicolaos Matsakis authored at least 8 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop.

Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý

ACM Trans. Algorithms, October, 2024

2023

Approximation Guarantees for Shortest Superstrings: Simpler and Better.

Matthias Englert, Nicolaos Matsakis, Pavel Veselý

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios.

Matthias Englert, Nicolaos Matsakis, Pavel Veselý

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2016

LQD is 1.5-competitive for 3-port Shared-Memory Switches.

Nicolaos Matsakis

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2016 co-located with 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), 2016

2015

Approximation algorithms for packing and buffering problems.

Nicolaos Matsakis

PhD thesis, 2015

2014

New Bounds for Online Packing LPs.

Matthias Englert, Nicolaos Matsakis, Marcin Mucha

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2010

Solving the Rural Postman problem using the Adleman-Lipton model

Nicolaos Matsakis

CoRR, 2010

Transforming a random graph drawing into a Lombardi drawing

Nicolaos Matsakis

CoRR, 2010