Articles dans des revues avec comité de lecture (166)
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.76614.
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-y15.
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.v10i2a619.
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-420.
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.0050322.
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.3823.
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