Communications publiées lors de congrès ou colloques nationaux et internationaux (47)
  1. 11. Aloupis, G., JongHyokChoe,, JunYopChoe,, Iacono, J., HyonWungJo,, CholHunKim,, KwangHoKim,, YongKukKim,, Langerman, S., DokNamLee,, & HyonIlO, (2018). Covering Points with Disjoint Translates of a Triangle. Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG$^3$ 2018)
  2. 12. Arseneva, E., Bahoo, Y., Biniaz, A., Cano Vila, M. D. P., Chanchary, F., Iacono, J., Jain, K., Lubiw, A., Mondal, D., Sheikhan, K., & Tóth, C. C. (2018). Compatible Paths on Labelled Point Sets. Proceedings of the 30th Canadian Conference on Computational Geometry (pp. 54-60) Canadian Conference on Computational Geometry (CCCG)(30: 2018, August 8-10, 2018: Manitoba, Canada).
  3. 13. Barba, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2017). Subquadratic Algorithms for Algebraic Generalizations of 3SUM. Leibniz International Proceedings in Informatics. Vol. 77.
  4. 14. 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
  5. 15. Aronov, B. B., Iacono, J., & Sheikhan, K. (2017). Nearest-Neighbor Search Under Uncertainty. Proceedings of the 29th Canadian Conference on Computational Geometry (pp. 89-94) (July 26-28, 2017: Ottawa).
  6. 16. Cardinal, J., Iacono, J., & Ooms, A. (2016). Solving k-SUM Using Few Linear Queries. Leibniz International Proceedings in Informatics. Vol. 57.
  7. 17. 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.
  8. 18. 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. 19. Aloupis, G., Benbernou, N., Damian, M., Demaine, E. D., Flatland, R. R., Iacono, J., & Wuhrer, S. S. (2009). Efficient Reconfiguration for Lattice-Based Modular Robots. In I. Petrovic & A. J. Lilienthal (Eds.), Proceedings of European conference on Mobile Robotics (pp. 81-86) KoREMA.
  10. 20. 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).
  11. 21. Collette, S., Dujmović, V. V., Iacono, J., & Langerman, S. (2007). Distribution-sensitive point location in convex subdivisions. Proceedings of the 17th Fall Workshop on Computational and Combinatorial Geometry (p. 2) Fall Workshop on Computational and Combinatorial Geometry(17).
  12. 22. Demaine, E. D., Demaine, M. L., Iacono, J., & Langerman, S. (2007). Wrapping the mozartkugel. Abstracts from the 23rd European Workshop on Computational Geometry (pp. 14-17) EuroCG(23).
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>