Samuel Fiorini
Cited by
Cited by
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
Exponential lower bounds for polytopes in combinatorial optimization
S Fiorini, S Massar, S Pokutta, HR Tiwary, RD Wolf
Journal of the ACM (JACM) 62 (2), 1-23, 2015
Approximation limits of linear programs (beyond hierarchies)
G Braun, S Fiorini, S Pokutta, D Steurer
Mathematics of Operations Research 40 (3), 756-772, 2015
Combinatorial bounds on nonnegative rank and extended formulations
S Fiorini, V Kaibel, K Pashkovich, DO Theis
Discrete mathematics 313 (1), 67-83, 2013
Extended formulations for polygons
S Fiorini, T Rothvo▀, HR Tiwary
Discrete & computational geometry 48 (3), 658-668, 2012
The Stackelberg minimum spanning tree game
J Cardinal, ED Demaine, S Fiorini, G Joret, S Langerman, I Newman, ...
Algorithmica 59 (2), 129-144, 2011
Extended formulations, nonnegative factorizations, and randomized communication protocols
Y Faenza, S Fiorini, R Grappe, HR Tiwary
International Symposium on Combinatorial Optimization, 129-140, 2012
A short proof of a theorem of Falmagne
S Fiorini
Journal of mathematical psychology 48 (1), 80-82, 2004
Tight results on minimum entropy set cover
J Cardinal, S Fiorini, G Joret
Algorithmica 51 (1), 49-60, 2008
Planar graph bipartization in linear time
S Fiorini, N Hardy, B Reed, A Vetta
Discrete Applied Mathematics 156 (7), 1175-1180, 2008
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
A tighter Erdős‐Pˇsa function for long cycles
S Fiorini, A Herinckx
Journal of Graph Theory 77 (2), 111-116, 2014
Determining the automorphism group of the linear ordering polytope
S Fiorini
Discrete applied mathematics 112 (1-3), 121-128, 2001
The price of connectivity for vertex cover
E Camby, J Cardinal, S Fiorini, O Schaudt
arXiv preprint arXiv:1303.2478, 2013
Polyhedral combinatorics of order polytopes
S Fiorini
These de doctorat, UniversitÚ Libre de Bruxelles, 2001
Hitting diamonds and growing cacti
S Fiorini, G Joret, U Pietropaoli
International Conference on Integer Programming and Combinatorialá…, 2010
Sorting under partial information (without the ellipsoid algorithm)
J Cardinal, S Fiorini, G Joret, RM Jungers, JI Munro
Combinatorica 33 (6), 655-697, 2013
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
J Cardinal, ED Demaine, S Fiorini, G Joret, I Newman, O Weimann
Journal of combinatorial optimization 25 (1), 19-46, 2013
Approximating the balanced minimum evolution problem
S Fiorini, G Joret
Operations research letters 40 (1), 31-35, 2012
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
The system can't perform the operation now. Try again later.
Articles 1–20