Approximability of Edge Matching Puzzles. - Antonios Antoniadis 001; Andrzej Lingas (SOFSEM, 2010)

On multi-processor speed scaling with migration: extended abstract. - Susanne Albers; Antonios Antoniadis 001; Gero Greiner (SPAA, 2011)

Balanced Interval Coloring. - Antonios Antoniadis 001; Falk Hüffner; Pascal Lenzner; Carsten Moldenhauer; Alexander Souza (STACS, 2011)

Scheduling algorithms for saving energy and balancing load. - Antonios Antoniadis 001 (2012)

How to Pack Your Items When You Have to Buy Your Knapsack. - Antonios Antoniadis 001; Chien-Chung Huang 001; Sebastian Ott; José Verschae (MFCS, 2013)

Non-preemptive speed scaling. - Antonios Antoniadis 001; Chien-Chung Huang 001 (J. Sched., 2013)

Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (IGCC, 2014)

Energy-efficient circuit design. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (ITCS, 2014)

Packet Forwarding Algorithms in a Line Network. - Antonios Antoniadis 001; Neal Barcelo; Daniel Cole; Kyle Fox; Benjamin Moseley; Michael Nugent; Kirk Pruhs (LATIN, 2014)

Race to idle: New algorithms for speed scaling with a sleep state. - Susanne Albers; Antonios Antoniadis 001 (ACM Trans. Algorithms, 2014)

On multi-processor speed scaling with migration. - Susanne Albers; Antonios Antoniadis 001; Gero Greiner (J. Comput. Syst. Sci., 2015)

Chasing Convex Bodies and Functions. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Kevin Schewior; Michele Scquizzato (LATIN, 2016)

Airports and Railways: Facility Location Meets Network Design. - Anna Adamaszek; Antonios Antoniadis 001; Tobias Mömke (STACS, 2016)

A QPTAS for the General Scheduling Problem with Identical Release Dates. - Antonios Antoniadis 001; Ruben Hoeksma; Julie Meißner; José Verschae; Andreas Wiese (ICALP, 2017)

A Tight Lower Bound for Online Convex Optimization with Switching Costs. - Antonios Antoniadis 001; Kevin Schewior (WAOA, 2017)

Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules. - Antonios Antoniadis 001; Neal Barcelo; Mario E. Consuegra; Peter Kling; Michael Nugent; Kirk Pruhs; Michele Scquizzato (Algorithmica, 2017)

Continuous speed scaling with variability: A simple and direct approach. - Antonios Antoniadis 001; Peter Kling; Sebastian Ott; Sören Riechers (Theor. Comput. Sci., 2017)

A Collection of Lower Bounds for Online Matching on the Line. - Antonios Antoniadis 001; Carsten Fischer; Andreas Tönnis (LATIN, 2018)

A Near Optimal Mechanism for Energy Aware Scheduling. - Antonios Antoniadis 001; Andrés Cristi (SAGT, 2018)

Approximating Airports and Railways. - Anna Adamaszek; Antonios Antoniadis 001; Amit Kumar 001; Tobias Mömke (STACS, 2018)

On the Complexity of Anchored Rectangle Packing. - Antonios Antoniadis 001; Felix Biermeier; Andrés Cristi; Christoph Damerius; Ruben Hoeksma; Dominik Kaaser; Peter Kling; Lukas Nölke (ESA, 2019)

A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Michele Scquizzato (Algorithmica, 2019)

A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State. - Antonios Antoniadis 001; Chien-Chung Huang 001; Sebastian Ott (Algorithmica, 2019)

A General Framework for Energy-Efficient Cloud Computing Mechanisms. - Antonios Antoniadis 001; Andrés Cristi; Tim Oosterwijk; Alkmini Sgouritsa (AAMAS, 2020)

Parallel Machine Scheduling to Minimize Energy Consumption. - Antonios Antoniadis 001; Naveen Garg 001; Gunjan Kumar; Nikhil Kumar 001 (SODA, 2020)

Hallucination Helps: Energy Efficient Virtual Circuit Routing. - Antonios Antoniadis 001; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley; Viswanath Nagarajan; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2020)

A PTAS for Euclidean TSP with Hyperplane Neighborhoods. - Antonios Antoniadis 001; Krzysztof Fleszar 001; Ruben Hoeksma; Kevin Schewior (ACM Trans. Algorithms, 2020)

Skeletons and Minimum Energy Scheduling. - Antonios Antoniadis 001; Gunjan Kumar; Nikhil Kumar 001 (ISAAC, 2021)

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (NeurIPS, 2021)

On Minimum Generalized Manhattan Connections. - Antonios Antoniadis 001; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nölke; Nidia Obscura Acosta; Joachim Spoerhase (WADS, 2021)

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

A Novel Prediction Setup for Online Speed-Scaling. - Antonios Antoniadis 001; Peyman Jabbarzade; Golnoosh Shahkarami (SWAT, 2022)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. - Antonios Antoniadis 001; Sándor Kisfaludi-Bak; Bundit Laekhanukit; Daniel Vaz 001 (SWAT, 2022)

Online search for a hyperplane in high-dimensional Euclidean space. - Antonios Antoniadis 001; Ruben Hoeksma; Sándor Kisfaludi-Bak; Kevin Schewior (Inf. Process. Lett., 2022)

Paging with Succinct Predictions. - Antonios Antoniadis 001; Joan Boyar; Marek Eliás 001; Lene Monrad Favrholdt; Ruben Hoeksma; Kim S. Larsen; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Mixing Predictions for Online Metric Algorithms. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Online Metric Algorithms with Untrusted Predictions. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ACM Trans. Algorithms, 2023)

Secretary and online matching problems with machine learned advice. - Antonios Antoniadis 001; Themis Gouleakis; Pieter Kleer; Pavel Kolev (Discret. Optim., 2023)

Online Graph Coloring with Predictions. - Antonios Antoniadis 001; Hajo Broersma; Yang Meng 001 (ISCO, 2024)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. - Antonios Antoniadis 001; Matthias Englert; Nicolaos Matsakis; Pavel Veselý 001 (ACM Trans. Algorithms, 2024)

Approximation algorithms for combinatorial optimization with predictions. - Antonios Antoniadis 001; Marek Eliás 001; Adam Polak 001; Moritz Venzin (ICLR, 2025)

Competitive mechanisms for energy-efficient cloud computing. - Antonios Antoniadis 001; Andrés Cristi; Tim Oosterwijk; Alkmini Sgouritsa (Theor. Comput. Sci., 2025)

Stochastic scheduling with Bernoulli-type jobs through policy stratification. - Antonios Antoniadis 001; Ruben Hoeksma; Kevin Schewior; Marc Uetz (CoRR, 2025)