The following pages link to (Q3951161):
Displaying 20 items.
- A Helly theorem for convexity in graphs (Q799698) (← links)
- Communication complexity and combinatorial lattice theory (Q1309387) (← links)
- Helly-type theorems and generalized linear programming (Q1338955) (← links)
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem (Q1707415) (← links)
- Optimality certificates for convex minimization and Helly numbers (Q1728383) (← links)
- Some cut-generating functions for second-order conic sets (Q1751217) (← links)
- Quantitative \((p, q)\) theorems in combinatorial geometry (Q2012541) (← links)
- Discrete quantitative Helly-type theorems with boxes (Q2040992) (← links)
- The voice of optimization (Q2051238) (← links)
- Quantitative Tverberg theorems over lattices and other discrete sets (Q2408215) (← links)
- Two-halfspace closure (Q2689824) (← links)
- Maximal \(S\)-free convex sets and the Helly number (Q2835843) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Centerpoints: A Link Between Optimization and Convex Geometry (Q3186488) (← links)
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem (Q4602859) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
- Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner \((p, q)\)-theorem (Q5881548) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- On Helly numbers of exponential lattices (Q6189691) (← links)
