Welkom...

dr. A. Antoniadis (Antonios)

Universitair docent

Expertises

Mathematics
Euclidean
Euclidean Space
Hyperplane
Polynomial Time Approximation Scheme
Engineering & Materials Science
Approximation Algorithms
Np-Hard
Polynomials
Sleep

Publicaties

Recent
Antoniadis, A. , Hoeksma, R., Kisfaludi-Bak, S., & Schewior, K. (2022). Online search for a hyperplane in high-dimensional Euclidean space. Information processing letters, 177, [106262]. https://doi.org/10.1016/j.ipl.2022.106262
Antoniadis, A., Kumar, G., & Kumar, N. (2021). Skeletons and Minimum Energy Scheduling. In ISAAC
Antoniadis, A., Capretto, M., Chalermsook, P., Damerius, C., Kling, P., Nölke, L., Obscura Acosta, N., & Spoerhase, J. (2021). On Minimum Generalized Manhattan Connections. In Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings (pp. 85-100) https://doi.org/10.1007/978-3-030-83508-8_7
Antoniadis, A., Coester, C., Polak, A., Simon, B., & Elias, M. (2021). Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. In 35th Conference on Neural Information Processing Systems (NeurIPS 2021) (Advances in Neural Information Processing Systems; Vol. 34). https://proceedings.neurips.cc/paper/2021/hash/8b8388180314a337c9aa3c5aa8e2f37a-Abstract.html
Antoniadis, A., Englert , M., Matsakis, N., & Vesely, P. (2021). Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) https://doi.org/10.4230/LIPIcs.ICALP.2021.17
Antoniadis, A. , Hoeksma, R., Kisfaludi-Bak, S., & Schewior, K. (2021). Online Search for a Hyperplane in High-Dimensional Euclidean Space. arXiv.org.
Antoniadis, A., Gouleakis, T., Kleer, P., & Kolev, P. (2020). Secretary and online matching problems with machine learned advice. In 34th Conference on Neural Information Processing Systems, NeurIPS 2020 (Advances in Neural Information Processing Systems).
Antoniadis, A., Garg, N., Kumar, G., & Kumar, N. (2020). Parallel machine scheduling to minimize energy consumption. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2758–2769)
Antoniadis, A., Coester, C., Elias, M., Polak, A., & Simon, B. (2020). Online metric algorithms with untrusted predictions. In 37th International Conference on Machine Learning
Antoniadis, A., Oosterwijk, T., Cristi, A., & Sgouritsa, A. (2020). A general framework for energy-efficient cloud computing mechanisms. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Antoniadis, A., Fleszar, K. , Hoeksma, R., & Schewior, K. (2020). A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM transactions on algorithms, 16(3), [38]. https://doi.org/10.1145/3383466
Antoniadis, A., Fleszar, K. , Hoeksma, R., & Schewior, K. (2019). A PTAS for Euclidean TSP with hyperplane neighborhoods. In Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1089-1105). SIAM. https://doi.org/10.1137/1.9781611975482.67
Antoniadis, A., Cristi, A. , Hoeksma, R., Kling, P., Biermeier, F., Damerius, C., Kaaser, D., & Nölke, L. (2019). On the complexity of anchored rectangle packing. In M. A. Bender, O. Svensson, & G. Herman (Eds.), 27th Annual European Symposium on Algorithms, ESA 2019 (pp. 1-14). [8] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 144). Dagstuhl. https://doi.org/10.4230/LIPIcs.ESA.2019.8
Antoniadis, A., Fleszar, K. , Hoeksma, R., & Schewior, K. (2018). A PTAS for Euclidean TSP with Hyperplane Neighborhoods. arXiv.org. https://arxiv.org/abs/1804.03953
Antoniadis, A. , Hoeksma, R., Meißner, J., Verschae, J., & Wiese, A. (2017). A QPTAS for the general scheduling problem with identical release dates. In A. Muscholl, P. Indyk, F. Kuhn, & I. Chatzigiannakis (Eds.), 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 (pp. 31:1-31:14). [31] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 80). Dagstuhl. https://doi.org/10.4230/LIPIcs.ICALP.2017.31

Google Scholar Link

Vakken Collegejaar  2021/2022

Vakken in het huidig collegejaar worden toegevoegd op het moment dat zij definitief zijn in het Osiris systeem. Daarom kan het zijn dat de lijst nog niet compleet is voor het gehele collegejaar.
 

Contactgegevens

Bezoekadres

Universiteit Twente
Drienerlolaan 5
7522 NB Enschede

Navigeer naar locatie

Postadres

Universiteit Twente
Postbus 217
7500 AE Enschede