New Bounds for the $(h, k)$-Server Problem. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (CoRR, 2016)

Weighted k-Server Bounds via Combinatorial Dichotomies. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos (FOCS, 2017)

The (h, k)-Server Problem on Bounded Depth Trees. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (SODA, 2017)

Competitive Algorithms for Generalized k-Server in Uniform Metrics. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos; Jesper Nederlof (CoRR, 2017)

Tight Bounds for Double Coverage Against Weak Adversaries. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos; Kirk Pruhs (Theory Comput. Syst., 2018)

External Memory Planar Point Location with Fast Updates. - John Iacono; Ben Karsin; Grigorios Koumoutsos (ISAAC, 2019)

The (h, k)-Server Problem on Bounded Depth Trees. - Nikhil Bansal 001; Marek Eliás 001; Lukasz Jez; Grigorios Koumoutsos (ACM Trans. Algorithms, 2019)

The Online Min-Sum Set Cover Problem. - Dimitris Fotakis 001; Loukas Kavouras; Grigorios Koumoutsos; Stratis Skoulakis; Manolis Vardas (ICALP, 2020)

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. - Dimitris Christou; Dimitris Fotakis 001; Grigorios Koumoutsos (WAOA, 2020)

Nested Convex Bodies are Chaseable. - Nikhil Bansal 001; Martin Böhm 001; Marek Eliás 001; Grigorios Koumoutsos; Seeun William Umboh (Algorithmica, 2020)

Dynamic Geometric Independent Set. - Sujoy Bhore; Jean Cardinal; John Iacono; Grigorios Koumoutsos (CoRR, 2020)

Sublinear Explicit Incremental Planar Voronoi Diagrams. - Elena Arseneva; John Iacono; Grigorios Koumoutsos; Stefan Langerman; Boris Zolotov (J. Inf. Process., 2020)

Worst-Case Efficient Dynamic Geometric Independent Set. - Jean Cardinal; John Iacono; Grigorios Koumoutsos (ESA, 2021)

Belga B-Trees. - Erik D. Demaine; John Iacono; Grigorios Koumoutsos; Stefan Langerman (Theory Comput. Syst., 2021)

Competitive Algorithms for Generalized k-Server in Uniform Metrics. - Nikhil Bansal 001; Marek Eliás 001; Grigorios Koumoutsos; Jesper Nederlof (ACM Trans. Algorithms, 2023)

Competitive Online Search Trees on Trees. - Prosenjit Bose; Jean Cardinal; John Iacono; Grigorios Koumoutsos; Stefan Langerman (ACM Trans. Algorithms, 2023)