Grigorios Koumoutsos

Orcid: 0000-0002-4928-103X

According to our database1, Grigorios Koumoutsos authored at least 16 papers between 2015 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Worst-Case Efficient Dynamic Geometric Independent Set.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Sublinear Explicit Incremental Planar Voronoi Diagrams.
J. Inf. Process., 2020

Dynamic Geometric Independent Set.
CoRR, 2020

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics.
Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Competitive Online Search Trees on Trees.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

The Online Min-Sum Set Cover Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

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

External Memory Planar Point Location with Fast Updates.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Belga B-Trees.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
Nested Convex Bodies are Chaseable.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Competitive Algorithms for Generalized <i>k</i>-Server in Uniform Metrics.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Competitive Algorithms for Generalized k-Server in Uniform Metrics.
CoRR, 2017

The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Weighted k-Server Bounds via Combinatorial Dichotomies.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

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

2015
Tight Bounds for Double Coverage Against Weak Adversaries.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015


  Loading...