Articles dans des revues avec comité de lecture (36)
  1. 36. Aloupis, G., Cardinal, J., Collette, S., & Langerman, S. (2007). LUMINES strategies. Lecture notes in computer science, 4630, 190-199. doi:10.1007/978-3-540-75538-8_17
    2.   Articles dans des revues sans comité de lecture (1)
  2. 1. Collette, S., Iacono, J., & Langerman, S. (2011). Confluent Persistence Revisited. arXiv.org.
    3.   Communications publiées lors de congrès ou colloques nationaux et internationaux (24)
  3. 1. Cardinal, J., Cohen, N., Collette, S., Hoffmann, M., Langerman, S., & Rote, G. (2012). Coloring Dynamic Point Sets on a Line. Proceedings of the EuroCG 2012 (pp. 209-211) European Workshop on Computational Geometry(XXVIII: 19-21 March, 2012: Assisi, Italy).
  4. 2. Collette, S., Iacono, J., & Langerman, S. (2012). Confluent Persistence Revisited. In Y. Rabani (Ed.), Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 593-601) SIAM.
  5. 3. Cardinal, J., Collette, S., Ito, H., Korman, M., Langerman, S., Sakaidani, H., & Taslakian, P. (2011). Cannibal Animal Games: A new variant of Tic-Tac-Toe. Proceedings of the 4th Annual Meeting of AAAC (AAAC11) Annual Meeting of AAAC(IV)
  6. 4. Bose, P., Campos, V., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristán, V., & Saumell Mendiola, M. (2010). Some properties of higher order delaunay and gabriel graphs. Proc. of the 22nd Canadian Conference on Computational Geometry (2010)
  7. 5. Aloupis, G., Ballinger, B., Collette, S., Langerman, S., Pór, A., & Wood, D. (2010). Blocking coloured point sets. Proceedings of the 26th European workshop on computational geometry (p. 4) European workshop on computational geometry(26).
  8. 6. Benbernou, N., Aloupis, G., Bose, P., Collette, S., Demaine, E. D., Demaine, M. L., Douieb, K., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. P. (2010). Common unfoldings of polyominoes and polycubes. Proceedings of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (p. 2) China-Japan Joint Conference on Computational Geometry, Graphs and Applications(Dalian, China).
  9. 7. 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)
  10. 8. Bose, P., Cardinal, J., Collette, S., Demaine, E. D., Palop, B. B., Taslakian, P., & Zeh, N. (2009). Relaxed gabriel graphs. Proceedings of the 21st Canadian Conference on Computational Geometry (p. 169–172) CCCG 2009(August 2009).
  11. 9. Berten, V., Collette, S., & Goossens, J. (2009). Feasibility test for multi-phase parallel real-time jobs. Proceedings of the Work-in-Progress session of the IEEE Real-Time Systems Symposium 2009 (pp. 33-36) Work-in-Progress session of the IEEE Real-Time Systems Symposium.
  12. 10. 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.
    13. << Précédent 1 2 3 4 5 6 7 Suivant >>