Samuel Fiorini

Samuel Fiorini is Associate Professor in the Department of Mathematics at the Université libre de Bruxelles (ULB), member of the Algebra and Combinatorics group (CP 216). His research centres on polyhedral combinatorics, extended formulations, combinatorial optimisation and approximation algorithms, with frequent overlap into structural graph theory.

Research in depth:
Fiorini’s work explores how high-dimensional polytopes can sometimes be expressed compactly through extended formulations, proving exponential lower bounds when they cannot. He has contributed new approximation algorithms for classical problems such as vertex cover, clique transversal and odd-cycle packing, and has advanced the understanding of sorting and entropy in partially ordered sets. His papers often combine tools from graph minors, communication complexity and polyhedral theory.

Scientific recognition:

• Best Paper Award, 44th ACM Symposium on Theory of Computing (STOC 2012)
• Programme committees: FOCS, IPCO, APPROX, STACS, WAOA
• Organiser, Sixth Cargese Workshop on Combinatorial Optimization

Advising & grants:
He currently supervises PhD students Carole Muller and Matthew Drescher and has mentored six completed PhDs as well as more than a dozen post-doctoral researchers. His group has been supported by an ERC starting grant and other national and international projects focusing on polyhedral approaches to hard optimisation problems.

Lab & team:
Fiorini leads a vibrant team within the Algebra and Combinatorics cluster at ULB, maintaining active collaborations with researchers worldwide and hosting frequent visitors working on discrete optimisation and polyhedral combinatorics.