Articles dans des revues avec comité de lecture (99)
  1. 61. Elmasry, A., Farzan, A., & Iacono, J. (2011). A unifying property for distribution-sensitive priority queues. Lecture notes in computer science, 7056 LNCS, 209-222. doi:10.1007/978-3-642-25011-8_17
  2. 62. Demaine, E. D., Iacono, J., & Langerman, S. (2010). Grid vertex-unfolding orthostacks. International journal of Computational geometry and applications, 20(3), 245-254. doi:10.1142/S0218195910003281
  3. 63. Chen, D., Devillers, O., Iacono, J., Langerman, S., & Morin, P. (2010). Oja medians and centers of gravity. Proceedings of the annual ACM Symposium on Computational Geometry, 147-150.
  4. 64. Ballinger, B., Benbernou, N., Bose, P., Damian, M., Demaine, E. D., Dujmović, V. V., Flatland, R. R., Hurtado, F., Iacono, J., Lubiw, A., Morin, P. P., Sacristán, V., Souvaine, D., & Uehara, R. (2010). Coverage with k-transmitters in the presence of obstacles. Lecture notes in computer science, 6509, 1-15. doi:10.1007/978-3-642-17461-2_1
  5. 65. Iacono, J. (2010). Editorial. Computational geometry, 43(1), 1. doi:10.1016/j.comgeo.2009.03.003
  6. 66. Brodnik, A., & Iacono, J. (2010). Unit-time predecessor queries on massive data sets. Lecture notes in computer science, 6506, 133-144. doi:10.1007/978-3-642-17517-6_14
  7. 67. Iacono, J., & Özkan, Ö. (2010). Mergeable dictionaries. Lecture notes in computer science, 6198, 164-175. doi:10.1007/978-3-642-14165-2_15
  8. 68. Brodal, G. S., Demaine, E. D., Fineman, J. J., Iacono, J., Langerman, S., & Munro, J. I. (2010). Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 1448-1456. doi:10.1137/1.9781611973075.117
  9. 69. Iacono, J., & Özkan, Ö. (2010). Mergeable dictionaries. Dagstuhl seminar proceedings, 10091.
  10. 70. Demaine, E. D., Demaine, M. L., Iacono, J., & Langerman, S. (2009). Wrapping spheres with flat paper. Computational geometry, 42(8), 748-757. doi:10.1016/j.comgeo.2008.10.006
  11. 71. Demaine, E. D., Harmon, D., Iacono, J., Kane, D. D., & Pǎtraşcu, M. (2009). The geometry of binary search trees. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 496-505. doi:10.1137/1.9781611973068.55
  12. 72. El-Khechen, D., Dulieu, M., Iacono, J., & Van Omme, N. (2009). Packing 2 × 2 unit squares into grid polygons is NP-complete. Proceedings of the annual ACM Symposium on Computational Geometry, 33-36.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>