Articles dans des revues avec comité de lecture (167)
  1. 132. Demaine, E. D., Demaine, M. L., Langerman, A., & Langerman, S. (2006). Morpion solitaire. Theory of Computing Systems, 39(3), 439-453. doi:10.1007/s00224-005-1240-4
  2. 133. Cardinal, J., Kremer, S., & Langerman, S. (2006). Juggling with pattern matching. Theory of Computing Systems, 39(3), 425-437. doi:10.1007/s00224-005-1239-x
  3. 134. Demaine, E. D., Langerman, S., & O'Rourke, J. (2006). Geometric restrictions on producible polygonal protein chains. Algorithmica, 44(2), 167-181. doi:10.1007/s00453-005-1205-7
  4. 135. Bremner, D., Chan, T. M., Demaine, E. D., Erickson, J. J., Hurtado, F., Iacono, J., Langerman, S., & Taslakian, P. (2006). Necklaces, convolutions, and X + Y. Lecture notes in computer science, 4168, 160-171. doi:10.1007/11841036\_17
  5. 136. Douieb, K., & Langerman, S. (2006). Near-entropy hotlink assignments. Lecture notes in computer science, 4168 LNCS, 292-303.
  6. 137. Connelly, R., Demaine, E. D., Demaine, M. L., Fekete, S., Langerman, S., Mitchell, J., & Ribo, A. (2006). Locked and unlocked chains of planar shapes. Proceedings of the annual ACM Symposium on Computational Geometry, 61-70.
  7. 138. Aronov, B. B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., & Smid, M. M. (2006). Data structures for halfplane proximity queries and incremental Voronoi diagrams. Lecture notes in computer science, 3887, 80-92. doi:10.1007/11682462_12
  8. 139. Demaine, E. D., Erickson, J. J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H. H., Overmars, M. M., & Whitesides, S. S. (2005). Separating point sets in polygonal environments. International journal of Computational geometry and applications, 15(4), 403-419. doi:10.1142/S0218195905001762
  9. 140. Langerman, S., & Morin, P. P. (2005). Covering things with things. Discrete & computational geometry, 33(4), 717-729. doi:10.1007/s00454-004-1108-4
  10. 141. Bremner, D., Demaine, E. D., Erickson, J. J., Iacono, J., Langerman, S., Morin, P. P., & Toussaint, G. G. (2005). Output-sensitive algorithms for computing nearest-neighbour decision boundaries. Discrete & computational geometry, 33(4), 593-604. doi:10.1007/s00454-004-1152-0
  11. 142. Iacono, J., & Langerman, S. (2005). Queaps. Algorithmica, 42(1), 49-56. doi:10.1007/s00453-004-1139-5
  12. 143. Cardinal, J., & Langerman, S. (2005). Designing small keyboards is hard. Theoretical computer science, 332(1-3), 405-415. doi:10.1016/j.tcs.2004.12.004
    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 >>