Articles dans des revues avec comité de lecture (95)
  1. 85. Bernáth, A. A., & Joret, G. (2008). Well-balanced orientations of mixed graphs. Information processing letters, 106(4), 149-151. doi:10.1016/j.ipl.2007.10.014
  2. 86. Bougard, N., & Joret, G. (2008). Turán's Theorem and k-connected graphs. Journal of graph theory, 58(1), 1-13. doi:10.1002/jgt.20289
  3. 87. 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
  4. 88. Fiorini, S., Joret, G., & Cardinal, J. (2008). Minimum Entropy Orientations. Operations research letters, 36, 680-683. doi:10.1016/j.orl.2008.06.010
  5. 89. Cardinal, J., Fiorini, S., & Joret, G. (2008). Tight results on minimum entropy set cover. Algorithmica, 51(1), 49-60. doi:10.1007/s00453-007-9076-8
  6. 90. Doignon, J.-P., Fiorini, S., & Joret, G. (2007). Erratum to "Facets of the linear ordering polytope: A unification for the fence family through weighted graphs". [Journal of Mathematical Psychology 50 (2006) 251-262] (DOI:10.1016/j.jmp.2006.01.001). Journal of mathematical psychology, 51(5), 341. doi:10.1016/j.jmp.2007.08.001
  7. 91. Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Langerman, S., Newman, I., & Weimann, O. (2007). The stackelberg minimum spanning tree game. Lecture notes in computer science, 4619, 64-76. doi:10.1007/978-3-540-73951-7_7
  8. 92. Cardinal, J., Fiorini, S., & Joret, G. (2006). Tight results on minimum entropy set cover. Lecture notes in computer science, 4110, 61-69. doi:10.1007/11830924_8
  9. 93. Doignon, J.-P., Fiorini, S., & Joret, G. (2006). Facets of the linear ordering polytope: a unification for the fence family. Journal of mathematical psychology, 50(3), 251-262. doi:10.1016/j.jmp.2006.01.001
  10. 94. Doignon, J.-P., Fiorini, S., & Joret, G. (2005). On a weighted generalization of α-critical graphs. Electronic Notes in Discrete Mathematics, 22, 401-404. doi:10.1016/j.endm.2005.06.069
  11. 95. Cardinal, J., Fiorini, S., & Joret, G. (2005). Minimum entropy coloring. Lecture notes in computer science, 3827, 819-828. doi:10.1007/11602613_82
    12.   Articles dans des revues sans comité de lecture (1)
  12. 1. Cardinal, J., Joret, G., & Roland, J. (2019). Information-theoretic lower bounds for quantum sorting. arXiv.org., 1902.06473.
    13. << Précédent 1 2 3 4 5 6 7 8 9 Suivant >>