Articles dans des revues avec comité de lecture (113)
  1. 47. Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Newman, I., & Weimann, O. (2013). The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. Journal of combinatorial optimization, 25(1), 19-46. doi:10.1007/s10878-011-9414-2
  2. 48. 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
  3. 49. Cardinal, J., & Korman, M. (2013). Coloring planar homothets and three-dimensional hypergraphs. Computational geometry, 46(9), 1027-1035. doi:10.1016/j.comgeo.2013.06.004
  4. 50. Cardinal, J., & Fiorini, S. (2013). On generalized comparison-based sorting problems. Lecture notes in computer science, 8066 LNCS, 164-175. doi:10.1007/978-3-642-40273-9_12
  5. 51. Cardinal, J., Karpinski, M., Schmied, R., & Viehmann, C. (2012). Approximating vertex cover in dense hypergraphs. Journal of discrete algorithms, 13, 67-77. doi:10.1016/j.jda.2012.01.003
  6. 52. Cabello, S., Cardinal, J., & Langerman, S. (2012). The clique problem in ray intersection graphs. Lecture notes in computer science, 7501 LNCS, 241-252. doi:10.1007/978-3-642-33090-2_22
  7. 53. Cardinal, J., & Korman, M. (2012). Coloring planar homothets and three-dimensional hypergraphs. Lecture notes in computer science, 7256 LNCS, 121-132. doi:10.1007/978-3-642-29344-3_11
  8. 54. Cardinal, J., Fiorini, S., & Joret, G. (2012). Minimum entropy combinatorial optimization problems. Theory of Computing Systems, 51(1), 4-21. doi:10.1007/s00224-011-9371-2
  9. 55. Cardinal, J., Karpinski, M., Schmied, R., & Viehmann, C. (2011). Approximating Subdense Instances of Covering Problems. Electronic Notes in Discrete Mathematics, 37(C), 297-302. doi:10.1016/j.endm.2011.05.051
  10. 56. Cardinal, J., Demaine, E. D., Demaine, M. L., Imahori, S. S., Ito, T., Kiyomi, M., Langerman, S., Uehara, R., & Uno, T. (2011). Algorithmic Folding Complexity. Graphs and combinatorics, 27(3), 341-351. doi:10.1007/s00373-011-1019-0
  11. 57. Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Langerman, S., Newman, I., & Weimann, O. (2011). The Stackelberg minimum spanning tree game. Algorithmica, 59(2), 129-144. doi:10.1007/s00453-009-9299-y
  12. 58. Taslakian, P., 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. (2010). Matching points with things. Lecture notes in computer science, 6034, 456-467. doi:10.1007/978-3-642-12200-2_40
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>