Communications publiées lors de congrès ou colloques nationaux et internationaux (81)
  1. 67. Bose, P., Demaine, E. D., Iacono, J., & Langerman, S. (2002). Quartering a square optimally. Proceedings of the Japan Conference on Discrete and Computational Geometry (pp. 5-6).
  2. 68. Demaine, E. D., Iacono, J., & Langerman, S. (2002). Proximate point searching.
  3. 69. Iacono, J., & Langerman, S. (2002). Queaps. In Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings: Vol. 2518 (pp. 211-218). (Lecture Notes in Computer Science). Springer. doi:10.1007/3-540-36136-7_19
  4. 70. Demaine, E. D., Langerman, S., & O'Rourke, J. (2001). Short interlocked linkages. Proceedings of the 13th Canadian Conference on Computational Geometry (pp. 69-72) Canadian Conference on Computational Geometry(13).
  5. 71. Aloupis, G., Langerman, S., Soss, M. M., & Toussaint, G. G. (2001). Algorithms for bivariate medians and a fermat-torricelli problem for lines. Proceedings of the 13th Canadian Conference on Computational Geometry (pp. 21-24) Canadian Conference on Computational Geometry(13).
  6. 72. Langerman, S., & Steiger, W. W. (2001). Computing a high depth point in the plane. In Developments in Robust Statistics. International Conference on Robust Statistics 2001 (pp. 228-234) Physica-Verlag.
  7. 73. Langerman, S. (2001). On the complexity of halfspace area queries. Proceedings of the 2001 ACM Symposium on Computational Geometry (pp. 207-211).
  8. 74. Iacono, J., & Langerman, S. (2000). Dynamic point location in fat hyperrectangles with integer coordinates. Proceedings of the 12th Canadian Conference on Computational Geometry (pp. 181-186) Canadian Conference on Computational Geometry(12).
  9. 75. Langerman, S., & Steiger, W. W. (2000). Computing a maximal depth point in the plane. Proceedings of the Japan Conference on Discrete and Computational Geometry (pp. 46-47) Japan Conference on Discrete and Computational Geometry.
  10. 76. Langerman, S. (2000). On the shooter location problem: maintaining dynamic circular-arc graphs. Proceed- ings of the 12th Canadian Conference on Computational Geometry (pp. 29-36) Canadian Conference on Computational Geometry(12).
  11. 77. Langerman, S., & Steiger, W. W. (2000). An optimal algorithm for hyperplane depth in the plane. Proceedings of the ACM-SIAM Symposium On Discrete Algorithms (pp. 54-59).
  12. 78. Iacono, J., & Langerman, S. (2000). Volume Queries in Polyhedra. In Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers: Vol. 2098 (pp. 156-159). (Lecture Notes in Computer Science). Springer. doi:10.1007/3-540-47738-1_13
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Suivant >>