Articles dans des revues avec comité de lecture (167)

144. Douieb, K., & Langerman, S. (2005). Dynamic hotlinks. Lecture notes in computer science, 3608, 182-194.
145. Demaine, E. D., Iacono, J., & Langerman, S. (2005). Grid vertex-unfolding orthostacks. Lecture notes in computer science, 3742 LNCS, 76-82. doi:10.1007/11589440_8
146. Demaine, E. D., & Langerman, S. (2005). Optimizing a 2D function satisfying unimodality properties. Lecture notes in computer science, 3669, 887-898.
147. Cardinal, J., Labbé, M., Langerman, S., Levy, E., & Melot, H. (2005). A tight analysis of the maximal matching heuristic. Lecture notes in computer science, 3595, 701-709.
148. Demaine, E. D., Iacono, J., & Langerman, S. (2004). Proximate point searching. Computational geometry, 28(1), 29-40. doi:10.1016/j.comgeo.2004.01.005
149. Demaine, E. D., Iacono, J., & Langerman, S. (2004). Retroactive Data Structures. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 15, 274-283.
150. Cardinal, J., & Langerman, S. (2004). Designing small keyboards is hard. Lecture notes in computer science, 2976, 391-400.
151. Aloupis, G., Demaine, E. D., Langerman, S., Morin, P. P., O'Rourke, J., Streinu, I. I., & Toussaint, G. G. (2004). Unfolding polyhedral bands. Computational geometry, 39(1), 60-63.
152. Demaine, E. D., Iacono, J., & Langerman, S. (2004). Worst-Case Optimal Tree Layout in a Memory Hierarchy. arXiv.org, cs.DS/0410048.
153. Langerman, S. (2003). The Complexity of Halfspace Area Queries. Discrete & computational geometry, 30(4), 639-648. doi:10.1007/s00454-003-2856-2
154. Demaine, E. D., Langerman, S., & O'Rourke, J. (2003). Geometric restrictions on producible polygonal protein chains. Lecture notes in computer science, 2906, 395-404.
155. Golin, M., Langerman, S., & Steiger, W. W. (2003). The convex hull for random lines in the plane. Lecture notes in computer science, 2866, 172-175.

<< 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 >>