Antonios Antoniadis

Orcid: 0000-0003-2152-7883

  • University of Twente, Enschede, The Netherlands

According to our database1, Antonios Antoniadis authored at least 40 papers between 2010 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Online Graph Coloring with Predictions.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

Secretary and online matching problems with machine learned advice.
Discret. Optim., May, 2023

Online Metric Algorithms with Untrusted Predictions.
ACM Trans. Algorithms, April, 2023

Mixing Predictions for Online Metric Algorithms.
Proceedings of the International Conference on Machine Learning, 2023

Paging with Succinct Predictions.
Proceedings of the International Conference on Machine Learning, 2023

Online search for a hyperplane in high-dimensional Euclidean space.
Inf. Process. Lett., 2022

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

A Novel Prediction Setup for Online Speed-Scaling.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Computing Smallest Convex Intersecting Polygons.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

On Minimum Generalized Manhattan Connections.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Skeletons and Minimum Energy Scheduling.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

A PTAS for Euclidean TSP with Hyperplane Neighborhoods.
ACM Trans. Algorithms, 2020

Hallucination Helps: Energy Efficient Virtual Circuit Routing.
SIAM J. Comput., 2020

Parallel Machine Scheduling to Minimize Energy Consumption.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

A General Framework for Energy-Efficient Cloud Computing Mechanisms.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State.
Algorithmica, 2019

A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line.
Algorithmica, 2019

On the Complexity of Anchored Rectangle Packing.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Approximating Airports and Railways.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A Near Optimal Mechanism for Energy Aware Scheduling.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

A Collection of Lower Bounds for Online Matching on the Line.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Continuous speed scaling with variability: A simple and direct approach.
Theor. Comput. Sci., 2017

Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules.
Algorithmica, 2017

A Tight Lower Bound for Online Convex Optimization with Switching Costs.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

A QPTAS for the General Scheduling Problem with Identical Release Dates.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Airports and Railways: Facility Location Meets Network Design.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Chasing Convex Bodies and Functions.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

On multi-processor speed scaling with migration.
J. Comput. Syst. Sci., 2015

Race to idle: New algorithms for speed scaling with a sleep state.
ACM Trans. Algorithms, 2014

Packet Forwarding Algorithms in a Line Network.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Energy-efficient circuit design.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Complexity-theoretic obstacles to achieving energy savings with near-threshold computing.
Proceedings of the International Green Computing Conference, 2014

Non-preemptive speed scaling.
J. Sched., 2013

How to Pack Your Items When You Have to Buy Your Knapsack.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Scheduling algorithms for saving energy and balancing load.
PhD thesis, 2012

Balanced Interval Coloring.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On multi-processor speed scaling with migration: extended abstract.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Approximability of Edge Matching Puzzles.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010