To edit, sign in as greg.koumoutsos@gmail.com.
Grigorios Koumoutsos
Grigorios Koumoutsos
Postdoctoral Researcher, Université libre de Bruxelles
Verified email at ulb.ac.be - Homepage
Title
Cited by
Cited by
Year
Nested convex bodies are chaseable
N Bansa, M Böhm, M Eliáš, G Koumoutsos, SW Umboh
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
232018
The (h,k)-Server Problem on Bounded Depth Trees
N Bansal, M Eliéš, Ł Jeż, G Koumoutsos
ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019
142019
Competitive Algorithms for Generalized k-Server in Uniform Metrics
N Bansa, M Eliáš, G Koumoutsos, J Nederlof
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
132018
Weighted k-server bounds via combinatorial dichotomies
N Bansal, M Eliáš, G Koumoutsos
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
132017
Tight bounds for double coverage against weak adversaries
N Bansal, M Eliáš, Ł Jeż, G Koumoutsos, K Pruhs
Theory of Computing Systems 62 (2), 349-365, 2018
122018
Competitive online search trees on trees
P Bose, J Cardinal, J Iacono, G Koumoutsos, S Langerman
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
82020
The online min-sum set cover problem
D Fotakis, L Kavouras, G Koumoutsos, S Skoulakis, M Vardas
arXiv preprint arXiv:2003.02161, 2020
42020
Dynamic Geometric Independent Set
S Bhore, J Cardinal, J Iacono, G Koumoutsos
arXiv preprint arXiv:2007.08643, 2020
32020
Worst-case efficient dynamic geometric independent set
J Cardinal, J Iacono, G Koumoutsos
arXiv preprint arXiv:2108.08050, 2021
22021
Sublinear Explicit Incremental Planar Voronoi Diagrams
E Arseneva, J Iacono, G Koumoutsos, S Langerman, B Zolotov
Journal of Information Processing 28, 766-774, 2020
22020
Belga B-trees
ED Demaine, J Iacono, G Koumoutsos, S Langerman
Theory of Computing Systems 65 (3), 541-558, 2021
12021
Algorithms for k-server problems
G Koumoutsos
Technische Universiteit Eindhoven, 2018
12018
Online algorithms with advice for the binary search tree problem
G Koumoutsos
Master’s thesis, LIAFA, 2013
12013
Memoryless Algorithms for the Generalized -server Problem on Uniform Metrics
D Christou, D Fotakis, G Koumoutsos
arXiv preprint arXiv:2007.08669, 2020
2020
Sublinear Explicit Incremental Planar Voro Sublinear Explicit Incremental Planar Voronoi Diagrams noi Diagrams
E Arseneva, J Iacono, G Koumoutsos, S Langerman, B Zolotov
arXiv. org, 2020
2020
Competitive Online Search Trees on Trees
J Cardinal, J Iacono, G Koumoutsos, S Langerman, P Bose
2020
External Memory Planar Point Location with Fast Updates
J Iacono, B Karsin, G Koumoutsos
arXiv preprint arXiv:1905.02620, 2019
2019
k-Server problems
G Koumoutsos
2018
New Bounds for the (h,k)-Server Problem.
N Bansal, M Eliás, L Jez, G Koumoutsos
CoRR, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–19