Articles dans des revues avec comité de lecture (90)
  1. 61. Doignon, J.-P., Fiorini, S., & Joret, G. (2009). Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. Discrete Optimization, 6, 1-9. doi:j.disopt.2008.07.001
  2. 62. 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
  3. 63. 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. 64. 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. 65. Fiorini, S., Hardy, N., Reed, B., & Vetta, A. (2008). Planar graph bipartization in linear time. Discrete applied mathematics, 156, 1175-1180.
  6. 66. 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
  7. 67. 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
  8. 68. 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
  9. 69. Fiorini, S., Hardy, N., Reed, B., & Vetta, A. (2007). Approximate min-max relations for odd cycles in planar graphs. Mathematical programming, 110, 71-91.
  10. 70. Fiorini, S. (2007). {0, 1/2}-cuts and the linear ordering problem: Surfaces that define facets. SIAM journal on discrete mathematics, 20(4), 893-912. doi:10.1137/S0895480104440985
  11. 71. 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
  12. 72. Fiorini, S., Correa, J., & Stier-Moses, N. (2006). A note on the precedence-constrained class sequencing problem. Discrete applied mathematics, 155(3), 257-259. doi:10.1016/j.dam.2006.03.038
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 Suivant >>