Computing Smallest Convex Intersecting Polygons. - Antonios Antoniadis 001; Mark de Berg; Sándor Kisfaludi-Bak; Antonis Skarlatos (ESA, 2022)

Bootstrapping Dynamic Distance Oracles. - Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (ESA, 2023)

Fast Algorithms for Energy Games in Special Cases. - Sebastian Forster; Antonis Skarlatos; Tijn de Vos (GandALF, 2023)

Dynamic algorithms for k-center on graphs. - Emilio Cruciani; Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (CoRR, 2023)

Precedence-constrained covering problems with multiplicity constraints. - Stavros G. Kolliopoulos; Antonis Skarlatos (J. Comb. Optim., 2023)

Dynamic algorithms for k-center on graphs. - Emilio Cruciani; Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (SODA, 2024)

Dynamic Consistent k-Center Clustering with Optimal Recourse. - Sebastian Forster; Antonis Skarlatos (SODA, 2025)