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

Anna Adamaszek, Antonios Antoniadis and Tobias Mömke:
Airports and Railways: Facility Location Meets Network Design,
In Proc. of 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), pp. 6:1-6:14, 2016

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior and Michele Scquizzato:
Chasing Convex Bodies and Functions,
In Proc. of 12th Latin American Theoretical Informatics Symposium (LATIN 2016), pp. 68-81,2016.

Antonios Antoniadis, Chien-Chung Huang and Sebastian Ott:
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State,
In Proc. of 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 1102-1113, 2015.

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs and Michele Scquizzato:
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line,
In Proc. of 12th Workshop on Approximation and Online Algorithms (WAOA 2014), pp. 11-24, 2014.

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs and Michele Scquizzato:
Complexity-Theoretic Obstacles to Achieving Energy Savings with Near-Threshold Computing,
In Proc. of 5th International Green Computing Conference (IGCC 2014), pp. 1-8, 2014.

Antonios Antoniadis, Neal Barcelo, Mario Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs and Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules,
In Proc. of 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), LIPIcs 25, pp. 63-74, 2014.

Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent and Kirk Pruhs:
Packet Forwarding Algorithms in a Line Network,
Proc. of 11th Latin American Theoretical INformatics Symposium (LATIN 2014), LNCS 8392, pp. 610-621, Springer, 2014.

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs and Michele Scquizzato:
Energy-Efficient Circuit Design,
In Proc. of 5th Innovations in Theoretical Computer Science conference (ITCS 2014), pp. 303-312, ACM, 2014.

Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs and Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing,
In Proc. of 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 1141-1153, SIAM, 2014.

Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott and José Verschae:
How to Pack Your Items When You Have to Buy Your Knapsack,
Proc. of 38th Symposium on Mathematical Foundations of Computer Science (MFCS 2013), LNCS 8087,pp. 62-73, Springer, 2013.

Antonios Antoniadis and Chien-Chung Huang:
Non-Preemptive Speed Scaling,
in Proc. of 13th Scandinavian Symposium and Workshops on Algorgithm Theory (SWAT 2012), LNCS 7357, pp. 249-260, Springer, 2012.

Susanne Albers and Antonios Antoniadis:
Race to Idle: New Algogrithms for Speed Scaling with a Sleep State,
In Proc. of 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1269-1285, SIAM, 2012.

Susanne Albers, Antonios Antoniadis and Gero Greiner:
On Multiprocessor Speed-Scaling with Migration,
In Proc. of 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011), pp. 279-288, ACM, 2011.

Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Mondenhauer and Alexander Souza:
Balanced Interval Coloring,
In Proc. of 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), LIPIcs 9, pp. 531-542, 2011.

Antonios Antoniadis and Andrzej Lingas:
Approximability of Edge Matching Puzzles,
In Proc. of 36th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), LNCS 5901, pp. 153-164, Springer, 2010.

Journal Articles

Antonios Antoniadis, Themis Gouleakis, Pieter Kleer and Pavel Kolev:
Secretary and Online Matching Problems with Machine Learned Advice,
Discrete Optimization : 48(Part 2):100778 (2023).

Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak and Bertrand Simon:
Online Metric Algorithms with Untrusted Predictions,
ACM Transactions on Algorithms (TALG) : 19(2):19:1--19:34 (2023).

Antonios Antoniadis, Sándor Kisfaludi-Bak, Ruben Hoeksma and Kevin Schewior:
Online search for a hyperplane in high-dimensional Euclidean space
Information Processing Letters (IPL) 177:106262 (2023)

Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma and Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
ACM Transactions on Algorithms (TALG) 16(3): 38:1--38:16 (2020)

Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs and Cliff Stein:
Hallucination Helps: Energy-Efficient Virtual Circuit Routing
SIAM Journal on Computing (SICOMP), 49(1):37-66 (2020).

Antonios Antoniadis, Chien-Chung Huang and Sebastian Ott:
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State,
Algorithmica, 81(9) pp. 3725-3745 (2019)

Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs and Michele Squizzato:
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line,
Algorithmica, 81(7) pp. 2917-2933 (2019).

Antonios Antoniadis, Neal Barcelo, Mario Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs and Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules,
Algorithmica, 79(2), pp. 568-597 (2017).

Antonios Antoniadis, Peter Kling, Sebastian Ott and Sören Riechers:
Continuous speed scaling with variability: A simple and direct approach.
Theoretical Computer Science, 678, pp. 1-13 (2017).

Susanne Albers, Antonios Antoniadis and Gero Greiner:
On Multi-Processor Speed Scaling with Migration,
J. Comput. System. Sci., 81(7), pp. 1194-1209 (2015).

Susanne Albers and Antonios Antoniadis:
Race to Idle: New Algorithms for Speed Scaling with a Sleep State,
ACM Transactions on Algorithms (TALG), 10(2), Article 9 (2014).

Antonios Antoniadis and Chien-Chung Huang:
Non-Preemptive Speed-Scaling,
Journal of Scheduling, 16(4), pp. 385-394 (2013).



Theses

Scheduling Algorithms for Saving Energy and Balancing Load, Ph.D. Thesis, HU Berlin (2012). Supervisor: Prof. Dr. Susanne Albers.

Approximability of Edge Matching Puzzles, Master Thesis, Lund University (2009). Supervisor: Prof. Dr. Andrzej Lingas.