Articles dans des revues avec comité de lecture (99)
50.
Bose, P., Dujmović, V. V., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Sacristán, V., Saumell Mendiola, M., & Wood, D. (2012). Proximity graphs: E, δ, Δ, χ and ω. International journal of Computational geometry and applications, 22(5), 439-469. doi:10.1142/S021819591250011253.
Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. P. (2012). Entropy, triangulation, and point location in planar subdivisions. ACM transactions on algorithms, 8(3), 29. doi:10.1145/2229163.222917354.
Aloupis, G., Demaine, E. D., Demaine, M. L., Dujmović, V. V., & Iacono, J. (2012). Meshes preserving minimum feature size. Lecture notes in computer science, 7579 LNCS, 258-273. doi:10.1007/978-3-642-34191-5_2556.
Bender, M., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J., & L'opez-Ortiz, A. (2011). The Cost of Cache-Oblivious Searching. Algorithmica, 61(2), 463-505. doi:10.1007/s00453-010-9394-057.
Demaine, E. D., Demaine, M. L., Hart, V., Iacono, J., Langerman, S., & O'Rourke, J. (2011). Continuous blooming of convex polyhedra. Graphs and combinatorics, 27(3), 363-376. doi:10.1007/s00373-011-1024-358.
Aloupis, G., Collette, S., Langerman, S., Bose, P., Douieb, K., Dujmović, V. V., Morin, P. P., Demaine, E. D., Demaine, M. L., & Iacono, J. (2011). Common unfoldings of polyominoes and polycubes. Lecture notes in computer science, 7033 LNCS, 44-54. doi:10.1007/978-3-642-24983-9_559.
Golin, M., Iacono, J., Krizanc, D. D., Raman, R., & Rao, S. S. (2011). Encoding 2D range maximum queries. Lecture notes in computer science, 7074, 180-189. doi:10.1007/978-3-642-25591-5_20