Articles dans des revues avec comité de lecture (36)
  1. 24. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D. D., & Ramos, P. P. (2009). Decomposition of multiple coverings into more parts. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 302-310.
  2. 25. Cardinal, J., Collette, S., Hurtado, F., Langerman, S., & Palop, B. B. (2008). Optimal location of transportation devices. Computational geometry, 41(3), 219-229. doi:10.1016/j.comgeo.2008.01.001
  3. 26. Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. P. (2008). Distribution-sensitive point location in convex subdivisions. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 912-921.
  4. 27. Aloupis, G., Collette, S., Demaine, E. D., Langerman, S., Sacristán, V., & Wuhrer, S. S. (2008). Reconfiguration of cube-style modular robots using o(log n) parallel moves. Lecture notes in computer science, 5369 LNCS, 342-353. doi:10.1007/978-3-540-92182-0_32
  5. 28. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., & Smorodinsky, S. S. (2008). Coloring geometric range spaces. Lecture notes in computer science, 4957 LNCS, 146-157. doi:10.1007/978-3-540-78773-0_13
  6. 29. Cardinal, J., Collette, S., & Langerman, S. (2008). Local properties of geometric graphs. Computational geometry, 39(1), 55-64. doi:10.1016/j.comgeo.2007.05.011
  7. 30. Collette, S., Cucu, L., & Goossens, J. (2008). Integrating job parallelism in real-time scheduling theory. Information processing letters, 106(5), 180-187. doi:10.1016/j.ipl.2007.11.014
  8. 31. Bose, P., Carmi, P., Collette, S., & Smid, M. M. (2008). On the stretch factor of convex delauney graphs. Lecture notes in computer science, 5369, 656-667.
  9. 32. Bose, P., Carmi, P., Collette, S., & Smid, M. M. (2008). On the stretch factor of convex delaunay graphs. Lecture notes in computer science, 5369, 665-667. doi:10.1007/978-3-540-92182-0_58
  10. 33. Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. (2008). Distribution-sensitive point location in convex subdivisions. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 912-921.
  11. 34. Aloupis, G., Collette, S., Bouillon, F., Demaine, E. D., Flatland, R. R., Langerman, S., O'Rourke, J., Ramaswami, S. S., Sacristán, V., & Wuhrer, S. S. (2007). Linear reconfiguration of cube-style modular robots. Lecture notes in computer science, 4835 LNCS, 208-219.
  12. 35. Collette, S., Raskin, J.-F., & Servais, F. (2007). On the symbolic computation of the hardest configurations of the RUSH HOUR game. Lecture notes in computer science, 4630, 220-233. doi:10.1007/978-3-540-75538-8_20
    13. << Précédent 1 2 3 4 5 6 7 Suivant >>