| No. |
Title |
Author |
Year |
| 1 |
A Novel Prediction Setup for Online Speed-Scaling |
Antoniadis, Antonios et al. |
2022 |
| 2 |
Computing Smallest Convex Intersecting Polygons |
Antoniadis, Antonios et al. |
2022 |
| 3 |
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods |
Antoniadis, Antonios et al. |
2022 |
| 4 |
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop |
Antoniadis, Antonios et al. |
2021 |
| 5 |
Skeletons and Minimum Energy Scheduling |
Antoniadis, Antonios et al. |
2021 |
| 6 |
On the Complexity of Anchored Rectangle Packing |
Antoniadis, Antonios et al. |
2019 |
| 7 |
Approximating Airports and Railways |
Adamaszek, Anna et al. |
2018 |
| 8 |
A QPTAS for the General Scheduling Problem with Identical Release Dates |
Antoniadis, Antonios et al. |
2017 |
| 9 |
Airports and Railways: Facility Location Meets Network Design |
Adamaszek, Anna et al. |
2016 |
| 10 |
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules |
Antoniadis, Antonios et al. |
2014 |
| 11 |
Balanced Interval Coloring |
Antoniadis, Antonios et al. |
2011 |
