Articles dans des revues avec comité de lecture (167)
  1. 108. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., & Smorodinsky, S. S. (2009). Coloring geometric range spaces. Discrete & computational geometry, 41(2), 348-362. doi:10.1007/s00454-008-9116-4
  2. 109. Cardinal, J., Langerman, S., & Levy, E. (2009). Improved approximation bounds for edge dominating set in dense graphs. Theoretical computer science, 410(8-10), 949-957. doi:10.1016/j.tcs.2008.12.036
  3. 110. 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.
  4. 111. Cardinal, J., Demaine, E. D., Demaine, M. L., Imahori, S. S., Langerman, S., & Uehara, R. R. (2009). Algorithmic folding complexity. Lecture notes in computer science, 5878 LNCS, 452-461. doi:10.1007/978-3-642-10631-6_47
  5. 112. 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
  6. 113. Bremner, D., Chen, D., Iacono, J., Langerman, S., & Morin, P. P. (2008). Output-sensitive algorithms for Tukey depth and related problems. Statistics and computing, 18(3), 259-266. doi:10.1007/s11222-008-9054-2
  7. 114. Agarwal, P. K. P., Klein, R. R., Knauer, C. C., Langerman, S., Morin, P. P., Sharir, M. M., & Soss, M. M. (2008). Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D. Discrete & computational geometry, 39(1-3), 17-37. doi:10.1007/s00454-007-9019-9
  8. 115. Douieb, K., & Langerman, S. (2008). Dynamic hotlinks. Algorithmica, 50(2), 208-222. doi:10.1007/s00453-007-9060-3
  9. 116. Aloupis, G., Demaine, E. D., Langerman, S., Morin, P. P., O'Rourke, J., Streinu, I. I., & Toussaint, G. G. (2008). Edge-unfolding nested polyhedral bands. Computational geometry, 39(1), 30-42. doi:10.1016/j.comgeo.2007.05.009
  10. 117. 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.
  11. 118. 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
  12. 119. Demaine, E. D., Langerman, S., & Price, E. (2008). Confluently persistent tries for efficient version control. Lecture notes in computer science, 5124 LNCS, 160-172. doi:10.1007/978-3-540-69903-3_16
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Suivant >>