Samuel Fiorini

According to our database, Samuel Fiorini authored at least 92 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion.

Matthew Drescher, Samuel Fiorini, Tony Huynh

Eur. J. Comb., 2024

Slack matrices, k-products, and 2-level polytopes.

Manuel Aprile, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia

Discret. Appl. Math., 2024

Integer programs with nearly totally unimodular matrices: the cographic case.

Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Michal T. Seweryn, Stefan Weltge, Yelena Yuditsky

CoRR, 2024

Total Matching and Subdeterminants.

Luca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

2023

A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams.

Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh

Discret. Appl. Math., October, 2023

A tight approximation algorithm for the cluster vertex deletion problem.

Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh

Math. Program., February, 2023

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set.

Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge

CoRR, 2023

2022

Extended formulations for stable set polytopes of graphs without two disjoint odd cycles.

Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge

Math. Program., 2022

Regular Matroids Have Polynomial Extension Complexity.

Manuel Aprile, Samuel Fiorini

Math. Oper. Res., 2022

2021

Strengthening convex relaxations of 0/1-sets using Boolean formulas.

Samuel Fiorini, Tony Huynh, Stefan Weltge

Math. Program., 2021

Bounds on the Number of 2-Level Polytopes, Cones, and Configurations.

Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich

Discret. Comput. Geom., 2021

Unavoidable Minors for Graphs with Large ℓ _p-Dimension.

Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller

Discret. Comput. Geom., 2021

Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond.

Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood

Electron. J. Comb., 2021

Integer programs with bounded subdeterminants and two nonzeros per row.

Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Improved approximation algorithms for hitting 3-vertex paths.

Samuel Fiorini, Gwenaël Joret, Oliver Schaudt

Math. Program., 2020

A simple 7/3-approximation algorithm for feedback vertex set in tournaments.

Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh

CoRR, 2020

Recognizing Cartesian products of matrices and polytopes.

Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia

CoRR, 2020

The stable set problem in graphs with bounded genus and bounded odd cycle packing number.

Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Extension complexity of the correlation polytope.

Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif

Oper. Res. Lett., 2019

Enumeration of 2-level polytopes.

Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich

Math. Program. Comput., 2019

No Small Linear Program Approximates Vertex Cover Within a Factor 2 - <i>ɛ</i>.

Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson

Math. Oper. Res., 2019

2018

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits.

Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson

Theory Comput., 2018

A Tight Erdös-Pósa Function for Wheel Minors.

Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau

SIAM J. Discret. Math., 2018

Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank.

Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge

Math. Oper. Res., 2018

Approximability of Clique Transversal in Perfect Graphs.

Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman

Algorithmica, 2018

Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts.

Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

The Excluded Minors for Isometric Realizability in the Plane.

Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis

SIAM J. Discret. Math., 2017

Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs.

Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich

Discret. Comput. Geom., 2017

A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts.

Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità

CoRR, 2017

Extension Complexity of Stable Set Polytopes of Bipartite Graphs.

Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

Cut Dominants and Forbidden Minors.

Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich

SIAM J. Discret. Math., 2016

Poset Entropy Versus Number of Linear Extensions: The Width-2 Case.

Samuel Fiorini, Selim Rexhep

Order, 2016

Average case polyhedral complexity of the maximum stable set problem.

Gábor Braun, Samuel Fiorini, Sebastian Pokutta

Math. Program., 2016

The Linear Extension Polytope of a Poset.

Jean-Paul Doignon, Samuel Fiorini, Selim Rexhep

Electron. Notes Discret. Math., 2016

Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank.

Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge

CoRR, 2016

Two-Level Polytopes with a Prescribed Facet.

Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Uncapacitated flow-based extended formulations.

Samuel Fiorini, Kanstantsin Pashkovich

Math. Program., 2015

Extended formulations, nonnegative factorizations, and randomized communication protocols.

Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary

Math. Program., 2015

Approximation Limits of Linear Programs (Beyond Hierarchies).

Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer

Math. Oper. Res., 2015

Exponential Lower Bounds for Polytopes in Combinatorial Optimization.

Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf

J. ACM, 2015

Small Extended Formulations for Cyclic Polytopes.

Yuri Bogomolov, Samuel Fiorini, Aleksandr N. Maksimenko, Kanstantsin Pashkovich

Discret. Comput. Geom., 2015

No Small Linear Program Approximates Vertex Cover within a Factor 2-ε.

Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson

CoRR, 2015

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e.

Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

A Tighter Erdős-Pósa Function for Long Cycles.

Samuel Fiorini, Audrey Herinckx

J. Graph Theory, 2014

A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces.

Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis

Graphs Comb., 2014

The Price of Connectivity for Vertex Cover.

Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt

Discret. Math. Theor. Comput. Sci., 2014

LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs.

Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman

Proceedings of the Algorithms - ESA 2014, 2014

Facets of order polytopes.

Jean-Paul Doignon, Samuel Fiorini, Selim Rexhep

Proceedings of the International Conference on Control, 2014

2013

The Representation Polyhedron of a Semiorder.

Barry Balof, Jean-Paul Doignon, Samuel Fiorini

Order, 2013

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs.

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann

