Articles dans des revues avec comité de lecture (90)
  1. 25. Bogomolov, Y., Fiorini, S., Maksimenko, A., & Pashkovich, K. (2015). Small Extended Formulations for Cyclic Polytopes. Discrete & computational geometry, 53(4), 809-816. doi:10.1007/s00454-015-9682-1
  2. 26. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & De Wolf, R. (2015). Exponential lower bounds for polytopes in combinatorial optimization. Journal of the Association for Computing Machinery, 62(2), 17. doi:10.1145/2716307
  3. 27. Fiorini, S., Massar, S., Patra, M. K., & Tiwary, H. R. (2015). Generalized probabilistic theories and conic extensions of polytopes. Journal of Physics A: Mathematical and Theoretical, 48(2), 025302. doi:10.1088/1751-8113/48/2/025302
  4. 28. Bohn, A., Faenza, Y., Fiorini, S., Fisikopoulos, V., Macchia, M., & Pashkovich, K. (2015). Enumeration of 2-level polytopes. Lecture notes in computer science, 9294, 191-202. doi:10.1007/978-3-662-48350-3_17
  5. 29. Braun, G., Pokutta, S., & Fiorini, S. (2014). Average case polyhedral complexity of the maximum stable set problem. Leibniz international proceedings in informatics, 28, 515-530. doi:10.4230/LIPIcs.APPROX-RANDOM.2014.515
  6. 30. Faenza, Y., Fiorini, S., Grappe, R., & Tiwary, H. R. (2014). Extended formulations, nonnegative factorizations, and randomized communication protocols. Mathematical programming, 153(1), 75-94. doi:10.1007/s10107-014-0755-3
  7. 31. Fiorini, S., & Herinckx, A. (2014). A tighter Erdós-Põsa function for long cycles. Journal of graph theory, 77(2), 111-116. doi:10.1002/jgt.21776
  8. 32. Fiorini, S., Krithika, R., Narayanaswamy, N. N., & Raman, V. (2014). LP approaches to improved approximation for clique transversal in perfect graphs. Lecture notes in computer science, 8737 LNCS, 430-442. doi:10.1007/978-3-662-44777-2-36
  9. 33. Camby, E., Cardinal, J., Fiorini, S., & Schaudt, O. (2014). The price of connectivity for vertex cover. Discrete mathematics and theoretical computer science, 16(1), 207-224.
  10. 34. Clarke, N., Fiorini, S., Joret, G., & Theis, D. (2014). A note on the cops and robber game on graphs embedded in non-orientable surfaces. Graphs and combinatorics, 30(1), 119-124. doi:10.1007/s00373-012-1246-z
  11. 35. Cardinal, J., & Fiorini, S. (2013). On generalized comparison-based sorting problems. Lecture notes in computer science, 8066 LNCS, 164-175. doi:10.1007/978-3-642-40273-9_12
  12. 36. Fiorini, S., Joret, G., & Wood, D. (2013). Excluded forest minors and the Erdös-Pósa property. Combinatorics, probability & computing, 22(5), 700-721. doi:10.1017/S0963548313000266
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 Suivant >>