The following pages link to Samuel Fiorini (Q210516):
Displayed 45 items.
- Cut Dominants and Forbidden Minors (Q2818204) (← links)
- Two-Level Polytopes with a Prescribed Facet (Q2835684) (← links)
- On Generalized Comparison-Based Sorting Problems (Q2848974) (← links)
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs (Q2921429) (← links)
- A Tighter Erdős-Pósa Function for Long Cycles (Q2922220) (← links)
- The Excluded Minors for Isometric Realizability in the Plane (Q2968517) (← links)
- Average Case Polyhedral Complexity of the Maximum Stable Set Problem (Q2969642) (← links)
- The VPN Problem with Concave Costs (Q3008029) (← links)
- (Q3023981) (← links)
- Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy (Q3057140) (← links)
- On a weighted generalization of α-critical graphs (Q3439372) (← links)
- (Q3439692) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Hitting Diamonds and Growing Cacti (Q3569818) (← links)
- Minimum Entropy Combinatorial Optimization Problems (Q3576040) (← links)
- Tight Results on Minimum Entropy Set Cover (Q3595399) (← links)
- Approximate Min-max Relations for Odd Cycles in Planar Graphs (Q3596358) (← links)
- The Stackelberg Minimum Spanning Tree Game (Q3603515) (← links)
- Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits (Q4575901) (← links)
- (Q4607935) (← links)
- (Q4612478) (← links)
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles (Q5041738) (← links)
- Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
- The stable set problem in graphs with bounded genus and bounded odd cycle packing number (Q5146973) (← links)
- An efficient algorithm for partial order production (Q5172702) (← links)
- Generalized probabilistic theories and conic extensions of polytopes (Q5173106) (← links)
- Faster Optimal Algorithms for Segment Minimization with Small Maximal Value (Q5199233) (← links)
- Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank (Q5219666) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- A Tight Erdös--Pósa Function for Wheel Minors (Q5374439) (← links)
- An Efficient Algorithm for Partial Order Production (Q5390581) (← links)
- Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
- The Price of Connectivity for Vertex Cover (Q5413911) (← links)
- Linear vs. semidefinite extended formulations (Q5415468) (← links)
- 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets (Q5426879) (← links)
- Algorithms and Computation (Q5897914) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Determining the automorphism group of the linear ordering polytope (Q5946819) (← links)
- Poset entropy versus number of linear extensions: the width-2 case. (Q5965137) (← links)
- A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams (Q6162034) (← links)
- The VPN Tree Routing Conjecture for Outerplanar Networks (Q6207514) (← links)
- The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract) (Q6211959) (← links)
- A simple 7/3-approximation algorithm for feedback vertex set in tournaments (Q6347411) (← links)
- A simple $(2+\epsilon)$-approximation algorithm for Split Vertex Deletion (Q6349698) (← links)