Grigorios Koumoutsos

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 30

Top Topics

Independent Set

Top Venues

ACM Trans. Algorithms

Theory Comput. Syst.

Publications

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