Communications publiées lors de congrès ou colloques nationaux et internationaux (81)
  1. 19. Higashikawa, Y., Katoh, N., Langerman, S., & Tanigawa, S. (2010). Online graph exploration algorithms for cycles and trees by multiple searchers. China-Japan Joint Conference on Computational Geometry, Graphs and Applications CGGA 2010
  2. 20. Aloupis, G., Cardinal, J., Collette, S., Imahori, S. S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S. S., & Taslakian, P. (2009). Colorful strips. Proc. of the International Conference on Computational Geometry and Graph Theory CGGT’09(2009)
  3. 21. Abel, Z., Ballinger, B., Bose, P., Collette, S., Dujmović, V. V., Hurtado, F., Kominers, S., Langerman, S., Pór, A., & Wood, D. (2009). Every large point set contains many collinear points or an empty pentagon. Proccedings of the Canadian conference on computational geometry (pp. 99-102) Canadian conference on computational geometry.
  4. 22. 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., & Taslakian, P. (2009). Matching points with things. Proceedings of the 7th Japan Conference on Computational Geometry and Graphs (pp. 7-8) Japan Conference on Computational Geometry and Graphs(7).
  5. 23. Demaine, E. D., Demaine, M. L., Hart, V., Iacono, J., Langerman, S., & O'Rourke, J. (2009). Continuous blooming of convex polyhedra. Abstracts from the 7th Japan Conference on Computational Geometry and Graphs (pp. 123-124) JCCGG(7).
  6. 24. Cardinal, J., Demaine, E. D., Demaine, M. L., Imahori, S. S., Langerman, S., & Uehara, R. R. (2009). Algorithmic folding complexity. Abstracts from the 7th Japan Conference on Computational Geometry and Graphs JCCGG(7)
  7. 25. Aloupis, G., Cardinal, J., Collette, S., Hurtado, F., Langerman, S., & O'Rourke, J. (2008). Draining a polygon -- or -- rolling a ball out of a polygon. Proc. Canadian Conference on Computational Geometry CCCG(2008)
  8. 26. Pluquet, F., Langerman, S., Marot, A., & Wuyts, R. (2008). Implementing partial persistence in object-oriented languages. Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (pp. 37-48) Workshop on Algorithm Engineering and Experiments(10: 19 January 2008: San Francisco, California).
  9. 27. 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. (2008). Realistic reconfiguration of crystalline (and teletube) robots. Proceedings of the workshop on the algorithmic foundations of robotics (p. 18) International Workshop on the Algorithmic Foundations of Robotics(8: 7-9 December 2008: Guanajuato, México).
  10. 28. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., & Smorodinsky, S. S. (2008). Coloring geometric range spaces. Proceedings of the 24th European Workshop on Computational Geometry (pp. 111-114) European Workshop on Computational Geometry(24).
  11. 29. Bose, P., Langerman, S., & Roy, S. (2008). Smallest enclosing circle centered on a query line segment. Proceedings of the 20th Canadian Conference on Computational Geometry (pp. 167-170) CCCG(20).
  12. 30. Cardinal, J., Collette, S., Hurtado, F., Langerman, S., & Palop, B. (2007). Moving walkways, Escalators, and Elevators. Proc. Kyoto International Conference on Computational Geometry and Graph Theory KyotoCGGT2007(2007)
    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 >>