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 (36)
  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. Cardinal, J., Collette, S., Ito, H., Korman, M., Langerman, S., Sakaidani, H., & Taslakian, P. (2015). Cannibal Animal Games: A new variant of Tic-Tac-Toe. Journal of Information Processing, 23(3), 265-271. doi:10.2197/ipsjjip.23.265
  4. 3. Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristán, V., & Saumell Mendiola, M. (2013). Some properties of k-Delaunay and k-Gabriel graphs. Computational geometry, 46(2), 131-139. doi:10.1016/j.comgeo.2012.04.006
  5. 4. Bose, P., Carmi, P., Chaitman-Yerushalmi, L., Collette, S., Katz, M. M., & Langerman, S. (2013). Stable roommates spanner. Computational geometry, 46(2), 120-130. doi:10.1016/j.comgeo.2012.07.001
  6. 5. Aloupis, G., Cardinal, J., Collette, S., Demaine, E. D., Demaine, M. L., Dulieu, M., Fabila-Monroy, R., Hart, V., Hurtado, F., Langerman, S., Saumell Mendiola, M., Seara, C., & Taslakian, P. (2013). Non-crossing matchings of points with geometric objects. Computational geometry, 46(1), 78-92. doi:10.1016/j.comgeo.2012.04.005
  7. 6. Asinowski, A., Cardinal, J., Cohen, N., Collette, S., Hackl, T., Hoffmann, M., Knauer, K., Langerman, S., Lasoń, M., Micek, P., Rote, G., & Ueckerdt, T. (2013). Coloring hypergraphs induced by dynamic point sets and bottomless rectangles. Lecture notes in computer science, 8037 LNCS, 73-84. doi:10.1007/978-3-642-40104-6_7
  8. 7. Bose, P., Cardinal, J., Collette, S., Hurtado, F., Korman, M., Langerman, S., & Taslakian, P. (2013). Coloring and guarding arrangements. Discrete mathematics and theoretical computer science, 15(3), 139-154.
  9. 8. Collette, S., & Langerman, S. (2013). Editorial. Computational geometry, 46(7), 817. doi:10.1016/j.comgeo.2013.04.001
  10. 9. Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. P. (2012). Entropy, triangulation, and point location in planar subdivisions. ACM transactions on algorithms, 8(3), 29. doi:10.1145/2229163.2229173
  11. 10. Bose, P., Collette, S., Langerman, S., & Fagerberg, R. (2012). De-amortizing binary search trees. Lecture notes in computer science, 7391 LNCS(PART 1), 121-132. doi:10.1007/978-3-642-31594-7_11
  12. 11. Aloupis, G., Collette, S., Damian, M., Demaine, E. D., El-Khechen, D., Flatland, R. R., Langerman, S., O'Rourke, J., Pinciu, V., Ramaswami, S. S., Sacristán, V., & Wuhrer, S. S. (2011). Efficient constant-velocity reconfiguration of crystalline robots. Robotica, 29, 59-71. doi:10.1017/S026357471000072X
    13. << Précédent 1 2 3 4 5 6 7 Suivant >>