Postbus 513
5600 MB EINDHOVEN
I am a PhD student at TU Eindhoven, my advisor is
Nikhil Bansal.
Nikhil Bansal,
Martin Böhm,
M.E.,
Grigorios Koumoutsos,
Seeun William Umboh.
Nested Convex Bodies are Chaseable.
accepted to SODA 2018: arXiv
Nikhil Bansal, M.E.,
Grigorios Koumoutsos,
Jesper Nederlof.
Competitive Algorithms for Generalized k-Server in Uniform Metrics.
accepted to SODA 2018: arXiv
Nikhil Bansal, M.E.,
Grigorios Koumoutsos.
Weighted k-Server Bounds via Combinatorial Dichotomies.
Accepted to FOCS 2017: arXiv
Nikhil Bansal, M.E.,
Łukasz Jeż, and
Grigorios Koumoutsos.
The (h,k)-Server Problem on Bounded-Depth Trees.
Appeared in SODA 2017:
proceedings,
DOI,
slides,
arXiv
Nikhil Bansal, M.E., Arindam Khan.
Improved Approximation for Vector Bin Packing.
Appeared in SODA 2016:
proceedings,
DOI
Nikhil Bansal, M.E., Łukasz Jeż,
Grigorios Koumoutsos,
Kirk Pruhs.
Tight bounds for Double Coverage against weak adversaries.
Theory of Computing Systems.
journal version
(in press)
Extended abstract appeared in WAOA 2015:
proceedings;
submitted version (including appendix)
M.E., Jiří Matoušek, Edgardo Roldán-Pensado, Zuzana Safernová.
Lower bounds on geometric Ramsey functions.
SIAM J. Discrete Math:
ArXiv,
DOI
Extended abstract appeared in SoCG 2014:
DOI
M.E., Jiří Matoušek.
Higher-Order Erdős–Szekeres Theorems.
Advances in Mathematics:
ArXiv,
DOI
Extended abstract appeared in SoCG 2012:
DOI
Until 2014, I studied at Charles University in Prague.
old webpage: http://kam.mff.cuni.cz/~elias/index.html