Articles dans des revues sans comité de lecture (47)
44.
Demaine, E. D., Demaine, M. L., Hart, V., Iacono, J., Langerman, S., & O'Rourke, J. (2009). Continuous Blooming of Convex Polyhedra. arXiv.org.47.
Aronov, B. B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., & Smid, M. M. (2005). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. arXiv.org. Communications publiées lors de congrès ou colloques nationaux et internationaux (49)
2.
Aronov, B. B., Cardinal, J., Dallant, J., & Iacono, J. (2024). A General Technique for Searching in Implicit Sets via Function Inversion. In 2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024 2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024 (pp. 215-223) SIAM. doi:10.1137/1.9781611977936.203.
Collette, S., & Iacono, J. (2024). Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024 Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024 (pp. 2657-2678) SIAM. doi:10.1137/1.9781611977912.95