Higher-order Erdos-Szekeres theorems. - Marek Eliás 001; Jirí Matousek 001 (SCG, 2012)

Lower Bounds on Geometric Ramsey Functions. - Marek Eliás 001; Jirí Matousek 001; Edgardo Roldán-Pensado; Zuzana Safernová (SIAM J. Discret. Math., 2014)

Improved Approximation for Vector Bin Packing. - Nikhil Bansal 001; Marek Eliás 001; Arindam Khan 001 (SODA, 2016)

New Bounds for the $(h, k)$-Server Problem. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (CoRR, 2016)

Weighted k-Server Bounds via Combinatorial Dichotomies. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos (FOCS, 2017)

The (h, k)-Server Problem on Bounded Depth Trees. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (SODA, 2017)

Competitive Algorithms for Generalized k-Server in Uniform Metrics. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos; Jesper Nederlof (CoRR, 2017)

Tight Bounds for Double Coverage Against Weak Adversaries. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos; Kirk Pruhs (Theory Comput. Syst., 2018)

The (h, k)-Server Problem on Bounded Depth Trees. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (ACM Trans. Algorithms, 2019)

Differentially Private Release of Synthetic Graphs. - Marek Eliás 001; Michael Kapralov; Janardhan Kulkarni; Yin Tat Lee (SODA, 2020)

Nested Convex Bodies are Chaseable. - Nikhil Bansal 001; Martin Böhm 001; Marek Eliás 001; Grigorios Koumoutsos; Seeun William Umboh (Algorithmica, 2020)

Differentially Private Correlation Clustering. - Mark Bun; Marek Eliás 001; Janardhan Kulkarni (ICML, 2021)

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (NeurIPS, 2021)

Paging with Succinct Predictions. - Antonios Antoniadis 001; Joan Boyar; Marek Eliás 001; Lene Monrad Favrholdt; Ruben Hoeksma; Kim S. Larsen; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Mixing Predictions for Online Metric Algorithms. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ICML, 2023)

Competitive Algorithms for Generalized k-Server in Uniform Metrics. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos; Jesper Nederlof (ACM Trans. Algorithms, 2023)

Online Metric Algorithms with Untrusted Predictions. - Antonios Antoniadis 001; Christian Coester; Marek Eliás 001; Adam Polak 001; Bertrand Simon 001 (ACM Trans. Algorithms, 2023)

Algorithms for Caching and MTS with reduced number of predictions. - Karim Abdel Sadek; Marek Eliás 001 (ICLR, 2024)

Learning-Augmented Algorithms with Explicit Predictors. - Marek Eliás 001; Haim Kaplan; Yishay Mansour; Shay Moran (NeurIPS, 2024)

Bandits with Knapsacks and Predictions. - Davide Drago; Andrea Celli; Marek Eliás 001 (UAI, 2024)

Approximation algorithms for combinatorial optimization with predictions. - Antonios Antoniadis 001; Marek Eliás 001; Adam Polak 001; Moritz Venzin (ICLR, 2025)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems. - Sander Borst; Marek Eliás 001; Moritz Venzin (SODA, 2025)

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors. - Matei Gabriel Cosa; Marek Eliás 001 (CoRR, 2025)