Articles dans des revues avec comité de lecture (167)
  1. 24. Kostitsyna, I., Kouhestani, B., Langerman, S., & Rappaport, D. D. (2018). An optimal algorithm to compute the inverse beacon attraction region. Leibniz international proceedings in informatics, 99, 551-5514. doi:10.4230/LIPIcs.SoCG.2018.55
  2. 25. Korman, M., Langerman, S., Mulzer, W., Pilz, A., Saumell Mendiola, M., & Vogtenhuber, B. (2018). The dual diameter of triangulations. Computational geometry, 68, 243-252. doi:10.1016/j.comgeo.2017.06.008
  3. 26. Langerman, S., & Uno, Y. (2018). Threes!, Fives, 1024!, and 2048 are Hard. Theoretical computer science, 748, 17-27. doi:10.1016/j.tcs.2018.03.018
  4. 27. Arseneva, E., Bose, P., Cano, P., D’Angelo, A., Dujmović, V. V., Frati, F., Langerman, S., & Tappini, A. (2018). Pole dancing: 3D morphs for tree drawings. Lecture notes in computer science, 11282 LNCS, 371-384. doi:10.1007/978-3-030-04414-5_27
  5. 28. Allen, S. S., Barba Flores, L., Iacono, J., & Langerman, S. (2017). Incremental Voronoi Diagrams. Discrete & computational geometry, 58(4), 822-848. doi:10.1007/s00454-017-9943-2
  6. 29. Balko, M., Kynčl, J., Langerman, S., & Pilz, A. (2017). Induced Ramsey-type results and binary predicates for point sets. The electronic journal of combinatorics, 24(4), #P4.24.
  7. 30. Balko, M., Kynčl, J., Langerman, S., & Pilz, A. (2017). Induced Ramsey-type results and binary predicates for point sets. Electronic Notes in Discrete Mathematics, 61, 77-83. doi:10.1016/j.endm.2017.06.023
  8. 31. Bose, P., Kostitsyna, I., & Langerman, S. (2017). Self-approaching paths in simple polygons. Leibniz international proceedings in informatics, 77, 211-2115. doi:10.4230/LIPIcs.SoCG.2017.21
  9. 32. Barba Flores, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2017). Subquadratic algorithms for algebraic generalizations of 3SUM. Leibniz international proceedings in informatics, 77, 131-1315. doi:10.4230/LIPIcs.SoCG.2017.13
  10. 33. Barba Flores, L., Cardinal, J., Korman, M., Langerman, S., Van Renssen, A., Roeloffzen, M., & Verdonschot, S. (2017). Dynamic graph coloring. Lecture notes in computer science, 10389 LNCS, 97-108. doi:10.1007/978-3-319-62127-2_9
  11. 34. Iacono, J., Khramtcova, E., & Langerman, S. (2017). Searching edges in the overlap of two plane graphs. Lecture notes in computer science, 10389 LNCS, 473-484. doi:10.1007/978-3-319-62127-2_40
  12. 35. Aronov, B. B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., & Smid, M. M. (2017). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica, 80(11), 3316–-3334. doi:10.1007/s00453-017-0389-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 >>