Grigorios Koumoutsos

30 papers A* 6A 1B 3Misc 1Journal 19
YearRankTypeTitle / Venue / Authors
2023 J jnl
Competitive Algorithms for Generalized
ACM Trans. Algorithms
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2023 J jnl
Competitive Online Search Trees on Trees.
ACM Trans. Algorithms
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2021 J jnl
Belga B-Trees.
Theory Comput. Syst.
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2021 A conf
Worst-Case Efficient Dynamic Geometric Independent Set.
ESA
Jean Cardinal, John Iacono, Grigorios Koumoutsos
2021 J jnl
Worst-Case Efficient Dynamic Geometric Independent Set.
CoRR
Jean Cardinal, John Iacono, Grigorios Koumoutsos
2020 A* conf
Competitive Online Search Trees on Trees.
SODA
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2020 J jnl
Dynamic Geometric Independent Set.
CoRR
Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos
2020 B conf
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics.
WAOA
Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos
2020 J jnl
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics.
CoRR
Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos
2020 J jnl
Nested Convex Bodies are Chaseable.
Algorithmica
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2020 J jnl
Sublinear Explicit Incremental Planar Voronoi Diagrams.
CoRR
Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov
2020 J jnl
Sublinear Explicit Incremental Planar Voronoi Diagrams.
J. Inf. Process.
Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov
2020 A* conf
The Online Min-Sum Set Cover Problem.
ICALP
Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas
2020 J jnl
The Online Min-Sum Set Cover Problem.
CoRR
Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas
2019 Misc conf
Belga B-Trees.
CSR
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019 J jnl
Belga B-trees.
CoRR
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019 J jnl
Competitive Online Search Trees on Trees.
CoRR
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019 B conf
External Memory Planar Point Location with Fast Updates.
ISAAC
John Iacono, Ben Karsin, Grigorios Koumoutsos
2019 J jnl
External Memory Planar Point Location with Fast Updates.
CoRR
John Iacono, Ben Karsin, Grigorios Koumoutsos
2019 J jnl
The (
ACM Trans. Algorithms
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos
2018 A* conf
Competitive Algorithms for Generalized
SODA
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2018 A* conf
Nested Convex Bodies are Chaseable.
SODA
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2018 J jnl
Tight Bounds for Double Coverage Against Weak Adversaries.
Theory Comput. Syst.
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs
2017 J jnl
Competitive Algorithms for Generalized k-Server in Uniform Metrics.
CoRR
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof
2017 J jnl
Nested Convex Bodies are Chaseable.
CoRR
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2017 A* conf
The (
SODA
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos
2017 A* conf
Weighted k-Server Bounds via Combinatorial Dichotomies.
FOCS
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos
2017 J jnl
Weighted k-Server Bounds via Combinatorial Dichotomies.
CoRR
Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos
2016 J jnl
New Bounds for the $(h, k)$-Server Problem.
CoRR
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos
2015 B conf
Tight Bounds for Double Coverage Against Weak Adversaries.
WAOA
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs