Jesús A. De Loera

From MaRDI portal
Person:277207

Available identifiers

zbMath Open de-loera.jesus-aWikidataQ18685657 ScholiaQ18685657MaRDI QIDQ277207

List of research outcomes





PublicationDate of PublicationType
Rado numbers and SAT computations2025-01-17Paper
The best ways to slice a polytope2025-01-06Paper
Markov Bases: A 25 Year Update2024-07-05Paper
Weighted Ehrhart theory: extending Stanley's nonnegativity theorem2024-04-24Paper
Monotone paths on cross-polytopes2023-12-21Paper
Convexity in (Colored) Affine Semigroups2023-12-05Paper
Enumerative problems for arborescences and monotone paths on polytope graphs2023-10-04Paper
The Polyhedral Geometry of Pivot Rules and Monotone Paths2023-09-20Paper
A Model for Birdwatching and other Chronological Sampling Activities2023-05-31Paper
The Best Ways to Slice a Polytope2023-04-27Paper
Optimizing Sparsity over Lattices and Semigroups2022-10-14Paper
Rado Numbers and SAT Computations2022-10-06Paper
Ramsey Numbers through the Lenses of Polynomial Ideals and Nullstellens\"atze2022-09-28Paper
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization2022-09-14Paper
Diameters of cocircuit graphs of oriented matroids: an update2022-04-04Paper
Sparse representation of vectors in lattices and semigroups2022-03-22Paper
Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data2022-03-01Paper
On the Simplex method for 0/1 polytopes2021-11-27Paper
On the Length of Monotone Paths in Polyhedra2021-08-20Paper
Data-driven algorithm selection and tuning in optimization and signal processing2021-08-02Paper
Tverberg theorems over discrete sets of points2021-07-09Paper
Tverberg-type theorems with altered intersection patterns (nerves)2021-04-20Paper
The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential2020-02-20Paper
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg2019-10-30Paper
Algebraic and Topological Tools in Linear Optimization2019-10-28Paper
The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential2019-08-22Paper
Average behavior of minimal free resolutions of monomial ideals2019-07-17Paper
Three Ehrhart quasi-polynomials2019-06-17Paper
Algebraic, Geometric, and Topological Methods in Optimization2019-06-11Paper
Random monomial ideals2018-12-04Paper
Random numerical semigroups and a simplicial complex of irreducible semigroups2018-11-22Paper
The diameters of network-flow polytopes satisfy the Hirsch conjecture2018-09-28Paper
The Support of Integer Optimal Solutions2018-08-03Paper
Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns2018-08-01Paper
A quantitative Doignon-Bell-Scarf theorem2018-04-12Paper
The hierarchy of circuit diameters and transportation polytopes2018-04-04Paper
Edges versus circuits: a hierarchy of diameters in polyhedra2018-03-29Paper
Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem2018-03-29Paper
Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization2018-03-27Paper
A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility2017-10-27Paper
Quantitative Tverberg theorems over lattices and other discrete sets2017-10-10Paper
Viro's method disproves Ragsdale's conjecture2017-09-29Paper
Sparse Solutions of Linear Diophantine Equations2017-05-30Paper
Helly’s theorem: New variations and applications2017-04-25Paper
Quantitative combinatorial geometry for continuous parameters2017-03-23Paper
On Chubanov's Method for Linear Programming2017-02-17Paper
Parametric polyhedra with at least k lattice points: Their semigroup structure and the k-Frobenius problem2017-01-25Paper
Intermediate sums on polyhedra. II: Bidegree and Poisson formula2016-10-21Paper
Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases2016-09-29Paper
A rainbow Ramsey analogue of Rado's theorem2016-07-05Paper
Random sampling in computational algebra: Helly numbers and violator spaces2016-05-04Paper
Combinatorics and Geometry of Transportation Polytopes: An Update2016-01-27Paper
Approximating the maximum of a polynomial over a polytope: Handelman decomposition and continuous generating functions2016-01-15Paper
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond2015-12-11Paper
Weak orientability of matroids and polynomial equations2015-08-19Paper
Coefficients of Sylvester's Denumerant2015-07-09Paper
Quantitative Tverberg, Helly, & Carath\'eodory theorems2015-03-20Paper
Software for exact integration of polynomials over polyhedra2015-02-20Paper
Gr\"obner Bases and Nullstellens\"atze for Graph-Coloring Ideals2014-10-24Paper
Transportation problems and simplicial polytopes that are not weakly vertex-decomposable2014-10-21Paper
Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem2014-06-02Paper
Computation in multicriteria matroid optimization2014-04-01Paper
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes2013-11-28Paper
On Volumes of Permutation Polytopes2013-09-13Paper
Foundations of discrete optimization: in transition from linear to non-linear models and methods2013-02-14Paper
https://portal.mardi4nfdi.de/entity/Q49048552013-02-12Paper
Software for exact integration of polynomials over polyhedra2013-01-25Paper
The central curve in linear programming2012-12-21Paper
Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra2012-12-21Paper
Pareto optima of multicriteria integer linear programs2012-07-28Paper
Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization2012-07-10Paper
\(h\)-vectors of small matroid complexes2012-06-12Paper
Not all simplicial polytopes are weakly vertex-decomposable2012-03-07Paper
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz2011-12-07Paper
How to integrate a polynomial over a simplex2011-03-07Paper
Recognizing graph theoretic properties with polynomial ideals2010-10-13Paper
FPTAS for mixed-integer polynomial optimization with a fixed number of variables2010-08-16Paper
Triangulations. Structures for algorithms and applications2010-08-11Paper
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz2010-04-22Paper
Ehrhart polynomials of matroid polytopes and polymatroids2009-12-14Paper
Graphs of transportation polytopes2009-11-26Paper
Erratum to: ``The Gromov norm of the product of two surfaces2009-08-20Paper
Convex integer maximization via Graver bases2009-05-12Paper
Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility2009-01-20Paper
\(N\)-fold integer programming2008-10-29Paper
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension2008-10-16Paper
Integer Polynomial Optimization in Fixed Dimension2008-05-27Paper
Markov bases of three-way tables are arbitrarily complicated2007-10-23Paper
All Linear and Integer Programs Are Slim 3‐Way Transportation Programs2007-09-06Paper
Effective lattice point counting in rational convex polytopes2007-08-24Paper
Short rational functions for toric algebra and applications2007-08-24Paper
On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect2006-12-13Paper
The many aspects of counting lattice points in polytopes2006-05-31Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
https://portal.mardi4nfdi.de/entity/Q57018542005-11-04Paper
A computational study of integer programming algorithms based on Barvinok's rational functions2005-10-10Paper
https://portal.mardi4nfdi.de/entity/Q56926902005-09-28Paper
Counting integer flows in networks2005-03-11Paper
The Gromov norm of the product of two surfaces2005-03-08Paper
Vertices of Gelfand-Tsetlin polytopes2005-02-23Paper
The Complexity of Three-Way Statistical Tables2005-02-21Paper
Algebraic unimodular counting2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q47904622003-06-01Paper
A polytopal generalization of Sperner's lemma2003-03-26Paper
Extremal properties for dissections of convex 3-polytopes2001-03-19Paper
Fiber polytopes for the projections between cyclic polytopes2001-01-03Paper
\(Q\)-matrix recognition via secondary and universal polytopes2000-06-04Paper
The number of geometric bistellar neighbors of a triangulation1999-03-30Paper
On the need of convexity in patchworking1998-11-11Paper
An effective version of Pólya's theorem on positive definite forms1997-04-09Paper
Nonregular triangulations of products of simplices1996-11-28Paper
The polytope of all triangulations of a point configuration1996-07-07Paper
Gröbner bases and triangulations of the second hypersimplex1995-10-17Paper
Gröbner bases and graph colorings1995-06-25Paper
Markov bases: a 25 year updateN/APaper
Irreducible Markov Chains on spaces of graphs with fixed degree-color sequencesN/APaper
Sums of Weighted Lattice Points of PolytopesN/APaper
Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC ConesN/APaper

Research outcomes over time

This page was built for person: Jesús A. De Loera