Articles dans des revues avec comité de lecture (90)
  1. 85. Fiorini, S. (2003). A Combinatorial study of partial order polytopes. European journal of combinatorics, 24, 149-159.
  2. 86. Christophe, J., Doignon, J.-P., & Fiorini, S. (2003). Counting biorders. Journal of integer sequences, 6.
  3. 87. Doignon, J.-P., & Fiorini, S. (2003). The Approval-Voting Polytope: Combinatorial Interpretation of the Facets. Mathématiques et sciences humaines, 161, 29-39.
  4. 88. Doignon, J.-P., & Fiorini, S. (2002). Facets of the weak order polytope derived from the induced partition projection. SIAM journal on discrete mathematics, 15, 112-121. doi:10.1137/S0895480100369936
  5. 89. Fiorini, S. (2001). Determining the automorphism group of the linear ordering polytope. Discrete applied mathematics, 112, 121-128.
  6. 90. Fiorini, S. (1999). Polyhedral aspects of partial orders and comparability graphs. Electronic Notes in Discrete Mathematics, 2, 171. doi:10.1016/S1571-0653(04)00033-2
    7.   Communications publiées lors de congrès ou colloques nationaux et internationaux (6)
  7. 1. Aprile, M., Faenza, Y., Fiorini, S., Huynh, T., & Macchia, M. (2017). Extension Complexity of Stable Set Polytopes of Bipartite Graphs. In WG: Vol. 10520 (pp. 75-87). (Lecture Notes in Computer Science). Springer.
  8. 2. Camby, E., Cardinal, J., Fiorini, S., & Schaudt, O. (2012). The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (29-31 mai 2012: Munich, Allemagne)
  9. 3. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & De Wolf, R. (2012). Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. Proceedings of the Symposium on Theory of Computing (STOC) 2012 (pp. 95-106). doi:10.1145/2213977.2213988
  10. 4. Engelbeen, C., Fiorini, S., & Kiesel, A. (2009). A closest vector problem arising in radiation therapy planning. Japan Conference on Computational Geometry and Graphs (11-13 novembre 2009: Kanazawa - Japon)
  11. 5. Fiorini, S., Hardy, N., Reed, B., & Vetta, A. (2005). Approximate min-max relations for odd cycles in planar graphs. 11th conference on Integer Programming and Combinatorial Optimization (pp. 35-50) IPCO 2005(8–10 juin 2005: Berlin, Allemagne).
  12. 6. Fiorini, S., Hardy, N., Reed, B., & Vetta, A. (2005). Planar graph bipartization in linear time. Graphs, Algorithm, Combinatorics (pp. 265-271) GRACO 2005(27–29 avril 2005: Angra dos Reis (Rio de Janeiro), Br´esil).
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 Suivant >>