Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds S Fiorini, S Massar, S Pokutta, HR Tiwary, R De Wolf Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 270 | 2012 |

Exponential lower bounds for polytopes in combinatorial optimization S Fiorini, S Massar, S Pokutta, HR Tiwary, R De Wolf Journal of the ACM (JACM) 62 (2), 1-23, 2015 | 165 | 2015 |

Combinatorial bounds on nonnegative rank and extended formulations S Fiorini, V Kaibel, K Pashkovich, DO Theis Discrete mathematics 313 (1), 67-83, 2013 | 120 | 2013 |

Approximation limits of linear programs (beyond hierarchies) G Braun, S Fiorini, S Pokutta, D Steurer Mathematics of Operations Research 40 (3), 756-772, 2015 | 113 | 2015 |

Extended formulations for polygons S Fiorini, T Rothvoß, HR Tiwary Discrete & computational geometry 48 (3), 658-668, 2012 | 69 | 2012 |

The Stackelberg minimum spanning tree game J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ... Algorithmica 59, 129-144, 2011 | 60 | 2011 |

A short proof of a theorem of Falmagne S Fiorini Journal of mathematical psychology 48 (1), 80-82, 2004 | 56 | 2004 |

Approximating weighted tree augmentation via Chvátal-Gomory cuts S Fiorini, M Groß, J Könemann, L Sanitŕ Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 55 | 2018 |

No Small Linear Program Approximates Vertex Cover Within a Factor 2 − *ɛ*A Bazzi, S Fiorini, S Pokutta, O Svensson Mathematics of Operations Research 44 (1), 147-172, 2019 | 44 | 2019 |

Planar graph bipartization in linear time S Fiorini, N Hardy, B Reed, A Vetta Discrete Applied Mathematics 156 (7), 1175-1180, 2008 | 41 | 2008 |

Tight results on minimum entropy set cover J Cardinal, S Fiorini, G Joret Algorithmica 51, 49-60, 2008 | 37 | 2008 |

Extended formulations, nonnegative factorizations, and randomized communication protocols Y Faenza, S Fiorini, R Grappe, HR Tiwary Combinatorial Optimization: Second International Symposium, ISCO 2012 …, 2012 | 35 | 2012 |

Sorting under partial information (without the ellipsoid algorithm) J Cardinal, S Fiorini, G Joret, RM Jungers, JI Munro Proceedings of the forty-second ACM symposium on Theory of computing, 359-368, 2010 | 34 | 2010 |

Approximate min–max relations for odd cycles in planar graphs S Fiorini, N Hardy, B Reed, A Vetta Mathematical programming 110 (1), 71-91, 2007 | 32 | 2007 |

Hitting diamonds and growing cacti S Fiorini, G Joret, U Pietropaoli International Conference on Integer Programming and Combinatorial …, 2010 | 31 | 2010 |

Approximating the balanced minimum evolution problem S Fiorini, G Joret Operations research letters 40 (1), 31-35, 2012 | 30 | 2012 |

A tighter Erdős‐Pósa function for long cycles S Fiorini, A Herinckx Journal of Graph Theory 77 (2), 111-116, 2014 | 29 | 2014 |

Determining the automorphism group of the linear ordering polytope S Fiorini Discrete applied mathematics 112 (1-3), 121-128, 2001 | 28 | 2001 |

Extended formulations, nonnegative factorizations, and randomized communication protocols Y Faenza, S Fiorini, R Grappe, HR Tiwary Mathematical Programming 153 (1), 75-94, 2015 | 26 | 2015 |

The price of connectivity for vertex cover E Camby, J Cardinal, S Fiorini, O Schaudt Discrete Mathematics & Theoretical Computer Science 16 (Graph Theory), 2014 | 26 | 2014 |