Articles dans des revues avec comité de lecture (104)
  1. 1. Iacono, J., & Micek, P. (2024). Vertex Ranking of Degenerate Graphs. arXiv.org, abs/2404.16340. doi:10.48550/ARXIV.2404.16340
  2. 2. 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
  3. 3. 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
  4. 4. 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
  5. 5. 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.
  6. 6. 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
  7. 7. 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
  8. 8. Collette, S., & Iacono, J. (2023). Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. arXiv.org, abs/2312.04235. doi:10.48550/ARXIV.2312.04235
  9. 9. Aronov, B. B., de Berg, M., Cardinal, J., Ezra, E., Iacono, J., & Sharir, M. M. (2023). Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Computational geometry, 109, 101945. doi:10.1016/j.comgeo.2022.101945
  10. 10. Das, R., Iacono, J., & Nekrich, Y. (2022). External-Memory Dictionaries with Worst-Case Update Cost. Leibniz international proceedings in informatics, 248, 21. doi:10.4230/LIPIcs.ISAAC.2022.21
  11. 11. Dallant, J., & Iacono, J. (2022). Conditional Lower Bounds for Dynamic Geometric Measure Problems. Leibniz international proceedings in informatics, 244. doi:10.4230/LIPIcs.ESA.2022.39
  12. 12. Bose, P., Cano, P., Fagerberg, R., Iacono, J., Jacob, R., & Langerman, S. (2022). Fragile complexity of adaptive algorithms. Theoretical computer science, 919, 92-102. doi:10.1016/j.tcs.2022.03.034
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Suivant >>