2023

Englert, Matthias, Matsakis, Nicolaos and Veselý, Pavel (2023) Approximation guarantees for shortest superstrings : simpler and better. In: 34th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, 3–6 Dec 2023. Published in: Proceedings of the 34th International Symposium on Algorithms and Computation (ISAAC 2023) , 286 29:1-29:17. doi:10.4230/LIPIcs.ISAAC.2023.29 (In Press)

2021

Antoniadis, Antonios, Englert, Matthias, Matsakis, Nicolaos and Veselý, Pavel (2021) Breaking the barrier of 2 for the competitiveness of longest queue drop. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Virtual, 12-16 Jul 2021. Published in: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 198 17:1-17:20. ISBN 9783959771955. doi:10.4230/LIPIcs.ICALP.2021.17 ISSN 1868-8969.

2015

Matsakis, Nicolaos (2015) Approximation algorithms for packing and buffering problems. PhD thesis, University of Warwick.

2014

Englert, Matthias, Matsakis, Nicolaos and Mucha, Marcin (2014) New bounds for online packing LPs. In: Latin American Theoretical INformatics (LATIN) 2014, Montevideo, Uruguay , 31 Mar- 4 Apr 2014. Published in: Lecture Notes in Computer Science series pp. 1-12. doi:10.1007/978-3-642-54423-1_28