default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonios Antoniadis 0001
Person information
- affiliation: University of Twente, Enschede, The Netherlands
Other persons with the same name
- Antonios Antoniadis 0002 — Aristotle University of Thessaloniki, Thessaloniki, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. ACM Trans. Algorithms 20(4): 38:1-38:29 (2024)- [c36]Antonios Antoniadis, Hajo Broersma
, Yang Meng:
Online Graph Coloring with Predictions. ISCO 2024: 289-302 - 2023
- [j12]Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev:
Secretary and online matching problems with machine learned advice. Discret. Optim. 48(Part 2): 100778 (2023) - [j11]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online Metric Algorithms with Untrusted Predictions. ACM Trans. Algorithms 19(2): 19:1-19:34 (2023) - [c35]Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon:
Paging with Succinct Predictions. ICML 2023: 952-968 - [c34]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Mixing Predictions for Online Metric Algorithms. ICML 2023: 969-983 - [i18]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Mixing predictions for online metric algorithms. CoRR abs/2304.01781 (2023) - [i17]Antonios Antoniadis, Hajo Broersma, Yang Meng:
Online Graph Coloring with Predictions. CoRR abs/2312.00601 (2023) - 2022
- [j10]Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior:
Online search for a hyperplane in high-dimensional Euclidean space. Inf. Process. Lett. 177: 106262 (2022) - [c33]Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons. ESA 2022: 9:1-9:13 - [c32]Antonios Antoniadis, Peyman Jabbarzade, Golnoosh Shahkarami:
A Novel Prediction Setup for Online Speed-Scaling. SWAT 2022: 9:1-9:20 - [c31]Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT 2022: 10:1-10:21 - [i16]Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons. CoRR abs/2208.07567 (2022) - [i15]Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon:
Paging with Succinct Predictions. CoRR abs/2210.02775 (2022) - 2021
- [c30]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. ICALP 2021: 17:1-17:20 - [c29]Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar:
Skeletons and Minimum Energy Scheduling. ISAAC 2021: 51:1-51:16 - [c28]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. NeurIPS 2021: 16714-16726 - [c27]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. WADS 2021: 85-100 - [i14]Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar:
Skeletons and Minimum Energy Scheduling. CoRR abs/2107.07800 (2021) - [i13]Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior:
Online Search for a Hyperplane in High-Dimensional Euclidean Space. CoRR abs/2109.04340 (2021) - [i12]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. CoRR abs/2110.13116 (2021) - [i11]Antonios Antoniadis, Peyman Jabbarzade, Golnoosh Shahkarami:
A Novel Prediction Setup for Online Speed-Scaling. CoRR abs/2112.03082 (2021) - 2020
- [j9]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49(1): 37-66 (2020) - [j8]Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM Trans. Algorithms 16(3): 38:1-38:16 (2020) - [c26]Antonios Antoniadis, Andrés Cristi, Tim Oosterwijk, Alkmini Sgouritsa:
A General Framework for Energy-Efficient Cloud Computing Mechanisms. AAMAS 2020: 70-78 - [c25]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online metric algorithms with untrusted predictions. ICML 2020: 345-355 - [c24]Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev:
Secretary and Online Matching Problems with Machine Learned Advice. NeurIPS 2020 - [c23]Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar:
Parallel Machine Scheduling to Minimize Energy Consumption. SODA 2020: 2758-2769 - [i10]Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online metric algorithms with untrusted predictions. CoRR abs/2003.02144 (2020) - [i9]Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev:
Secretary and Online Matching Problems with Machine Learned Advice. CoRR abs/2006.01026 (2020) - [i8]Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR abs/2008.12075 (2020) - [i7]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. CoRR abs/2010.14338 (2020) - [i6]Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Veselý:
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop. CoRR abs/2012.03906 (2020)
2010 – 2019
- 2019
- [j7]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line. Algorithmica 81(7): 2917-2933 (2019) - [j6]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott:
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State. Algorithmica 81(9): 3725-3745 (2019) - [c22]Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke:
On the Complexity of Anchored Rectangle Packing. ESA 2019: 8:1-8:14 - [c21]Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. SODA 2019: 1089-1105 - [i5]Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar:
Parallel Machine Scheduling to Minimize Energy Consumption. CoRR abs/1909.13345 (2019) - 2018
- [c20]Antonios Antoniadis, Carsten Fischer, Andreas Tönnis:
A Collection of Lower Bounds for Online Matching on the Line. LATIN 2018: 52-65 - [c19]Antonios Antoniadis, Andrés Cristi:
A Near Optimal Mechanism for Energy Aware Scheduling. SAGT 2018: 31-42 - [c18]Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke:
Approximating Airports and Railways. STACS 2018: 5:1-5:13 - [i4]Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. CoRR abs/1804.03953 (2018) - 2017
- [j5]Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules. Algorithmica 79(2): 568-597 (2017) - [j4]Antonios Antoniadis, Peter Kling, Sebastian Ott, Sören Riechers:
Continuous speed scaling with variability: A simple and direct approach. Theor. Comput. Sci. 678: 1-13 (2017) - [c17]Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese:
A QPTAS for the General Scheduling Problem with Identical Release Dates. ICALP 2017: 31:1-31:14 - [c16]Antonios Antoniadis, Kevin Schewior:
A Tight Lower Bound for Online Convex Optimization with Switching Costs. WAOA 2017: 164-175 - [i3]Antonios Antoniadis, Carsten Fischer, Andreas Tönnis:
A Collection of Lower Bounds for Online Matching on the Line. CoRR abs/1712.07099 (2017) - 2016
- [c15]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato:
Chasing Convex Bodies and Functions. LATIN 2016: 68-81 - [c14]Anna Adamaszek, Antonios Antoniadis, Tobias Mömke:
Airports and Railways: Facility Location Meets Network Design. STACS 2016: 6:1-6:14 - 2015
- [j3]Susanne Albers, Antonios Antoniadis, Gero Greiner:
On multi-processor speed scaling with migration. J. Comput. Syst. Sci. 81(7): 1194-1209 (2015) - [c13]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott:
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. SODA 2015: 1102-1113 - 2014
- [j2]Susanne Albers, Antonios Antoniadis:
Race to idle: New algorithms for speed scaling with a sleep state. ACM Trans. Algorithms 10(2): 9:1-9:31 (2014) - [c12]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. IGCC 2014: 1-8 - [c11]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Energy-efficient circuit design. ITCS 2014: 303-312 - [c10]Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent, Kirk Pruhs:
Packet Forwarding Algorithms in a Line Network. LATIN 2014: 610-621 - [c9]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - [c8]Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. STACS 2014: 63-74 - [c7]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
A o(n) -Competitive Deterministic Algorithm for Online Matching on a Line. WAOA 2014: 11-22 - [i2]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott:
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. CoRR abs/1407.0892 (2014) - 2013
- [j1]Antonios Antoniadis, Chien-Chung Huang:
Non-preemptive speed scaling. J. Sched. 16(4): 385-394 (2013) - [c6]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott, José Verschae:
How to Pack Your Items When You Have to Buy Your Knapsack. MFCS 2013: 62-73 - 2012
- [b1]Antonios Antoniadis:
Scheduling algorithms for saving energy and balancing load. Humboldt University of Berlin, 2012, pp. 1-100 - [c5]Susanne Albers, Antonios Antoniadis:
Race to idle: new algorithms for speed scaling with a sleep state. SODA 2012: 1266-1285 - [c4]Antonios Antoniadis, Chien-Chung Huang:
Non-preemptive Speed Scaling. SWAT 2012: 249-260 - 2011
- [c3]Susanne Albers, Antonios Antoniadis, Gero Greiner:
On multi-processor speed scaling with migration: extended abstract. SPAA 2011: 279-288 - [c2]Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza:
Balanced Interval Coloring. STACS 2011: 531-542 - 2010
- [c1]Antonios Antoniadis, Andrzej Lingas:
Approximability of Edge Matching Puzzles. SOFSEM 2010: 153-164 - [i1]Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza:
Balanced Interval Coloring. CoRR abs/1012.3932 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
