Articles dans des revues avec comité de lecture (167)
  1. 120. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., & Smorodinsky, S. S. (2008). Coloring geometric range spaces. Lecture notes in computer science, 4957 LNCS, 146-157. doi:10.1007/978-3-540-78773-0_13
  2. 121. Cardinal, J., Collette, S., & Langerman, S. (2008). Local properties of geometric graphs. Computational geometry, 39(1), 55-64. doi:10.1016/j.comgeo.2007.05.011
  3. 122. Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. (2008). Distribution-sensitive point location in convex subdivisions. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 912-921.
  4. 123. Colannino, J. J., Bouillon, F., Hurtado, F., Langerman, S., Meijer, H. H., Ramaswami, S. S., Souvaine, D. D., & Toussaint, G. G. (2007). Efficient many-To-many point matching in one dimension. Graphs and combinatorics, 23(SUPPL. 1), 169-178. doi:10.1007/s00373-007-0714-3
  5. 124. Demaine, E. D., Iacono, J., & Langerman, S. (2007). Retroactive data structures. ACM transactions on algorithms, 3(2), 1240236. doi:10.1145/1240233.1240236
  6. 125. Bose, P., Demaine, E. D., Hurtado, F., Iacono, J., Langerman, S., & Morin, P. (2007). Geodesic Ham-Sandwich Cuts. Discrete & computational geometry, 37(3), 325-339. doi:10.1007/s00454-006-1287-2
  7. 126. Aloupis, G., Collette, S., Bouillon, F., Demaine, E. D., Flatland, R. R., Langerman, S., O'Rourke, J., Ramaswami, S. S., Sacristán, V., & Wuhrer, S. S. (2007). Linear reconfiguration of cube-style modular robots. Lecture notes in computer science, 4835 LNCS, 208-219.
  8. 127. Cardinal, J., Langerman, S., & Levy, E. (2007). Improved approximation bounds for edge dominating set in dense graphs. Lecture notes in computer science, 4368 LNCS, 108-120.
  9. 128. Aloupis, G., Cardinal, J., Collette, S., & Langerman, S. (2007). LUMINES strategies. Lecture notes in computer science, 4630, 190-199. doi:10.1007/978-3-540-75538-8_17
  10. 129. Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Langerman, S., Newman, I., & Weimann, O. (2007). The stackelberg minimum spanning tree game. Lecture notes in computer science, 4619, 64-76. doi:10.1007/978-3-540-73951-7_7
  11. 130. Louchard, G., Cardinal, J., & Langerman, S. (2007). Random Optimization: a Probabilistic Analysis. Discrete mathematics and theoretical computer science, 57-78.
  12. 131. Aloupis, G., Fevens, T. T., Langerman, S., Matsui, T. T., Mesa, A. A., Nuñez, Y. Y., Rappaport, D. D., & Toussaint, G. G. (2006). Algorithms for computing geometric measures of melodic similarity. Computer music journal, 30(3), 67-76. doi:10.1162/comj.2006.30.3.67
    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 >>