Articles dans des revues avec comité de lecture (99)
  1. 1. 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.
  2. 2. 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
  3. 3. 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
  4. 4. 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
  5. 5. 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
  6. 6. Aronov, B. B., de Berg, M., Cardinal, J., Ezra, E., Iacono, J., & Sharir, M. M. (2021). Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. Leibniz international proceedings in informatics, 212, 3. doi:10.4230/LIPIcs.ISAAC.2021.3
  7. 7. Cardinal, J., Iacono, J., & Koumoutsos, G. (2021). Worst-case efficient dynamic geometric independent set. Leibniz international proceedings in informatics, 204, 25. doi:10.4230/LIPIcs.ESA.2021.25
  8. 8. Bose, P., Cano Vila, M. D. P., Fagerberg, R., Iacono, J., Jacob, R., & Langerman, S. (2021). Fragile Complexity of Adaptive Algorithms. Lecture notes in computer science, 12701, 144-157. doi:10.1007/978-3-030-75242-2_10
  9. 9. Bose, P., Cano, P., Fagerberg, R., Iacono, J., Jacob, R., & Langerman, S. (2021). Fragile Complexity of Adaptive Algorithms. Lecture notes in computer science, 12701 LNCS, 144-157. doi:10.1007/978-3-030-75242-2_10
  10. 10. Brodal, G. S., Iacono, J., Nebel, M. E., & Ramachandran, V. (2021). Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl seminar proceedings, 11(1), 1-23. doi:10.4230/DagRep.11.1.1
  11. 11. Damian, M., Iacono, J., & Winslow, A. (2020). Spanning Properties of Theta–Theta-6. Graphs and combinatorics. doi:10.1007/s00373-020-02135-2
  12. 12. Demaine, E., Iacono, J., Koumoutsos, G., & Langerman, S. (2020). Belga B-Trees. Theory of Computing Systems. doi:10.1007/s00224-020-09991-8
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>