Refereed Conference Proceedings

Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak and Bertrand Simon:
Paging with Succint Predictions,
In Proc. of 40th International Conference on Machine Learning (ICML 2023): (to appear).

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak and Bertrand Simon:
Mixing Predictions for Online Metric Algorithms,
In Proc. of 40th International Conference on Machine Learning (ICML 2023): (to appear).

Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak and Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons,
In Proc. of European Symposium on Algorithms (ESA 2022): 177:106262 (2022).

Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit and Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods,
In Proc. of 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022): 9:1--9:13.

Antonios Antoniadis, Peyman Jabbarzade Ganje and Golnoosh Shahkarami:
A Novel Prediction Setup for Online Speed-Scaling,
In Proc. of 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022): 9:1--9:20.

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak and Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds,
In Proc. of 35th Conference on Neural Information Processing Systems (NeurIPS 2021): 16714--16726.

Antonios Antoniadis, Gunjan Kumar and Nikhil Kumar:
Skeletons and Minimum Energy Scheduling,
In Proc. of 32nd International Symposium on Algorithms and Computation (ISAAC 2021): 51:1--51:16.

Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis and Pavel Veselý:
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop,
In Proc. of 48th International Colloquium on Automata, Languages and Programming (ICALP 2021): 17:1--17:20.

Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta and Joachim Spoerhase:
On Minimum Generalized Manhattan Connections ,
In Proc. of 17th Algorithms and Data Structures Symposium (WADS 2021): 85--100.

Antonios Antoniadis, Themis Gouleakis, Pieter Kleer and Pavel Kolev:
Secretary and Online Matching Problems with Machine Learned Advice,
In Proc. of 34th Conference on Neural Information Processing Systems (NeurIPS 2020).

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak and Bertrand Simon:
Online Metric Algorithms with Untrusted Predictions,
In Proc. of 37th International Conference on Machine Learning (ICML 2020): 345--355.

Antonios Antoniadis, Naveen Garg, Gunjan Kumar and Nikhil Kumar:
Parallel Machine Scheduling to Minimize Energy Consumption,
In Proc. of 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 2758-2769.

Antonios Antoniadis, Andrés Cristi, Tim Oosterwijk and Alkmini Sgouritsa:
A General Framework for Energy-Efficient Cloud Computing Mechanisms,
In Proc. of International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2020): 70 -- 78.

Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, and Lukas Nölk:
On the Complexity of Anchored Rectangle Packing,
In Proc. of 27th European Symposium on Algorithms(ESA 2019), 8:1-8:14 (2019)

Antonios Antoniadis Krzysztof Fleszar, Ruben Hoeksma and Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods ,
In Proc. of 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), pp. 1089-1105, (2019)

Antonios Antoniadis and Andrés Cristi:
A Near Optimal Mechanism for Energy Aware Scheduling ,
To appear in Proc. of 11th International Symposium on Algorithmic Game Theory (SAGT 2018),

Anna Adamaszek, Antonios Antoniadis, Amit Kumar and Tobias Mömke:
Approximating Airports and Railways,
In Proc. of 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), 5:1-5:13, 2018

Antonios Antoniadis, Carsten Fischer and Andreas Tönnis:
Lower Bounds for Online Matching on the Line
In Proc. of 13th Latin American Theoretical Informatics Symposium ( LATIN 2018), pp. 52-65, 2018

Antonios Antoniadis and Kevin Schewior:
A Tight Lower Bound for Online Convex Optimization with Switching Costs,
In Proc. of the 15th Workshop on Approximation and Online Algorithms (WAOA 2017), pp. 164-175, 2017

Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae and Andreas Wiese:
A QPTAS for the General Scheduling Problem with Identical Release Dates,
In Proc. of 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), pp. 31:1-31:14, 2017