Communications publiées lors de congrès ou colloques nationaux et internationaux (81)
  1. 8. Cardinal, J., Chan, T. M., Iacono, J., Langerman, S., & Ooms, A. (2017). Subquadratic-Space Query-Efficient Data Structures for Realizable Order Types. Annual Fall Workshop on Computational Geometry
  2. 9. Khramtcova, E., & Langerman, S. (2017). Which convex polyhedra can be made by gluing regular hexagons? Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG$^3$ 2017)
  3. 10. Akiyama, J., Demaine, E. D., & Langerman, S. (2017). Polyhedral Characterization of Reversible Hinged Dissections. Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG$^3$ 2017)
  4. 11. Demaine, E. D., Ito, H., Langerman, S., Lynch, J., Rudoy, M., & Xiao, K. (2017). Cookie Clicker. Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG$^3$ 2017)
  5. 12. 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).
  6. 13. 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.
  7. 14. 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)
  8. 15. 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).
  9. 16. 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).
  10. 17. 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)
  11. 18. 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
  12. 19. Higashikawa, Y., Katoh, N., Langerman, S., & Tanigawa, S. (2010). Online graph exploration algorithms for cycles and trees by multiple searchers. Abstracts of the 3rd Annual Meeting of the Asian Association for Algorithms and Computation AAAC(3: 2010)
    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 >>