Marek Eliás

41 papers A* 17A 1B 1Journal 21Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A* conf
Approximation algorithms for combinatorial optimization with predictions.
ICLR
Antonios Antoniadis, Marek Eliás, Adam Polak, Moritz Venzin
2025 A* conf
Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors.
ICML
Matei Gabriel Cosa, Marek Eliás
2025 J jnl
Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors.
CoRR
Matei Gabriel Cosa, Marek Eliás
2025 A* conf
Stronger adversaries grow cheaper forests: online node-weighted Steiner problems.
SODA
Sander Borst, Marek Eliás, Moritz Venzin
2024 A* conf
Algorithms for Caching and MTS with reduced number of predictions.
ICLR
Karim Abdel Sadek, Marek Eliás
2024 J jnl
Algorithms for Caching and MTS with reduced number of predictions.
CoRR
Karim Abdel Sadek, Marek Eliás
2024 J jnl
Approximation Algorithms for Combinatorial Optimization with Predictions.
CoRR
Antonios Antoniadis, Marek Eliás, Adam Polak, Moritz Venzin
2024 A conf
Bandits with Knapsacks and Predictions.
UAI
Davide Drago, Andrea Celli, Marek Eliás
2024 A* conf
Learning-Augmented Algorithms with Explicit Predictors.
NeurIPS
Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran
2024 J jnl
Learning-Augmented Algorithms with Explicit Predictors.
CoRR
Marek Eliás, Haim Kaplan, Yishay Mansour, Shay Moran
2024 J jnl
Stronger adversaries grow cheaper forests: online node-weighted Steiner problems.
CoRR
Sander Borst, Marek Eliás, Moritz Venzin
2023 J jnl
Competitive Algorithms for Generalized
ACM Trans. Algorithms
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2023 A* conf
Mixing Predictions for Online Metric Algorithms.
ICML
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2023 J jnl
Mixing predictions for online metric algorithms.
CoRR
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2023 J jnl
Online Metric Algorithms with Untrusted Predictions.
ACM Trans. Algorithms
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2023 A* conf
Paging with Succinct Predictions.
ICML
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2022 J jnl
Paging with Succinct Predictions.
CoRR
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
2021 A* conf
Differentially Private Correlation Clustering.
ICML
Mark Bun, Marek Eliás, Janardhan Kulkarni
2021 J jnl
Differentially Private Correlation Clustering.
CoRR
Mark Bun, Marek Eliás, Janardhan Kulkarni
2021 A* conf
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds.
NeurIPS
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2021 J jnl
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds.
CoRR
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2020 A* conf
Differentially Private Release of Synthetic Graphs.
SODA
Marek Eliás, Michael Kapralov, Janardhan Kulkarni, Yin Tat Lee
2020 J jnl
Nested Convex Bodies are Chaseable.
Algorithmica
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2020 A* conf
Online metric algorithms with untrusted predictions.
ICML
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2020 J jnl
Online metric algorithms with untrusted predictions.
CoRR
Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon
2019 J jnl
The (
ACM Trans. Algorithms
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos
2018 A* conf
Competitive Algorithms for Generalized
SODA
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2018 A* conf
Nested Convex Bodies are Chaseable.
SODA
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2018 J jnl
Tight Bounds for Double Coverage Against Weak Adversaries.
Theory Comput. Syst.
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs
2017 J jnl
Competitive Algorithms for Generalized k-Server in Uniform Metrics.
CoRR
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2017 J jnl
Nested Convex Bodies are Chaseable.
CoRR
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2017 A* conf
The (
SODA
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos
2017 A* conf
Weighted k-Server Bounds via Combinatorial Dichotomies.
FOCS
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos
2017 J jnl
Weighted k-Server Bounds via Combinatorial Dichotomies.
CoRR
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos
2016 A* conf
Improved Approximation for Vector Bin Packing.
SODA
Nikhil Bansal, Marek Eliás, Arindam Khan
2016 J jnl
New Bounds for the $(h, k)$-Server Problem.
CoRR
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos
2015 B conf
Tight Bounds for Double Coverage Against Weak Adversaries.
WAOA
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs
2014 J jnl
Lower Bounds on Geometric Ramsey Functions.
SIAM J. Discret. Math.
Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová
2014 A* conf
Lower bounds on geometric Ramsey functions.
SoCG
Marek Eliás, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová
2012 — conf
Higher-order Erdos-Szekeres theorems.
SCG
Marek Eliás, Jirí Matousek
2011 J jnl
Higher-order Erdos-Szekeres theorems
CoRR
Marek Eliás, Jirí Matousek