Personal webpage of Marek Eliáš

I am a postdoc at EPFL in the group of Michael Kapralov.

From 2014 to September 2018, I was a PhD student at TU Eindhoven, my advisor was Nikhil Bansal.
Until 2014, I studied at Charles University in Prague and my advisor was Jiří Matoušek.


INJ 132
INJ 132
Station 14
CH-1015, Lausanne

My papers

Online metric algorithms with untrusted predictions.
with Antonios Antoniadis, Christian Coester, Adam Polak, and Bertrand Simon.

Differentially Private Release of Synthetic Graphs.
with Michael Kapralov, Janardhan Kulkarni, and Yin Tat Lee.
accepted to SODA 2020: paper, proceedings, DOI, slides
also presented at TPDP 2019: slides

Nested Convex Bodies are Chaseable.
with Nikhil Bansal, Martin Böhm, Grigorios Koumoutsos, and Seeun William Umboh.
Algorithmica: arXiv, DOI
SODA 2018: proceedings, DOI

Competitive Algorithms for Generalized k-Server in Uniform Metrics.
with Nikhil Bansal, Grigorios Koumoutsos, and Jesper Nederlof.
SODA 2018: proceedings, DOI, arXiv, slides

Weighted k-Server Bounds via Combinatorial Dichotomies.
with Nikhil Bansal and Grigorios Koumoutsos.
FOCS 2017: proceedings, arXiv

The (h,k)-Server Problem on Bounded-Depth Trees.
with Nikhil Bansal, Łukasz Jeż, and Grigorios Koumoutsos.
ACM Transactions on Algorithms: DOI, arXiv
SODA 2017: proceedings, DOI, slides

Improved Approximation for Vector Bin Packing.
with Nikhil Bansal and Arindam Khan.
SODA 2016: proceedings, DOI

Tight bounds for Double Coverage against weak adversaries.
with Nikhil Bansal, Łukasz Jeż, Grigorios Koumoutsos, and Kirk Pruhs.
Theory of Computing Systems. journal version, DOI
WAOA 2015: proceedings; submitted version (including appendix)

Lower bounds on geometric Ramsey functions.
with Jiří Matoušek, Edgardo Roldán-Pensado, and Zuzana Safernová.
SIAM J. Discrete Math: arXiv, DOI
SoCG 2014: DOI

Higher-Order Erdős–Szekeres Theorems.
with Jiří Matoušek.
Advances in Mathematics: arXiv, DOI
SoCG 2012: DOI

My papers elsewhere

Google Scholar