Articles dans des revues avec comité de lecture (167)
  1. 156. 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. 157. Langerman, S., & Steiger, W. W. (2003). The complexity of hyperplane depth in the plane. Discrete & computational geometry, 30(2), 299-309.
  3. 158. Aloupis, G., Langerman, S., Soss, M. M., & Toussaint, G. G. (2003). Algorithms for bivariate medians and a fermat-torricelli problem for lines. Computational geometry, 26(1), 69-79.
  4. 159. Bose, P., Krizanc, D. D., Langerman, S., & Morin, P. P. (2003). Asymmetric communication protocols via hotlink assignments. Theory of Computing Systems, 36(6), 655-661.
  5. 160. Demaine, E. D., Langerman, S., O'Rourke, J., & Snoeyink, J. (2003). Interlocked open and closed linkages with few joints. Computational geometry, 26(1), 37-45.
  6. 161. Langerman, S., & Steiger, W. W. (2003). Optimization in arrangements. Lecture notes in computer science, 2607, 50-61.
  7. 162. Iacono, J., & Langerman, S. (2002). Queaps. Lecture notes in computer science, 2518, 211-218.
  8. 163. Aloupis, G., Demaine, E. D., Dujmović, V. V., Erickson, J. J., Langerman, S., Meijer, H. H., O'Rourke, J., Overmars, M. M., Soss, M. M., Streinu, I. I., & Toussaint, G. G. (2002). Flat-state connectivity of linkages under dihedral motions. Lecture notes in computer science, 2518, 369-380.
  9. 164. Langerman, S., & Morin, P. P. (2002). Covering things with things. Lecture notes in computer science, 2461, 662-673.
  10. 165. Langerman, S., Morin, P. P., & Soss, M. M. (2001). Computing the maximum detour and spanning ratio of planar chains, trees and cycles. Lecture notes in computer science, 2285, 250-261.
  11. 166. Langerman, S., Lodha, S., & Shah, R. (2001). Algorithms for efficient filtering in content-based multicast. Lecture notes in computer science, 2161, 428-439.
  12. 167. Iacono, J., & Langerman, S. (2000). Volume queries in polyhedra. Lecture notes in computer science, 2098, 156-159.
    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 >>