The following pages link to Jesús A. De Loera (Q277207):
Displaying 50 items.
- The many aspects of counting lattice points in polytopes (Q2491985) (← links)
- A computational study of integer programming algorithms based on Barvinok's rational functions (Q2568332) (← links)
- A rainbow Ramsey analogue of Rado's theorem (Q2629294) (← links)
- Short rational functions for toric algebra and applications (Q2643547) (← links)
- Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
- Tverberg-type theorems with altered intersection patterns (nerves) (Q2664116) (← links)
- Extremal properties for dissections of convex 3-polytopes (Q2706196) (← links)
- Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases (Q2819750) (← links)
- Intermediate sums on polyhedra. II: Bidegree and Poisson formula (Q2827909) (← links)
- On Volumes of Permutation Polytopes (Q2848993) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Pareto optima of multicriteria integer linear programs (Q2901044) (← links)
- Transportation problems and simplicial polytopes that are not weakly vertex-decomposable (Q2925352) (← links)
- Parametric polyhedra with at least k lattice points: Their semigroup structure and the k-Frobenius problem (Q2957201) (← links)
- On Chubanov's Method for Linear Programming (Q2962562) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- How to integrate a polynomial over a simplex (Q3081285) (← links)
- On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect (Q3413592) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- Combinatorics and Geometry of Transportation Polytopes: An Update (Q3464532) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- FPTAS for mixed-integer polynomial optimization with a fixed number of variables (Q3581508) (← links)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization (Q4609983) (← links)
- The Complexity of Three-Way Statistical Tables (Q4651494) (← links)
- (Q4790462) (← links)
- (Q4904855) (← links)
- Tverberg theorems over discrete sets of points (Q4998740) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data (Q5037559) (← links)
- Optimizing Sparsity over Lattices and Semigroups (Q5041733) (← links)
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
- Average behavior of minimal free resolutions of monomial ideals (Q5223158) (← links)
- The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential (Q5230318) (← links)
- Algebraic and Topological Tools in Linear Optimization (Q5238716) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Coefficients of Sylvester's Denumerant (Q5262025) (← links)
- Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility (Q5301623) (← links)
- Viro's method disproves Ragsdale's conjecture (Q5361550) (← links)
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility (Q5372620) (← links)
- Algebraic, Geometric, and Topological Methods in Optimization (Q5378046) (← links)
- Integer Polynomial Optimization in Fixed Dimension (Q5387970) (← links)
- Computation in multicriteria matroid optimization (Q5406201) (← links)
- Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem (Q5418983) (← links)
- (Q5692690) (← links)
- (Q5701854) (← links)
- Integer Programming and Combinatorial Optimization (Q5712457) (← links)
- Integer Programming and Combinatorial Optimization (Q5712465) (← links)
- Sparse Solutions of Linear Diophantine Equations (Q5737776) (← links)
- All Linear and Integer Programs Are Slim 3‐Way Transportation Programs (Q5757350) (← links)
