Articles dans des revues avec comité de lecture (8)
1.
Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., & Langerman, S. (2023). Competitive Online Search Trees on Trees. ACM transactions on algorithms, 19(3), 1-19. doi:10.1145/35951805.
Arseneva, E., Iacono, J., Koumoutsos, G., Langerman, S., & Zolotov, B. (2020). Sublinear Explicit Incremental Planar Voronoi Diagrams. Journal of Information Processing, 28(0), 766-774. doi:10.2197/ipsjjip.28.7666.
Bansal, N., Eliáš, M., Jez, L., & Koumoutsos, G. (2019). The (H, k)-server problem on bounded depth trees. ACM transactions on algorithms, 15(2), a28. doi:10.1145/33013147.
Bansal, N., Böhm, M., Eliáš, M., Koumoutsos, G., & Umboh, S. W. (2019). Nested Convex Bodies are Chaseable. Algorithmica, 82, 1640-1653. doi:10.1007/s00453-019-00661-x8.
Bansal, N., Eliáš, M., Jez, L., Koumoutsos, G., & Pruhs, K. (2018). Tight Bounds for Double Coverage Against Weak Adversaries. Theory of Computing Systems, 62(2), 349-365. doi:10.1007/s00224-016-9703-3 Articles dans des revues sans comité de lecture (5)