81 citations · 388 across the 46 of their papers we have counts for
56 papers
Polyhedral extended formulations that approximate the Gomory closure for packing problems
Friedrich Eisenbrand, Samuel Fiorini, Lars Rohwedder +1
We consider packing problems , with . A way to solve such problems is via tighteni…
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini +2
We consider the feedback vertex set problem in undirected graphs (FVS). The input to FVS is an undirected graph with non-negative vertex costs. The goal is to find a mini…
Slack matrices, -products, and -level polytopes
Manuel Aprile, Michele Conforti, Yuri Faenza +3
In this paper, we study algorithmic questions concerning products of matrices and their consequences for recognition algorithms for polyhedra. The 1-product of matrices , $S_2…
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Manuel Aprile, Samuel Fiorini, Tony Huynh +2
Let be a connected -vertex graph in a proper minor-closed class . We prove that the extension complexity of the spanning tree polytope of is . Th…
Integer programs with bounded subdeterminants and two nonzeros per row
Samuel Fiorini, Gwenaël Joret, Stefan Weltge +1
We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at…
A simple -approximation algorithm for Split Vertex Deletion
Matthew Drescher, Samuel Fiorini, Tony Huynh
A split graph is a graph whose vertex set can be partitioned into a clique and a stable set. Given a graph and weight function , the Split Vert…