Publications (Google Scholar, DBLP)

Competitive Online Search Trees on Trees
P. Bose, J. Cardinal, J. Iacono, G. Koumoutsos, S. Langerman
SODA 2020

External Memory Planar Point Location with Fast Updates
J. Iacono, B. Karsin, G. Koumoutsos
ISAAC 2019

Belga B-trees
E. Demaine, J. Iacono, G. Koumoutsos, S. Langerman.
CSR 2019.
Invited to Theory of Computing Systems (TOCS) special issue.

Competitive Algorithms for Generalized k-Server in Uniform Metrics
N. Bansal, M. Elias, G. Koumoutsos, J. Nederlof.
SODA 2018.

Nested Convex Bodies are Chaseable
N. Bansal, M. Bohm, M. Elias, G. Koumoutsos, S. Umboh.
SODA 2018.
Full version in Algorithmica (in press)

Weighted k-Server Bounds via Combinatorial Dichotomies
N. Bansal, M. Elias, G. Koumoutsos.
FOCS 2017. [ Talk @FOCS'17 ]

The (h,k)-Server Problem on Bounded Depth Trees
N. Bansal, M. Elias, L. Jez, G. Koumoutsos.
SODA 2017.
Full version in ACM Transactions on Algorithms (TALG)

Tight Bounds for Double Coverage against Weak Adversaries.
N. Bansal, M. Elias, L. Jez, G. Koumoutsos, K. Pruhs.
WAOA 2015.
Full version in Theory of Computing Systems (TOCS)