Articles dans des revues sans comité de lecture (18)
  1. 13. Demaine, E. D., Iacono, J., Langerman, S., & Özkan, Ö. (2013). Combining Binary Search Trees. arXiv.org.
  2. 14. Aloupis, G., Iacono, J., Langerman, S., & Özkan, Ö. (2013). The Complexity of Order Type Isomorphism. arXiv.org.
  3. 15. Bremner, D., Chan, T. M., Demaine, E. D., Erickson, J. J., Hurtado, F., Iacono, J., Langerman, S., Pǎtraşcu, M., & Taslakian, P. (2012). Necklaces, convolutions, and X+Y. arXiv.org.
  4. 16. Collette, S., Iacono, J., & Langerman, S. (2011). Confluent Persistence Revisited. arXiv.org.
  5. 17. Demaine, E. D., Demaine, M. L., Hart, V., Iacono, J., Langerman, S., & O'Rourke, J. (2009). Continuous Blooming of Convex Polyhedra. arXiv.org.
  6. 18. Aronov, B. B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., & Smid, M. M. (2005). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. arXiv.org.
    7.   Communications publiées lors de congrès ou colloques nationaux et internationaux (81)
  7. 1. Baes, A., Demaine, E. D., Demaine, M. L., Hartung, E., Langerman, S., O'Rourke, J., Uehara, R., Uno, Y., & Williams, A. (2022). Rolling Polyhedra on Tessellations. In 11th International Conference on Fun with Algorithms, FUN 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, Italy 11th International Conference on Fun with Algorithms, FUN 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, Italy: Vol. 226 (pp. 6:1-6:16). (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum f"ur Informatik. doi:10.4230/LIPIcs.FUN.2022.6
  8. 2. Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., & Langerman, S. (2020). Competitive Online Search Trees on Trees. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1878-1891) Philadelphia: SIAM. doi:10.1137/1.9781611975994.115
  9. 3. Demaine, E., Iacono, J., Koumoutsos, G., & Langerman, S. (2019). Belga B-Trees. (pp. 93-105) International Computer Science Symposium in Russia - CSR(2019). doi:10.1007/978-3-030-19955-5_9
  10. 4. Akitaya, H., Ballinger, B., Damian, M., Demaine, E. D., Demaine, M. L., Flatland, R. R., Kostitsyna, I., Ku, J., Langerman, S., O'Rourke, J., & Uehara, R. (2018). Toward Unfolding Doubly Covered $n$-Stars. Abstracts of the Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG$^3$ 2018)
  11. 5. 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)
  12. 6. Arseneva, E., Bose, P., Cano, P., D'Angelo, A., Dujmovic, V., Frati, F., Langerman, S., & Tappini, A. (2018). Pole Dancing: 3D Morphs for Tree Drawings. 26th International Symposium on Graph Drawing and Network Visualization (GD 2018). Vol. 11282 (pp. 371-384). doi:10.1007/978-3-030-04414-5_27
    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 >>