The following pages link to Manuel Aprile (Q1687903):
Displaying 12 items.
- Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
- Recognizing Cartesian products of matrices and polytopes (Q2056923) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Graph fragmentation problem: analysis and synthesis (Q6066278) (← links)
- The role of rationality in integer-programming relaxations (Q6126664) (← links)
- A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams (Q6162034) (← links)