J. Comb. Optim., 2013

Combinatorial bounds on nonnegative rank and extended formulations.

Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis

Discret. Math., 2013

Faster optimal algorithms for segment minimization with small maximal value.

Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young

Discret. Appl. Math., 2013

Excluded Forest Minors and the Erdős-Pósa Property.

Samuel Fiorini, Gwenaël Joret, David R. Wood

Comb. Probab. Comput., 2013

Generalised probabilistic theories and conic extensions of polytopes.

Samuel Fiorini, Serge Massar, Manas K. Patra, Hans Raj Tiwary

CoRR, 2013

Sorting under partial information (without the ellipsoid algorithm).

Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro

Comb., 2013

On Generalized Comparison-Based Sorting Problems.

Jean Cardinal, Samuel Fiorini

Proceedings of the Space-Efficient Data Structures, 2013

2012

Approximating the balanced minimum evolution problem.

Samuel Fiorini, Gwenaël Joret

Oper. Res. Lett., 2012

Minimum Entropy Combinatorial Optimization Problems.

Jean Cardinal, Samuel Fiorini, Gwenaël Joret

Theory Comput. Syst., 2012

Small minors in dense graphs.

Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood

Eur. J. Comb., 2012

Extended Formulations for Polygons.

Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary

Discret. Comput. Geom., 2012

Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds.

Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs.

Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

A closest vector problem arising in radiation therapy planning.

Céline Engelbeen, Samuel Fiorini, Antje Kiesel

J. Comb. Optim., 2011

Extended formulations, non-negative factorizations and randomized communication protocols

Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary

CoRR, 2011

The Stackelberg Minimum Spanning Tree Game.

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann

Algorithmica, 2011

2010

The VPN Problem with Concave Costs.

Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis

SIAM J. Discret. Math., 2010

An Efficient Algorithm for Partial Order Production.

Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro

SIAM J. Comput., 2010

Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy.

Céline Engelbeen, Samuel Fiorini

Networks, 2010

Hitting Diamonds and Growing Cacti.

Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

On a theorem of Sewell and Trotter.

Samuel Fiorini, Gwenaël Joret

Eur. J. Comb., 2009

On the feedback vertex set polytope of a series-parallel graph.

Samuel Fiorini, Odile Marcotte

Discret. Optim., 2009

Weighted graphs defining facets: A connection between stable set and linear ordering polytopes.

Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret

Discret. Optim., 2009

2008

Minimum entropy orientations.

Jean Cardinal, Samuel Fiorini, Gwenaël Joret

Oper. Res. Lett., 2008

Minimum entropy coloring.

Jean Cardinal, Samuel Fiorini, Gwenaël Joret

J. Comb. Optim., 2008

Planar graph bipartization in linear time.

Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta

Discret. Appl. Math., 2008

Tight Results on Minimum Entropy Set Cover.

Jean Cardinal, Samuel Fiorini, Gwenaël Joret

Algorithmica, 2008

2007

K. Aardal, G. Nemhauser, R. Weismantel (Eds.), Handbooks in Operations Research and Management Science, Vol. 12, Discrete Optimization, Elsevier, Amsterdam, The Netherlands, 2006, ISBN: 0-444-51507-0, 607 pp., EUR 179, $197.

Samuel Fiorini

Oper. Res. Lett., 2007

Approximate min-max relations for odd cycles in planar graphs.

Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta

Math. Program., 2007

A note on the precedence-constrained class sequencing problem.

José R. Correa, Samuel Fiorini, Nicolás E. Stier Moses

Discret. Appl. Math., 2007

2006

0, 1/2-Cuts and the Linear Ordering Problem: Surfaces That Define Facets.

Samuel Fiorini

SIAM J. Discret. Math., 2006

How to recycle your facets.

Samuel Fiorini

Discret. Optim., 2006

2005

On a weighted generalization of alpha-critical graphs.

Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret

Electron. Notes Discret. Math., 2005

2004

The Biorder Polytope.

Julie Christophe, Jean-Paul Doignon, Samuel Fiorini

Order, 2004

The facets and the symmetries of the approval-voting polytope.

Jean-Paul Doignon, Samuel Fiorini

J. Comb. Theory B, 2004

Weak order polytopes.

Samuel Fiorini, Peter C. Fishburn

Discret. Math., 2004

On minimum entropy graph colorings.

Jean Cardinal, Samuel Fiorini, Gilles Van Assche

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Extendability of Cyclic Orders.

Samuel Fiorini, Peter C. Fishburn

Order, 2003

A combinatorial study of partial order polytopes.

Samuel Fiorini

Eur. J. Comb., 2003

Facets of linear signed order polytopes.

Samuel Fiorini, Peter C. Fishburn

Discret. Appl. Math., 2003

2001

Facets of the Weak Order Polytope Derived from the Induced Partition Projection.

Jean-Paul Doignon, Samuel Fiorini

SIAM J. Discret. Math., 2001

Determining the automorphism group of the linear ordering polytope.

Samuel Fiorini

Discret. Appl. Math., 2001

1999

Polyhedral aspects of partial orders and comparability graphs.

Samuel Fiorini

Electron. Notes Discret. Math., 1999