Articles dans des revues avec comité de lecture (114)
  1. 71. 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. 72. 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
  3. 73. Cardinal, J., Ravelomanana, V. V., & Valencia-Pabon, M. M. (2009). Minimum Sum Edge Colorings of Multicycles. Discrete applied mathematics, 158(12), 1216-1223. doi:10.1016/j.dam.2009.04.020
  4. 74. Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Newman, I., & Weimann, O. (2009). The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. Lecture notes in computer science, 5929, 125-136. doi:10.1007/978-3-642-10841-9-13
  5. 75. Cardinal, J., Fiorini, S., & Joret, G. (2009). Minimum entropy combinatorial optimization problems. Lecture notes in computer science, 5635, 79-88. doi:10.1007/978-3-642-03073-4-9
  6. 76. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2009). An efficient algorithm for partial order production. Proceedings of the annual ACM Symposium on Theory of Computing. doi:10.1145/1536414.1536430
  7. 77. 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
  8. 78. Cardinal, J., Ravelomanana, V. V., & Valencia-Pabon, M. M. (2008). Chromatic Edge Strength of Some Multigraphs. Electronic Notes in Discrete Mathematics, 30(C), 39-44. doi:10.1016/j.endm.2008.01.008
  9. 79. 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
  10. 80. 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
  11. 81. Cardinal, J., & Levy, E. (2008). Connected vertex covers in dense graphs. Lecture notes in computer science, 5171 LNCS, 35-48. doi:10.1007/978-3-540-85363-3_4
  12. 82. Cardinal, J., Fiorini, S., & Joret, G. (2008). Minimum Entropy Coloring. Journal of combinatorial optimization, 16(4 SPEC. ISS.), 361-377. doi:10.1007/s10878-008-9152-2
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>