Articles dans des revues avec comité de lecture (167)
  1. 72. Demaine, E. D., Iacono, J., Langerman, S., & Özkan, Ö. (2013). Combining binary search trees. Lecture notes in computer science, 7965 LNCS(PART 1), 388-399. doi:10.1007/978-3-642-39206-1_33
  2. 73. Collette, S., & Langerman, S. (2013). Editorial. Computational geometry, 46(7), 817. doi:10.1016/j.comgeo.2013.04.001
  3. 74. Bose, P., Dujmović, V. V., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Sacristán, V., Saumell Mendiola, M., & Wood, D. (2012). Proximity graphs: E, δ, Δ, χ and ω. International journal of Computational geometry and applications, 22(5), 439-469. doi:10.1142/S0218195912500112
  4. 75. Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. P. (2012). Entropy, triangulation, and point location in planar subdivisions. ACM transactions on algorithms, 8(3), 29. doi:10.1145/2229163.2229173
  5. 76. Ito, H., Langerman, S., & Yoshida, Y. (2012). Algorithms and complexity of generalized river crossing problems. Lecture notes in computer science, 7288 LNCS, 235-244. doi:10.1007/978-3-642-30347-0_24
  6. 77. Cabello, S., Cardinal, J., & Langerman, S. (2012). The clique problem in ray intersection graphs. Lecture notes in computer science, 7501 LNCS, 241-252. doi:10.1007/978-3-642-33090-2_22
  7. 78. Bose, P., Collette, S., Langerman, S., & Fagerberg, R. (2012). De-amortizing binary search trees. Lecture notes in computer science, 7391 LNCS(PART 1), 121-132. doi:10.1007/978-3-642-31594-7_11
  8. 79. Cardinal, J., Demaine, E. D., Demaine, M. L., Imahori, S. S., Ito, T., Kiyomi, M., Langerman, S., Uehara, R., & Uno, T. (2011). Algorithmic Folding Complexity. Graphs and combinatorics, 27(3), 341-351. doi:10.1007/s00373-011-1019-0
  9. 80. Aloupis, G., Bose, P., Demaine, E. D., Langerman, S., Meijer, H. H., Overmars, M. M., & Toussaint, G. G. (2011). Computing signed permutations of polygons. International journal of Computational geometry and applications, 21(1). doi:10.1142/S0218195911003561
  10. 81. Demaine, E. D., Demaine, M. L., Hart, V., Iacono, J., Langerman, S., & O'Rourke, J. (2011). Continuous blooming of convex polyhedra. Graphs and combinatorics, 27(3), 363-376. doi:10.1007/s00373-011-1024-3
  11. 82. Aloupis, G., Collette, S., Damian, M., Demaine, E. D., El-Khechen, D., Flatland, R. R., Langerman, S., O'Rourke, J., Pinciu, V., Ramaswami, S. S., Sacristán, V., & Wuhrer, S. S. (2011). Efficient constant-velocity reconfiguration of crystalline robots. Robotica, 29, 59-71. doi:10.1017/S026357471000072X
  12. 83. Aloupis, G., Collette, S., Langerman, S., Bose, P., Douieb, K., Dujmović, V. V., Morin, P. P., Demaine, E. D., Demaine, M. L., & Iacono, J. (2011). Common unfoldings of polyominoes and polycubes. Lecture notes in computer science, 7033 LNCS, 44-54. doi:10.1007/978-3-642-24983-9_5
    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 >>