Articles dans des revues avec comité de lecture (114)
  1. 59. Cardinal, J., & Hoefer, M. M. (2010). Non-cooperative facility location and covering games. Theoretical computer science, 411(16-18), 1855-1876. doi:10.1016/j.tcs.2010.02.005
  2. 60. Aloupis, G., Cardinal, J., Collette, S., Hurtado, F., Langerman, S., O'Rourke, J., & Palop, B. B. (2010). Highway hull revisited. Computational geometry, 43(2 SPEC. ISS.), 115-130. doi:10.1016/j.comgeo.2009.06.001
  3. 61. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D. D., & Ramos, P. P. (2010). Decomposition of Multiple Coverings into More Parts. Discrete & computational geometry, 44(3), 706-723. doi:10.1007/s00454-009-9238-3
  4. 62. Cardinal, J., & Levy, E. (2010). Connected Vertex Covers in Dense Graphs. Theoretical computer science, 411(26-28), 2581-2590.
  5. 63. Aloupis, G., Cardinal, J., Collette, S., Imahori, S. S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S. S., & Taslakian, P. (2010). Colorful strips. Graphs and combinatorics, 27(3). doi:10.1007/s00373-011-1014-5
  6. 64. Aloupis, G., Cardinal, J., Collette, S., Imahori, S. S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S. S., & Taslakian, P. (2010). Colorful strips. Lecture notes in computer science, 6034 LNCS, 2-13. doi:10.1007/978-3-642-12200-2_2
  7. 65. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2010). Sorting under partial information (without the ellipsoid algorithm). Proceedings of the annual ACM Symposium on Theory of Computing, 359-368. doi:10.1145/1806689.1806740
  8. 66. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2010). An efficient algorithm for partial order production. SIAM journal on computing, 39(7), 2927-2940. doi:10.1137/090759860
  9. 67. Cardinal, J., Labbé, M., Langerman, S., & Palop, B. B. (2009). Pricing geometric transportation networks. International journal of Computational geometry and applications, 19(6), 507-520. doi:10.1142/S021819590900309X
  10. 68. Cardinal, J., Collette, S., & Langerman, S. (2009). Empty region graphs. Computational geometry, 42(3), 183-195. doi:10.1016/j.comgeo.2008.09.003
  11. 69. 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
  12. 70. 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
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>