Articles dans des revues avec comité de lecture (90)
  1. 37. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2013). Sorting under partial information (without the ellipsoid algorithm). Combinatorica, 33(6), 655-697. doi:10.1007/s00493-013-2821-5
  2. 38. Balof, B., Doignon, J.-P., & Fiorini, S. (2013). The representation polyhedron of a semiorder. Order, 30(1), 103-135. doi:10.1007/s11083-011-9229-x
  3. 39. 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
  4. 40. Fiorini, S., Kaibel, V., Pashkovich, K., & Theis, D. (2013). Combinatorial bounds on nonnegative rank and extended formulations. Discrete mathematics, 313(1), 67-83. doi:10.1016/j.disc.2012.09.015
  5. 41. Biedl, T., Durocher, S., Engelbeen, C., Fiorini, S., & Young, M. (2013). Faster optimal algorithms for segment minimization with small maximal value. Discrete applied mathematics, 161(3), 317-329. doi:10.1016/j.dam.2012.09.011
  6. 42. Balof, B., Doignon, J.-P., & Fiorini, S. (2013). The Representation Polyhedron of a Semiorder. Order, 30(1), 103-135. doi:10.1007/s11083-011-9229-x
  7. 43. Braun, G., Fiorini, S., Pokutta, S., & Steurer, D. (2012). Approximation limits of linear programs (beyond hierarchies). Annual Symposium on Foundations of Computer Science,, 6375326 480-489. doi:10.1109/FOCS.2012.10
  8. 44. Fiorini, S., Rothvoss, T., & Tiwary, H. R. (2012). Extended formulations for polygons. Discrete & computational geometry, 48(3), 658-668. doi:10.1007/s00454-012-9421-9
  9. 45. Fiorini, S., Joret, G., Theis, D., & Wood, D. (2012). Small minors in dense graphs. European journal of combinatorics, 33(6), 1226-1245. doi:10.1016/j.ejc.2012.02.003
  10. 46. Faenza, Y., Fiorini, S., Grappe, R., & Tiwary, H. R. (2012). Extended formulations, nonnegative factorizations, and randomized communication protocols. Lecture notes in computer science, 7422, 129-140. doi:10.1007/978-3-642-32147-4_13
  11. 47. 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
  12. 48. Fiorini, S., & Joret, G. (2012). Approximating the balanced minimum evolution problem. Operations research letters, 40(1), 31-35. doi:10.1016/j.orl.2011.10.003
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 Suivant >>