Parties d'ouvrages collectifs (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 Articles dans des revues avec comité de lecture (166)
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.0023.
Aloupis, G., Iacono, J., Langerman, S., "Ozkan, "., & Wuhrer, S. S. (2024). The Complexity of Order Type Isomorphism. Discrete & computational geometry, 72(2), 483-502. doi:10.1007/S00454-024-00687-15.
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.6.
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/35951807.
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.0348.
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_109.
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_1010.
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