Articles dans des revues avec comité de lecture (167)
  1. 84. Barba Flores, L., Korman, M., Langerman, S., & Silveira, R. R. (2011). Computing the visibility polygon using few variables. Lecture notes in computer science, 7074 LNCS, 70-79. doi:10.1007/978-3-642-25591-5_9
  2. 85. Akiyama, J., Kuwata, T., Langerman, S., Okawa, K., Sato, I., & Shephard, G. G. (2011). Determination of all tessellation polyhedra with regular polygonal faces. Lecture notes in computer science, 7033 LNCS, 1-11. doi:10.1007/978-3-642-24983-9_1
  3. 86. Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Langerman, S., Newman, I., & Weimann, O. (2011). The Stackelberg minimum spanning tree game. Algorithmica, 59(2), 129-144. doi:10.1007/s00453-009-9299-y
  4. 87. Connelly, R., Demaine, E. D., Demaine, M. L., Fekete, S., Langerman, S., Mitchell, J., & Ribó, A. (2010). Locked and unlocked chains of planar shapes. Discrete & computational geometry, 44(2), 439-462. doi:10.1007/s00454-010-9262-3
  5. 88. Demaine, E. D., Langerman, S., & Price, E. (2010). Confluently persistent tries for efficient version control. Algorithmica, 57(3), 462-483. doi:10.1007/s00453-008-9274-z
  6. 89. Demaine, E. D., Iacono, J., & Langerman, S. (2010). Grid vertex-unfolding orthostacks. International journal of Computational geometry and applications, 20(3), 245-254. doi:10.1142/S0218195910003281
  7. 90. Cabello, S., Díaz-Báñez, J. M., Langerman, S., Seara, C., & Ventura, I. (2010). Facility location problems in the plane based on reverse nearest neighbor queries. European journal of operational research, 202(1), 99-106. doi:10.1016/j.ejor.2009.04.021
  8. 91. Taslakian, P., Aloupis, G., Cardinal, J., Collette, S., Demaine, E. D., Demaine, M. L., Dulieu, M., Fabila-Monroy, R., Hart, V., Hurtado, F., Langerman, S., Saumell Mendiola, M., & Seara, C. (2010). Matching points with things. Lecture notes in computer science, 6034, 456-467. doi:10.1007/978-3-642-12200-2_40
  9. 92. Aloupis, G., Cardinal, J., Collette, S., Hurtado, F., Langerman, S., O'Rourke, J., & Palop, B. B. (2010). Highway hull revisited. Computational geometry, 43(2 SPEC. ISS.), 115-130. doi:10.1016/j.comgeo.2009.06.001
  10. 93. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D. D., & Ramos, P. P. (2010). Decomposition of Multiple Coverings into More Parts. Discrete & computational geometry, 44(3), 706-723. doi:10.1007/s00454-009-9238-3
  11. 94. Cheng, S.-W., Knauer, C. C., Langerman, S., & Smid, M. M. (2010). Approximating the average stretch factor of geometric graphs. Lecture notes in computer science, 6506, 37-48. doi:10.1007/978-3-642-17517-6_6
  12. 95. Douieb, K., & Langerman, S. (2010). Near-entropy hotlink assignments. Algorithmica, 58(2), 221-244. doi:10.1007/s00453-008-9259-y
    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 >>