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 (42)
  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. 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-1
  4. 3. Aloupis, G., Carmi, P., Chaitman-Yerushalmi, L., Katz, M. M., & Langerman, S. (2019). Bottleneck Detour Tree of Points on a Path. Computational geometry. doi:10.1016/j.comgeo.2019.01.005
  5. 4. 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-8
  6. 5. Aloupis, G., Barba Flores, L., Langerman, S., & Souvaine, D. D. (2015). Bichromatic compatible matchings. Computational geometry, 48(8), 622-633. doi:10.1016/j.comgeo.2014.08.009
  7. 6. Aloupis, G., Demaine, E. D., Guo, A., & Viglietta, G. (2015). Classic Nintendo games are (computationally) hard. Theoretical computer science, 586, 135-160. doi:10.1016/j.tcs.2015.02.037
  8. 7. 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-2
  9. 8. Aloupis, G., & Bremner, D. (2014). Editorial. Computational geometry, 47(2), 111. doi:10.1016/j.comgeo.2013.08.004
  10. 9. 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.005
  11. 10. Aloupis, G., Demaine, E. D., Guo, A., & Viglietta, G. (2014). Classic Nintendo games are (computationally) hard. Lecture notes in computer science, 8496 LNCS, 40-51. doi:10.1007/978-3-319-07890-8_4
  12. 11. 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.30
    13. << Précédent 1 2 3 4 5 6 Suivant >>