Grigorios Koumoutsos

According to our database, Grigorios Koumoutsos authored at least 16 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Competitive Online Search Trees on Trees.

Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman

ACM Trans. Algorithms, July, 2023

Competitive Algorithms for Generalized <i>k</i>-Server in Uniform Metrics.

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof

ACM Trans. Algorithms, January, 2023

2021

Belga B-Trees.

Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman

Theory Comput. Syst., 2021

Worst-Case Efficient Dynamic Geometric Independent Set.

Jean Cardinal, John Iacono, Grigorios Koumoutsos

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Sublinear Explicit Incremental Planar Voronoi Diagrams.

Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov

J. Inf. Process., 2020

Dynamic Geometric Independent Set.

Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos

CoRR, 2020

Nested Convex Bodies are Chaseable.

Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh

Algorithmica, 2020

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics.

Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

The Online Min-Sum Set Cover Problem.

Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

The (<i>h, k</i>)-Server Problem on Bounded Depth Trees.

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos

ACM Trans. Algorithms, 2019

External Memory Planar Point Location with Fast Updates.

John Iacono, Ben Karsin, Grigorios Koumoutsos

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Tight Bounds for Double Coverage Against Weak Adversaries.

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs

Theory Comput. Syst., 2018

2017

Competitive Algorithms for Generalized k-Server in Uniform Metrics.

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof

CoRR, 2017

The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees.

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Weighted k-Server Bounds via Combinatorial Dichotomies.

Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

New Bounds for the $(h, k)$-Server Problem.

Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos

CoRR, 2016