Articles dans des revues avec comité de lecture (109)
  1. 1. Akitaya, H. A., Biniaz, A., De Carufel, J. L., Iacono, J., Smid, M. M., Theocharous, L., Aloupis, G., Bose, P., Gavoille, C., Kleist, L., & Souvaine, D. D. (2025). An Improved Bound for Plane Covering Paths. Leibniz international proceedings in informatics, 351, 75. doi:10.4230/LIPIcs.ESA.2025.75
  2. 2. Brodal, G. S., Iacono, J., Meyer, U., Sitchinava, N., Goodrich, M. M., Lo, J., Pagan, V., & Svenning, R. (2025). External-Memory Priority Queues with Optimal Insertions. Leibniz international proceedings in informatics, 351, 5. doi:10.4230/LIPIcs.ESA.2025.5
  3. 3. Biniaz, A., Bose, P., Chung, C., De Carufel, J. L., Iacono, J., Maheshwari, A., Odak, S., Smid, M. M., & Tóth, C. D. (2025). Tight Bounds on the Number of Closest Pairs in Vertical Slabs. Leibniz international proceedings in informatics, 349, 8. doi:10.4230/LIPIcs.WADS.2025.8
  4. 4. Iacono, J., & Nekrich, Y. (2025). Incremental Planar Nearest Neighbor Queries with Optimal Query Time. Leibniz international proceedings in informatics, 332, 59. doi:10.4230/LIPIcs.SoCG.2025.59
  5. 5. Dallant, J., & Iacono, J. (2025). Conditional Lower Bounds for Dynamic Geometric Measure Problems. ACM transactions on algorithms, 21(2), 23. doi:10.1145/3727878
  6. 6. Iacono, J., & Micek, P. (2024). Vertex Ranking of Degenerate Graphs. arXiv.org, abs/2404.16340. doi:10.48550/ARXIV.2404.16340
  7. 7. Haeupler, B., Hlad'ik, R., Iacono, J., Rozhon, V., Tarjan, R., & Tetek, J. (2024). Fast and Simple Sorting Using Partial Information. arXiv.org, abs/2404.04552. doi:10.48550/ARXIV.2404.04552
  8. 8. Dallant, J., & Iacono, J. (2024). How fast can we play Tetris greedily with rectangular pieces? Theoretical computer science, 992, 114405. doi:10.1016/j.tcs.2024.114405
  9. 9. Aloupis, G., Iacono, J., Langerman, S., "Ozkan, "., & Wuhrer, S. S. (2024). The Complexity of Order Type Isomorphism. Discrete & computational geometry, 72(2), 483-502. doi:10.1007/S00454-024-00687-1
  10. 10. Chida, K., Demaine, E., Demaine, M. L., Eppstein, D., Hesterberg, A., Horiyama, T., Iacono, J., Ito, H., Langerman, S., Uehara, R., & Uno, Y. (2023). Multifold Tiles of Polyominoes and Convex Lattice Polygons. Thai Journal of Mathematics, 21(4), 957–978.
  11. 11. 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/3595180
  12. 12. Aronov, B. B., Cardinal, J., Dallant, J., & Iacono, J. (2023). A General Technique for Searching in Implicit Sets via Function Inversion. arXiv.org, abs/2311.12471. doi:10.48550/ARXIV.2311.12471
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Suivant >>