Articles dans des revues avec comité de lecture (99)
  1. 97. Bremner, D., Demaine, E. D., Erickson, J. J., Iacono, J., Langerman, S., Morin, P. P., & Toussaint, G. G. (2003). Output-sensitive algorithms for computing nearest-neighbour decision boundaries. Lecture notes in computer science, 2748, 451-461.
  2. 98. Iacono, J., & Langerman, S. (2002). Queaps. Lecture notes in computer science, 2518, 211-218.
  3. 99. Iacono, J., & Langerman, S. (2000). Volume queries in polyhedra. Lecture notes in computer science, 2098, 156-159.
    4.   Articles dans des revues sans comité de lecture (47)
  4. 1. Das, R., Iacono, J., & Nekrich, Y. (2022). External-memory dictionaries with worst-case update cost. arXiv.org, abs/2211.06044.
  5. 2. Dallant, J., & Iacono, J. (2022). How Fast Can We Play Tetris Greedily With Rectangular Pieces? arXiv.org., abs/2202/10771.
  6. 3. Cardinal, J., Dallant, J., & Iacono, J. (2021). An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. arXiv.org.
  7. 4. Bose, P., Cano Vila, M. D. P., Fagerberg, R., Iacono, J., Jacob, R., & Langerman, S. (2021). Fragile Complexity of Adaptive Algorithms. arXiv.org.
  8. 5. Cardinal, J., Dallant, J., & Iacono, J. (2021). Approximability of (Simultaneous) Class Cover for Boxes. arXiv.org, abs/2106.12969.
  9. 6. Dallant, J., & Iacono, J. (2021). Conditional Lower Bounds for Dynamic Geometric Measure Problems. arXiv.org, abs/2112.10095.
  10. 7. Arseneva, E., Bahoo, Y., Biniaz, A., Cano Vila, M. D. P., Chanchary, F., Iacono, J., Jain, K., Lubiw, A., Mondal, D., Sheikhan, K., & Tóth, C. C. (2020). Compatible Paths on Labelled Point Sets. arXiv.org.
  11. 8. Arseneva, E., Iacono, J., Koumoutsos, G., Langerman, S., & Zolotov, B. (2020). Sublinear Explicit Incremental Planar Voro Sublinear Explicit Incremental Planar Voronoi Diagrams noi Diagrams. arXiv.org.
  12. 9. Bhore, S. K., Cardinal, J., Iacono, J., & Koumoutsos, G. (2020). Dynamic Geometric Independent Set. arXiv.org.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>