Scholar

Marek Eliáš

Google Scholar ID: hX2T3SQAAAAJ

Assistant professor at Bocconi University

Homepage↗Google Scholar↗

Citations & Impact

All-time

Citations

530

H-index

i10-index

Publications

Co-authors

list available

Contact

No contact links provided.

Publications

20 items

Browse publications on Google Scholar (top-right) ↗

Resume (English only)

Academic Achievements

Paper: Learning-augmented algorithms for MTS with bandit access to multiple predictors, ICML 2025
Paper: Approximation Algorithms for Combinatorial Optimization with Predictions, ICLR 2025 (spotlight)
Paper: Stronger adversaries grow cheaper forests: online node-weighted Steiner problems, SODA 2025
Paper: Bandits with knapsacks with predictions, UAI 2024
Paper: Algorithms for Caching and MTS with reduced number of predictions, ICLR 2024
Paper: Learning-Augmented Algorithms with Explicit Predictors, NeurIPS 2024
Paper: Mixing predictions for online metric algorithms, ICML 2023
Paper: Paging with Succinct Predictions, ICML 2023
Paper: Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds, NeurIPS 2021
Paper: Differentially Private Correlation Clustering, ICML 2021
Paper: Online metric algorithms with untrusted predictions, ICML 2020
Paper: Differentially Private Release of Synthetic Graphs, SODA 2020
Paper: Nested Convex Bodies are Chaseable, Algorithmica, SODA 2018
Paper: Competitive Algorithms for Generalized k-Server in Uniform Metrics, ACM Transactions on Algorithms, SODA 2018
Paper: Weighted k-Server Bounds via Combinatorial Dichotomies, FOCS 2017
Paper: The (h,k)-Server Problem on Bounded-Depth Trees, ACM Transactions on Algorithms, SODA 2017
Paper: Improved Approximation for Vector Bin Packing, SODA 2016
Paper: Tight bounds for Double Coverage against weak adversaries, Theory of Computing Systems, WAOA 2015
Paper: Lower bounds on geometric Ramsey functions, SIAM J. Discrete Math, SoCG 2014
Paper: Higher-Order Erdős–Szekeres Theorems, Advances in Mathematics, SoCG 2012