Parties d'ouvrages collectifs (1)
  1. 1. Aloupis, G., Ballinger, B., Collette, S., Langerman, S., Pór, A., & Wood, D. (2014). Blocking colored point sets. In Thirty Essays on Geometric Graph Theory (pp. 31-48). Springer New York. doi:10.1007/978-1-4614-0110-0_4
    2.   Articles dans des revues avec comité de lecture (167)
  2. 1. Aloupis, G., Cardinal, J., Collette, S., Hurtado, F., Langerman, S., & O'Rourke, J. (2010). Draining a Polygon - or - Rolling a Ball out of a Polygon. Computational geometry. doi:10.1016/j.comgeo.2009.08.002
  3. 2. Bose, P., Kostitsyna, I., & Langerman, S. (2020). Self-approaching paths in simple polygons. Computational geometry.
  4. 3. Chida, K., Demaine, E., Demaine, M. L., Eppstein, D., Hesterberg, A., Horiyama, T., Iacono, J., Ito, H., Langerman, S., Uehara, R., & Uno, Y. (2023). Multifold Tiles of Polyominoes and Convex Lattice Polygons. Thai Journal of Mathematics, 21(4), 957–978.
  5. 4. Langerman, S., Mydlarz, M., & Welzl, E. (2023). Deep Cliques in Point Sets. Discrete & computational geometry. doi:10.1007/s00454-023-00612-y
  6. 5. Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., & Langerman, S. (2023). Competitive Online Search Trees on Trees. ACM transactions on algorithms, 19(3), 1-19. doi:10.1145/3595180
  7. 6. Bose, P., Cano, P., Fagerberg, R., Iacono, J., Jacob, R., & Langerman, S. (2022). Fragile complexity of adaptive algorithms. Theoretical computer science, 919, 92-102. doi:10.1016/j.tcs.2022.03.034
  8. 7. Bose, P., Cano Vila, M. D. P., Fagerberg, R., Iacono, J., Jacob, R., & Langerman, S. (2021). Fragile Complexity of Adaptive Algorithms. Lecture notes in computer science, 12701, 144-157. doi:10.1007/978-3-030-75242-2_10
  9. 8. Bose, P., Cano, P., Fagerberg, R., Iacono, J., Jacob, R., & Langerman, S. (2021). Fragile Complexity of Adaptive Algorithms. Lecture notes in computer science, 12701 LNCS, 144-157. doi:10.1007/978-3-030-75242-2_10
  10. 9. Akitaya, H. A., Ballinger, B., Damian, M., Demaine, E. D., Demaine, M. L., Flatland, R. R., Kostitsyna, I., Ku, J. J., Langerman, S., O'Rourke, J., & Uehara, R. (2021). Toward Unfolding Doubly Covered n-Stars. Lecture notes in computer science, 13034 LNCS, 122-135. doi:10.1007/978-3-030-90048-9_10
  11. 10. Arseneva, E., Langerman, S., & Zolotov, B. (2020). A complete list of all convex polyhedra made by gluing regular pentagons. Journal of Information Processing, 28, 791-799. doi:10.2197/ipsjjip.28.791
  12. 11. Demaine, E., Iacono, J., Koumoutsos, G., & Langerman, S. (2020). Belga B-Trees. Theory of Computing Systems. doi:10.1007/s00224-020-09991-8
    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 >>