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 (41)
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., Barba Flores, L., Carmi, P., Dujmović, V. V., Frati, F., & Morin, P. P. (2015). Compatible Connectivity Augmentation of Planar Disconnected Graphs. Discrete & computational geometry, 54(2), 459-480. doi:10.1007/s00454-015-9716-86.
Aloupis, G., Barba Flores, L., De Carufel, J. L., Langerman, S., & Souvaine, D. D. (2015). Isoperimetric Enclosures. Graphs and combinatorics, 31(2), 361-392. doi:10.1007/s00373-015-1553-28.
Aloupis, G., Bose, P., Dujmović, V. V., Gray, C., Langerman, S., & Speckmann, B. (2014). Triangulating and guarding realistic polygons. Computational geometry, 47(2 PART C), 296-306. doi:10.1016/j.comgeo.2013.03.00510.
Aloupis, G., Iacono, J., Langerman, S., Özkan, Ö., & Wuhrer, S. S. (2014). The Complexity of Order Type Isomorphism. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 405-415. doi:10.1137/1.9781611973402.3011.
Aloupis, G., Damian, M., Flatland, R. R., Korman, M., Özkan, Ö., Rappaport, D. D., & Wuhrer, S. S. (2013). Establishing strong connectivity using optimal radius half-disk antennas. Computational geometry, 46(3), 328-339. doi:10.1016/j.comgeo.2012.09.008