Publications (Google Scholar, DBLP)

  1. Dynamic Geometric Independent Set. S. Bhore, J. Cardinal, J. Iacono, G. Koumoutsos.
    2020, Submitted.
  2. Memoryless Algorithms for the Generalized k-Server Problem on Uniform Metrics. D. Christou, D. Fotakis, G. Koumoutsos.
    WAOA 2020.
  3. The Online Min-Sum Set Cover Problem. D. Fotakis, L. Kavouras, G. Koumoutsos, S. Skoulakis, M. Vardas.
    ICALP 2020.
  4. Competitive Online Search Trees on Trees. P. Bose, J. Cardinal, J. Iacono, G. Koumoutsos, S. Langerman.
    SODA 2020.
  5. Sublinear Explicit incremental planar Voronoi diagrams. E. Arseneva, J. Iacono, G. Koumoutsos, S. Langerman, B. Zolotov.
    JCDCGGG 2019. Full version in Journal of Information Processing (JIP).
  6. External Memory Planar Point Location with Fast Updates. J. Iacono, B. Karsin, G. Koumoutsos.
    ISAAC 2019.
  7. Belga B-trees. E. Demaine, J. Iacono, G. Koumoutsos, S. Langerman.
    CSR 2019. Full version in Theory of Computing Systems (TOCS). DOI
  8. Competitive Algorithms for Generalized k-Server in Uniform Metrics. N. Bansal, M. Elias, G. Koumoutsos, J. Nederlof.
    SODA 2018.
  9. Nested Convex Bodies are Chaseable. N. Bansal, M. Bohm, M. Elias, G. Koumoutsos, S. Umboh.
    SODA 2018. Full version in Algorithmica
  10. Weighted k-Server Bounds via Combinatorial Dichotomies. N. Bansal, M. Elias, G. Koumoutsos.
    FOCS 2017. [ Talk @FOCS'17 ]
  11. The (h,k)-Server Problem on Bounded Depth Trees. N. Bansal, M. Elias, L. Jez, G. Koumoutsos.
    SODA 2017. Full version in ACM Transactions on Algorithms (TALG)
  12. Tight Bounds for Double Coverage against Weak Adversaries. N. Bansal, M. Elias, L. Jez, G. Koumoutsos, K. Pruhs.
    WAOA 2015. Full version in Theory of Computing Systems (TOCS)