Communications publiées lors de congrès ou colloques nationaux et internationaux (81)
  1. 43. Cardinal, J., Labbé, M., Langerman, S., & Palop, B. (2005). Pricing of Geometric Transportation Networks. Proc. Canadian Conference on Computational Geometry (pp. 92-96) CCCG(2005).
  2. 44. Cardinal, J., Collette, S., & Langerman, S. (2005). Region counting graphs. Proceedings of the 21st European Workshop on Computational Geometry (EuroCG05) European Workshop on Computational Geometry(XXI: 9-11 March, 2005: Eindhoven)
  3. 45. Abbott, T. G., Demaine, E. D., Demaine, M. L., Kane, D. D., Langerman, S., Nelson, J. J., & Yeung, V. V. (2005). Dynamic ham-sandwich cuts of convex polygons in the plane. Proceedings of the 17th Canadian Conference on Computational Geometry (pp. 61-64) Canadian Conference on Computational Geometry(17: 10-12 August 2005: Windsor, Ontario, Canada).
  4. 46. Aronov, B. B., Aurenhammer, F. F., Hurtado, F., Langerman, S., Rappaport, D. D., Seara, C., & Smorodinsky, S. S. (2005). Small weak epsilon nets. Proceedings of the 17th Canadian Conference on Computational Geometry (pp. 52-56) Canadian Conference on Computational Geometry(17: 10-12 August 2005: Windsor, Ontario, Canada).
  5. 47. Cabello, S., Díaz-Báñez, J. M., Langerman, S., Seara, C., & Ventura, I. (2005). Reverse facility location problems. Proceedings of the 17th Canadian Conference on Computational Geometry (pp. 68-71) Canadian Conference on Computational Geometry(17: 10-12 august 2005: Windsor, Ontario, Canada).
  6. 48. Cardinal, J., Kremer, S., & Langerman, S. (2004). Juggling with Pattern Matching. Proc. Int. Conference on Fun with Algorithms (pp. 147-158) FUN(2004: Edizioni Plus, Università di Pisa).
  7. 49. Cardinal, J., Collette, S., & Langerman, S. (2004). Local Properties of Geometric Graphs. Proc. Canadian Conference on Computational Geometry (pp. 145-148) CCCG(2004).
  8. 50. Demaine, E. D., Demaine, M. L., Langerman, A., & Langerman, S. (2004). Morpion solitaire. Proceedings of the 3rd International conference on Fun with algorithms (pp. 53-64) International conference on Fun with algorithms(3).
  9. 51. Bose, P., Demaine, E. D., Hurtado, F., Iacono, J., Langerman, S., & Morin, P. P. (2004). Geodesic ham-sandwich cut. Proceedings of the 2004 ACM Symposium on Computational Geometry (pp. 1-9).
  10. 52. Glass, J., Langerman, S., O'Rourke, J., Snoeyink, J., & Zhong, J. (2004). A 2-chain can interlock with a k-chain. Proceedings of the 14th Annual Fall Workshop on Computational Geometry (pp. 18-19) Annual Fall Workshop on Computational Geometry(14).
  11. 53. Aloupis, G., Demaine, E. D., Langerman, S., Morin, P. P., O'Rourke, J., Streinu, I. I., & Toussaint, G. G. (2004). Unfolding polyhedral bands. Proceedings of the 16th Canadian Conference on Computational Geometry (pp. 60-63) Canadian Conference on Computational Geometry(16).
  12. 54. Bose, P., Demaine, E. D., Hurtado, F., Iacono, J., Langerman, S., & Morin, P. (2004). Geodesic ham-sandwich cuts. In Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 (pp. 1-9) ACM. doi:10.1145/997817.997821
    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 >>