For a finite set X ⊂ℤ^d that can be represented as X = Q
∩ℤ^d for some p...
Given a graph G, the Connected Vertex Cover problem (CVC) asks to find a...
In this paper, we study algorithmic questions concerning products of mat...
Let P be a polytope. The hitting number of P is the smallest size of a
h...
Let G be a connected n-vertex graph in a proper minor-closed class
𝒢. We...
A binarization of a bounded variable x is a linear formulation with
vari...
We show that performing just one round of the Sherali-Adams hierarchy gi...
We give the first 2-approximation algorithm for the cluster vertex delet...
The 1-product of matrices S_1 ∈R^m_1 × n_1 and S_2 ∈R^m_2 × n_2 is the m...
We prove that the extension complexity of the independence polytope of e...
Deterministic protocols are well-known tools to obtain extended formulat...