Antonis Skarlatos

Email: antonis.skarlatos[at]plus.ac.at
antonisskarlatosj[at]gmail.com
[DBLP]
[Google Scholar]
[Github]
[Linkedin]

About me

I am a PhD student at the University of Salzburg, fortunate to be advised by Sebastian Forster.

I hold a master's degree from the ALMA (Algorithms, Logic, and Discrete Mathematics) graduate program, which is co-organized by the National and Kapodistrian University of Athens and the National Technical University of Athens. Previously, I completed my undergraduate studies at the National and Kapodistrian University of Athens. In both instances, I had the privilege of being advised by Stavros Kolliopoulos.

During my master's studies, I had the opportunity to intern at the Max Planck Institute for Informatics for six months under the valuable guidance of Antonios Antoniadis.

I enjoy playing football (soccer), travelling, playing guitar, and engaging in competitive programming. If I can be of any assistance, please feel free to contact me via either of the two email addresses.

Research Interests

I am interested in Theoretical Computer Science, and more specifically in algorithms, graph theory and data structures. Currently, my research is focused on dynamic algorithms that maintain properties of dynamically changing inputs (e.g., graphs or metric spaces) depending on the problem of interest. At this period, I am mostly focusing on shortest paths and clustering problems.

Publications

Authors are listed in alphabetic order.

Dynamic Consistent k-Center Clustering with Optimal Recourse
with Sebastian Forster
Symposium on Discrete Algorithms (SODA), 2025
[arXiv]
Dynamic Algorithms for k-Center on Graphs
with Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari
Symposium on Discrete Algorithms (SODA), 2024
[conference] [arXiv]
Fast Algorithms for Energy Games in Special Cases
with Sebastian Forster, Tijn de Vos
14th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF), 2023
[conference] [arXiv]
Bootstrapping Dynamic Distance Oracles
with Sebastian Forster, Gramoz Goranci, Yasamin Nazari
31st European Symposium on Algorithms (ESA), 2023
[conference] [arXiv]
Computing Smallest Convex Intersecting Polygons
with Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak
30th European Symposium on Algorithms (ESA), 2022
[conference] [arXiv]
Precedence-Constrained Covering Problems with Multiplicity Constraints
with Stavros G. Kolliopoulos
19th Workshop on Approximation and Online Algorithms (WAOA), 2021
Journal of Combinatorial Optimization, Volume 45
[conference] [journal]

News / Talks / Events

This list contains only some of the News / Talks / Events.

June 2024: Poster on Dynamic Algorithms for k-Center on Graphs at the Austrian Computer Science Day (ACSD) in Vienna.
June 2024: Talk and Poster on Dynamic Algorithms for k-Center on Graphs at the Highlights of Algorithms (HALG) in Warsaw.
May 2024: Talk on Bootstrapping Dynamic Distance Oracles at the National and Kapodistrian University of Athens.
January 2024: I visited (informally) MIT for four days. I am happy for the opportunity to have had nice and productive discussions with Virginia Vassilevska Williams, Yael Kirkpatrick, and Christoph Grunau.
January 2024: Talk on Dynamic Algorithms for k-Center on Graphs in Computer Science Theory Seminar at Northeastern University.
January 2024: Talk on Dynamic Algorithms for k-Center on Graphs at Symposium on Discrete Algorithms (SODA).
September 2023: Talk on Fast Algorithms for Energy Games in Special Cases at International Symposium on Games, Automata, Logics, and Formal Verification (GandALF).
September 2023: Talk on Bootstrapping Dynamic Distance Oracles at European Symposium on Algorithms (ESA).
August 2023: Attended the Max Planck Advanced Course on the Foundations of Computer Science (ADFOCS).
July 2023: Taught (virtually) basic algorithmic techniques to high school students from Greece. Happy that I was one of the teachers of the Greek Summer School which prepared high school students to engage with competitive programming.
July 2022: Attended the Bernoulli Center Summer School on Modern Trends in Combinatorial Optimization at EPFL.
August 2021: Attended (virtually) the Max Planck Advanced Course on the Foundations of Computer Science (ADFOCS).
September 2021: (Virtual) Talk on Precedence-Constrained Covering Problems with Multiplicity Constraints at Workshop on Approximation and Online Algorithms (WAOA).
August 2020: Attended (virtually) the Cornell, Maryland, Max Planck Pre-doctoral Research School.

Short Biography

Full CV is available [here]

2021 - Current: PhD in Theoretical Computer Science, University of Salzburg
Advisor: Sebastian Forster
2020 - 2021 (6 months): Internship at Max Planck Institute for Informatics
Advisor: Antonios Antoniadis
2018 - 2021 (2.5 years): Graduate Student in Theoretical Computer Science, National and Kapodistrian University of Athens, National Technical University of Athens
Thesis: Approximation Algorithms for the Precedence Constrained Minimum Knapsack and Capacitated Covering Integer Programs
Advisor: Stavros Kolliopoulos
2014 - 2018: Undergraduate Student in Computer Science, National and Kapodistrian University of Athens
Thesis (in Greek): Algorithms and Parameters Related to Treewidth
Advisor: Stavros Kolliopoulos