Publications

Refereed Conference Proceedings

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

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

Antonios Antoniadis and Kevin Schewior:
A Tight Lower Bound for Online Convex Optimization with Switching Costs,
To appear in Proc. of the 15th Workshop on Approximation and Online Algorithms (WAOA 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, 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.