Articles dans des revues avec comité de lecture (166)
  1. 12. Demaine, E., Iacono, J., Koumoutsos, G., & Langerman, S. (2020). Belga B-Trees. Theory of Computing Systems. doi:10.1007/s00224-020-09991-8
  2. 13. Arseneva, E., Iacono, J., Koumoutsos, G., Langerman, S., & Zolotov, B. (2020). Sublinear Explicit Incremental Planar Voronoi Diagrams. Journal of Information Processing, 28(0), 766-774. doi:10.2197/ipsjjip.28.766
  3. 14. Barba Flores, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2019). Subquadratic Algorithms for Algebraic Generalizations of 3SUM. Discrete & computational geometry, 61(4), 698-734. doi:10.1007/s00454-018-0040-y
  4. 15. Cardinal, J., Chan, T. M., Iacono, J., Langerman, S., & Ooms, A. (2019). Subquadratic encodings for point configurations. Journal of computational geometry, 10(2), 99-126. doi:10.20382/jocg.v10i2a6
  5. 16. Arseneva, E., & Langerman, S. (2019). Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons? Graphs and combinatorics. doi:10.1007/s00373-019-02105-3
  6. 17. Akiyama, J., Demaine, E. D., & Langerman, S. (2019). Polyhedral Characterization of Reversible Hinged Dissections. Graphs and combinatorics. doi:10.1007/s00373-019-02041-2
  7. 18. Aloupis, G., Carmi, P., Chaitman-Yerushalmi, L., Katz, M. M., & Langerman, S. (2019). Bottleneck Detour Tree of Points on a Path. Computational geometry. doi:10.1016/j.comgeo.2019.01.005
  8. 19. Demaine, E. D., Ito, H., Langerman, S., Lynch, J., Rudoy, M., & Xiao, K. (2019). Cookie Clicker. Graphs and combinatorics. doi:10.1007/s00373-019-02093-4
  9. 20. Arseneva, E., Bose, P., Cano, P., D’Angelo, A., Dujmović, V. V., Frati, F., Langerman, S., & Tappini, A. (2019). Pole dancing: 3D morphs for tree drawings. Journal of graph algorithms and applications, 23(3), 579-602. doi:10.7155/jgaa.00503
  10. 21. Cardinal, J., Langerman, S., & Pérez-Lantero, P. (2018). On the diameter of tree associahedra. The electronic journal of combinatorics, 25(4), #P4.18.
  11. 22. Golin, M., Iacono, J., Langerman, S., Munro, J. I., & Nekrich, Y. (2018). Dynamic trees with almost-optimal access cost. Leibniz international proceedings in informatics, 112. doi:10.4230/LIPIcs.ESA.2018.38
  12. 23. Barba, L., Cardinal, J., Korman, M., Langerman, S., Van Renssen, A., Roeloffzen, M., & Verdonschot, S. (2018). Dynamic Graph Coloring. Algorithmica. doi:10.1007/s00453-018-0473-y
    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 >>