Articles dans des revues avec comité de lecture (93)
  1. 49. 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
  2. 50. 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
  3. 51. 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
  4. 52. Biedl, T., Durocher, S., Engelbeen, C., Fiorini, S., & Young, M. (2011). Faster optimal algorithms for segment minimization with small maximal value. Lecture notes in computer science, 6844 LNCS, 86-97. doi:10.1007/978-3-642-22300-6_8
  5. 53. Biedl, T., Durocher, S., Engelbeen, C., Fiorini, S., & Young, M. (2011). A closest vector problem arising in radiation therapy planning. Lecture notes in computer science, 22(4), 609-629. doi:10.1007/s10878-010-9308-8
  6. 54. 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
  7. 55. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2010). An efficient algorithm for partial order production. SIAM journal on computing, 39(7), 2927-2940. doi:10.1137/090759860
  8. 56. Cardinal, J., Fiorini, S., Joret, G., Jungers, R., & Munro, J. I. (2010). Sorting under partial information (without the ellipsoid algorithm). Proceedings of the annual ACM Symposium on Theory of Computing, 359-368. doi:10.1145/1806689.1806740
  9. 57. Fiorini, S., Joret, G., & Pietropaoli, U. (2010). Hitting diamonds and growing cacti. Lecture notes in computer science, 6080 LNCS, 191-204. doi:10.1007/978-3-642-13036-6_15
  10. 58. Engelbeen, C., & Fiorini, S. (2010). Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy. Networks, 55(2), 138-148. doi:10.1002/net.20324
  11. 59. Fiorini, S., Oriolo, G., Sanità, L., & Theis, D. (2010). The VPN problem with concave costs. SIAM journal on discrete mathematics, 24(3), 1080-1090. doi:10.1137/090749700
  12. 60. Fiorini, S., & Marcotte, O. (2009). On the feedback vertex set polytope of a series-parallel graph. Discrete Optimization, 6, 271-287.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 Suivant >>