Articles dans des revues avec comité de lecture (167)
  1. 96. Abel, Z., Ballinger, B., Bose, P., Collette, S., Dujmović, V. V., Hurtado, F., Kominers, S., Langerman, S., Pór, A., & Wood, D. (2010). Every large point set contains many collinear points or an empty pentagon. Graphs and combinatorics, 27(1), 47-60. doi:10.1007/s00373-010-0957-2
  2. 97. Aloupis, G., Cardinal, J., Collette, S., Imahori, S. S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S. S., & Taslakian, P. (2010). Colorful strips. Graphs and combinatorics, 27(3). doi:10.1007/s00373-011-1014-5
  3. 98. Aloupis, G., Cardinal, J., Collette, S., Imahori, S. S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S. S., & Taslakian, P. (2010). Colorful strips. Lecture notes in computer science, 6034 LNCS, 2-13. doi:10.1007/978-3-642-12200-2_2
  4. 99. 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. (2010). Realistic reconfiguration of crystalline (and telecube) robots. Springer Tracts in Advanced Robotics, 57, 433-447. doi:10.1007/978-3-642-00312-7_27
  5. 100. Chen, D., Devillers, O., Iacono, J., Langerman, S., & Morin, P. (2010). Oja medians and centers of gravity. Proceedings of the annual ACM Symposium on Computational Geometry, 147-150.
  6. 101. Brodal, G. S., Demaine, E. D., Fineman, J. J., Iacono, J., Langerman, S., & Munro, J. I. (2010). Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 1448-1456. doi:10.1137/1.9781611973075.117
  7. 102. Cardinal, J., Labbé, M., Langerman, S., & Palop, B. B. (2009). Pricing geometric transportation networks. International journal of Computational geometry and applications, 19(6), 507-520. doi:10.1142/S021819590900309X
  8. 103. Demaine, E. D., Demaine, M. L., Iacono, J., & Langerman, S. (2009). Wrapping spheres with flat paper. Computational geometry, 42(8), 748-757. doi:10.1016/j.comgeo.2008.10.006
  9. 104. Pluquet, F., Langerman, S., & Wuyts, R. (2009). Executing code in the past: Efficient in-memory object graph versioning. ACM SIGPLAN notices, 44(10), 391-407.
  10. 105. Aronov, B. B., Aurenhammer, F. F., Hurtado, F., Langerman, S., Rappaport, D. D., Seara, C., & Smorodinsky, S. S. (2009). Small weak epsilon-nets. Computational geometry, 42(5), 455-462. doi:10.1016/j.comgeo.2008.02.005
  11. 106. Abbott, T. G., Burr, M. A. M., Chan, T. M., Demaine, E. D., Demaine, M. L., Hugg, J. J., Kane, D. D., Langerman, S., Nelson, J. J., Rafalin, E. E., Seyboth, K. K., & Yeung, V. V. (2009). Dynamic ham-sandwich cuts in the plane. Computational geometry, 42(5), 419-428. doi:10.1016/j.comgeo.2008.09.008
  12. 107. Cardinal, J., Collette, S., & Langerman, S. (2009). Empty region graphs. Computational geometry, 42(3), 183-195. doi:10.1016/j.comgeo.2008.09.003
    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 >>