The following pages link to Jesús A. De Loera (Q277207):
Displaying 50 items.
- (Q119078) (redirect page) (← links)
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- \(h\)-vectors of small matroid complexes (Q426768) (← links)
- (Q491736) (redirect page) (← links)
- Weak orientability of matroids and polynomial equations (Q491739) (← links)
- Quantitative combinatorial geometry for continuous parameters (Q517447) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- The central curve in linear programming (Q695626) (← links)
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra (Q695630) (← links)
- Erratum to: ``The Gromov norm of the product of two surfaces'' (Q837650) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- \(N\)-fold integer programming (Q951095) (← links)
- Triangulations. Structures for algorithms and applications (Q986135) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- On the need of convexity in patchworking (Q1271890) (← links)
- The number of geometric bistellar neighbors of a triangulation (Q1283745) (← links)
- \(Q\)-matrix recognition via secondary and universal polytopes (Q1300268) (← links)
- Algebraic unimodular counting (Q1424267) (← links)
- (Q1627214) (redirect page) (← links)
- Random numerical semigroups and a simplicial complex of irreducible semigroups (Q1627215) (← links)
- Random monomial ideals (Q1628515) (← links)
- Edges versus circuits: a hierarchy of diameters in polyhedra (Q1707378) (← links)
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem (Q1707415) (← links)
- The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← links)
- (Q1743169) (redirect page) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- Vertices of Gelfand-Tsetlin polytopes (Q1764160) (← links)
- Counting integer flows in networks (Q1767489) (← links)
- The Gromov norm of the product of two surfaces (Q1767609) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- A polytopal generalization of Sperner's lemma (Q1865380) (← links)
- Gröbner bases and graph colorings (Q1892780) (← links)
- Gröbner bases and triangulations of the second hypersimplex (Q1900188) (← links)
- Nonregular triangulations of products of simplices (Q1913597) (← links)
- An effective version of Pólya's theorem on positive definite forms (Q1917390) (← links)
- The polytope of all triangulations of a point configuration (Q1917625) (← links)
- Software for exact integration of polynomials over polyhedra (Q1931269) (← links)
- Foundations of discrete optimization: in transition from linear to non-linear models and methods (Q1935328) (← links)
- Recognizing graph theoretic properties with polynomial ideals (Q1960266) (← links)
- Fiber polytopes for the projections between cyclic polytopes (Q1964647) (← links)
- Data-driven algorithm selection and tuning in optimization and signal processing (Q2043447) (← links)
- Sparse representation of vectors in lattices and semigroups (Q2118144) (← links)
- Diameters of cocircuit graphs of oriented matroids: an update (Q2121728) (← links)
- Quantitative Tverberg theorems over lattices and other discrete sets (Q2408215) (← links)
- Three Ehrhart quasi-polynomials (Q2421566) (← links)
- Markov bases of three-way tables are arbitrarily complicated (Q2457324) (← links)
- 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)
