Samuel Fiorini

According to our database1, Samuel Fiorini authored at least 85 papers between 1999 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





Improved approximation algorithms for hitting 3-vertex paths.
Math. Program., 2020

A simple (2+ε)-approximation algorithm for Split Vertex Deletion.
CoRR, 2020

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

A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem.
CoRR, 2020

Recognizing Cartesian products of matrices and polytopes.
CoRR, 2020

The stable set problem in graphs with bounded genus and bounded odd cycle packing number.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Extension complexity of the correlation polytope.
Oper. Res. Lett., 2019

Enumeration of 2-level polytopes.
Math. Program. Comput., 2019

No Small Linear Program Approximates Vertex Cover Within a Factor 2 - <i>ɛ</i>.
Math. Oper. Res., 2019

Regular matroids have polynomial extension complexity.
CoRR, 2019

Unavoidable minors for graphs with large 𝓁<sub>p</sub>-dimension.
CoRR, 2019

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits.
Theory Comput., 2018

A Tight Erdös-Pósa Function for Wheel Minors.
SIAM J. Discret. Math., 2018

Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank.
Math. Oper. Res., 2018

Bounds on the number of 2-level polytopes, cones and configurations.
CoRR, 2018

Approximability of Clique Transversal in Perfect Graphs.
Algorithmica, 2018

Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

The Excluded Minors for Isometric Realizability in the Plane.
SIAM J. Discret. Math., 2017

Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs.
Discret. Comput. Geom., 2017

Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas.
CoRR, 2017

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

Extension Complexity of Stable Set Polytopes of Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Cut Dominants and Forbidden Minors.
SIAM J. Discret. Math., 2016

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

Average case polyhedral complexity of the maximum stable set problem.
Math. Program., 2016

The Linear Extension Polytope of a Poset.
Electron. Notes Discret. Math., 2016

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

Two-Level Polytopes with a Prescribed Facet.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Uncapacitated flow-based extended formulations.
Math. Program., 2015

Extended formulations, nonnegative factorizations, and randomized communication protocols.
Math. Program., 2015

Approximation Limits of Linear Programs (Beyond Hierarchies).
Math. Oper. Res., 2015

Exponential Lower Bounds for Polytopes in Combinatorial Optimization.
J. ACM, 2015

Small Extended Formulations for Cyclic Polytopes.
Discret. Comput. Geom., 2015

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

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

A Tighter Erdős-Pósa Function for Long Cycles.
J. Graph Theory, 2014

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

The Price of Connectivity for Vertex Cover.
Discret. Math. Theor. Comput. Sci., 2014

LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs.
Proceedings of the Algorithms - ESA 2014, 2014

Facets of order polytopes.
Proceedings of the International Conference on Control, 2014

The Representation Polyhedron of a Semiorder.
Order, 2013

The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs.
J. Comb. Optim., 2013

Combinatorial bounds on nonnegative rank and extended formulations.
Discret. Math., 2013

Faster optimal algorithms for segment minimization with small maximal value.
Discret. Appl. Math., 2013

Excluded Forest Minors and the Erdős-Pósa Property.
Comb. Probab. Comput., 2013

Generalised probabilistic theories and conic extensions of polytopes.
CoRR, 2013

Sorting under partial information (without the ellipsoid algorithm).
Comb., 2013

On Generalized Comparison-Based Sorting Problems.
Proceedings of the Space-Efficient Data Structures, 2013

Approximating the balanced minimum evolution problem.
Oper. Res. Lett., 2012

Minimum Entropy Combinatorial Optimization Problems.
Theory Comput. Syst., 2012

Small minors in dense graphs.
Eur. J. Comb., 2012

Extended Formulations for Polygons.
Discret. Comput. Geom., 2012

Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

A closest vector problem arising in radiation therapy planning.
J. Comb. Optim., 2011

Extended formulations, non-negative factorizations and randomized communication protocols
CoRR, 2011

The Stackelberg Minimum Spanning Tree Game.
Algorithmica, 2011

The VPN Problem with Concave Costs.
SIAM J. Discret. Math., 2010

An Efficient Algorithm for Partial Order Production.
SIAM J. Comput., 2010

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

Hitting Diamonds and Growing Cacti.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

On a theorem of Sewell and Trotter.
Eur. J. Comb., 2009

On the feedback vertex set polytope of a series-parallel graph.
Discret. Optim., 2009

Weighted graphs defining facets: A connection between stable set and linear ordering polytopes.
Discret. Optim., 2009

Minimum entropy orientations.
Oper. Res. Lett., 2008

Minimum entropy coloring.
J. Comb. Optim., 2008

Tight Results on Minimum Entropy Set Cover.
Algorithmica, 2008

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.
Oper. Res. Lett., 2007

Approximate min-max relations for odd cycles in planar graphs.
Math. Program., 2007

A note on the precedence-constrained class sequencing problem.
Discret. Appl. Math., 2007

0, 1/2-Cuts and the Linear Ordering Problem: Surfaces That Define Facets.
SIAM J. Discret. Math., 2006

How to recycle your facets.
Discret. Optim., 2006

Planar graph bipartization in linear time.
Electron. Notes Discret. Math., 2005

On a weighted generalization of alpha-critical graphs.
Electron. Notes Discret. Math., 2005

The Biorder Polytope.
Order, 2004

The facets and the symmetries of the approval-voting polytope.
J. Comb. Theory, Ser. B, 2004

Weak order polytopes.
Discret. Math., 2004

On minimum entropy graph colorings.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Extendability of Cyclic Orders.
Order, 2003

A combinatorial study of partial order polytopes.
Eur. J. Comb., 2003

Facets of linear signed order polytopes.
Discret. Appl. Math., 2003

Facets of the Weak Order Polytope Derived from the Induced Partition Projection.
SIAM J. Discret. Math., 2001

Determining the automorphism group of the linear ordering polytope.
Discret. Appl. Math., 2001

Polyhedral aspects of partial orders and comparability graphs.
Electron. Notes Discret. Math., 1999