Gröner Bases and Triangulations of the Second Hypersimplex. - Jesús A. De Loera; Bernd Sturmfels; Rekha R. Thomas (Comb., 1995)

Nonregular Triangulations of Products of Simplices. - Jesús A. De Loera (Discret. Comput. Geom., 1996)

The Number of Geometric Bistellar Neighbors of a Triangulation. - Jesús A. De Loera; Francisco Santos; Jorge Urrutia (Discret. Comput. Geom., 1999)

Q-matrix recognition via secondary and universal polytopes. - Jesús A. De Loera; Walter D. Morris Jr. (Math. Program., 1999)

Viro's method disproves Ragsdale's conjecture: a story. - Jesús A. De Loera; Frederick J. Wicklin (SCG, 2000)

Finding minimal triangulations of convex 3-polytopes is NP-hard. - Alexander Below; Jesús A. De Loera; Jürgen Richter-Gebert (SODA, 2000)

Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes. - Alexander Below; Ulrich Brehm; Jesús A. De Loera; Jürgen Richter-Gebert (Discret. Comput. Geom., 2000)

Fiber Polytopes for the Projections between Cyclic Polytopes. - Christos A. Athanasiadis; Jesús A. De Loera; Victor Reiner; Francisco Santos (Eur. J. Comb., 2000)

Extremal Properties for Dissections of Convex 3-Polytopes. - Jesús A. De Loera; Francisco Santos; Fumihiko Takeuchi (SIAM J. Discret. Math., 2001)

Guest Editors' Foreword. - Jesús A. De Loera; Frank Sottile; Bernd Sturmfels (Discret. Comput. Geom., 2002)

A Polytopal Generalization of Sperner's Lemma. - Jesús A. De Loera; Elisha Peterson; Francis Edward Su (J. Comb. Theory A, 2002)

Algebraic unimodular counting. - Jesús A. De Loera; Bernd Sturmfels (Math. Program., 2003)

Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions. - Jesús A. De Loera; David Haws; Raymond Hemmecke; Peter Huggins; Ruriko Yoshida (IPCO, 2004)

All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables. - Jesús A. De Loera; Shmuel Onn (IPCO, 2004)

Vertices of Gelfand-Tsetlin Polytopes. - Jesús A. De Loera; Tyrrell B. McAllister (Discret. Comput. Geom., 2004)

Counting Integer Flows in Networks. - Maria Welleda Baldoni-Silva; Jesús A. De Loera; Michèle Vergne (Found. Comput. Math., 2004)

The complexity of finding small triangulations of convex 3-polytopes. - Alexander Below; Jesús A. De Loera; Jürgen Richter-Gebert (J. Algorithms, 2004)

Short rational functions for toric algebra and applications. - Jesús A. De Loera; David Haws; Raymond Hemmecke; Peter Huggins; Bernd Sturmfels; Ruriko Yoshida (J. Symb. Comput., 2004)

Effective lattice point counting in rational convex polytopes. - Jesús A. De Loera; Raymond Hemmecke; Jeremiah Tauzer; Ruriko Yoshida (J. Symb. Comput., 2004)

The Complexity of Three-Way Statistical Tables. - Jesús A. De Loera; Shmuel Onn (SIAM J. Comput., 2004)

Problem 11085. - Matthias Beck; Jesús A. De Loera; Mike Develin; Julian Pfeifle (Am. Math. Mon., 2004)

Fast Computation of Clebsch-Gordan Coefficients. - Jesús A. De Loera; Tyrrell B. McAllister (Algorithmic Algebra and Logic, 2005)

A computational study of integer programming algorithms based on Barvinok's rational functions. - Jesús A. De Loera; David Haws; Raymond Hemmecke; Peter Huggins; Ruriko Yoshida (Discret. Optim., 2005)

FPTAS for mixed-integer polynomial optimization with a fixed number of variables. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (SODA, 2006)

On the Computation of Clebsch-Gordan Coefficients and the Dilation Effect. - Jesús A. De Loera; Tyrrell B. McAllister (Exp. Math., 2006)

Markov bases of three-way tables are arbitrarily complicated. - Jesús A. De Loera; Shmuel Onn (J. Symb. Comput., 2006)

Integer Polynomial Optimization in Fixed Dimension. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (Math. Oper. Res., 2006)

All Linear and Integer Programs Are Slim 3-Way Transportation Programs. - Jesús A. De Loera; Shmuel Onn (SIAM J. Optim., 2006)

Some Linear Recurrences: 11085. - Matthias Beck; Jesús A. De Loera; Mike Develin; Julian Pfeifle (Am. Math. Mon., 2006)

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility. - Jesús A. De Loera; Jon Lee 001; Peter N. Malkin; Susan Margulies (ISSAC, 2008)

N-fold integer programming. - Jesús A. De Loera; Raymond Hemmecke; Shmuel Onn; Robert Weismantel (Discret. Optim., 2008)

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (Math. Program., 2008)

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. - Jesús A. De Loera; Jon Lee 001; Susan Margulies; Shmuel Onn (Comb. Probab. Comput., 2009)

Ehrhart Polynomials of Matroid Polytopes and Polymatroids. - Jesús A. De Loera; David C. Haws; Matthias Köppe (Discret. Comput. Geom., 2009)

Pareto Optima of Multicriteria Integer Linear Programs. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe (INFORMS J. Comput., 2009)

Graphs of transportation polytopes. - Jesús A. De Loera; Edward D. Kim; Shmuel Onn; Francisco Santos (J. Comb. Theory A, 2009)

Computation in multicriteria matroid optimization. - Jesús A. De Loera; David C. Haws; Jon Lee 001; Allison O'Hair (ACM J. Exp. Algorithmics, 2009)

Recognizing Graph Theoretic Properties with Polynomial Ideals. - Jesús A. De Loera; Christopher J. Hillar; Peter N. Malkin; Mohamed Omar (Electron. J. Comb., 2010)

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. - Jesús A. De Loera; Jon Lee 001; Peter N. Malkin; Susan Margulies (J. Symb. Comput., 2011)

How to integrate a polynomial over a simplex. - Velleda Baldoni; Nicole Berline; Jesús A. De Loera; Matthias Köppe; Michèle Vergne (Math. Comput., 2011)

h-Vectors of Small Matroid Complexes. - Jesús A. De Loera; Yvonne Kemper; Steven Klee (Electron. J. Comb., 2012)

Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra. - Velleda Baldoni; Nicole Berline; Jesús A. De Loera; Matthias Köppe; Michèle Vergne (Found. Comput. Math., 2012)

The Central Curve in Linear Programming. - Jesús A. De Loera; Bernd Sturmfels; Cynthia Vinzant (Found. Comput. Math., 2012)

Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable. - Jesús A. De Loera; Steven Klee (Math. Oper. Res., 2012)

Algebraic and Geometric Ideas in the Theory of Discrete Optimization. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe (SIAM, 2013)

Combinatorics and geometry of transportation polytopes: An update. - Jesús A. De Loera; Edward D. Kim (Discrete Geometry and Algebraic Combinatorics, 2013)

Software for exact integration of polynomials over polyhedra. - Jesús A. De Loera; Brandon E. Dutra; Matthias Köppe; S. Moreinis; G. Pinto; J. Wu (Comput. Geom., 2013)

Polyhedral Embeddings of Cayley Graphs. - Jesús A. De Loera; Yvonne Kemper (Electron. Notes Discret. Math., 2013)

Systems of Polynomials for Detecting Orientable Matroids. - Jesús A. De Loera; Jon Lee 001; Susan Margulies; Jacob Miller 002 (Electron. Notes Discret. Math., 2013)

Preface. - Jesús A. De Loera; Thomas M. Liebling; Miguel A. Pizaña; Gelasio Salazar (Electron. Notes Discret. Math., 2013)

Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem. - Iskander Aliev; Jesús A. De Loera; Quentin Louveaux (IPCO, 2014)

Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals. - Jesús A. De Loera; Susan Margulies; Michael Pernpeintner; Eric Riedl; David Rolnick; Gwen Spencer; Despina Stasi; Jon Swenson (CoRR, 2014)

On Chubanov's Method for Linear Programming. - Amitabh Basu; Jesús A. De Loera; Mark Junod (INFORMS J. Comput., 2014)

Graph-Coloring Ideals: Nullstellensatz Certificates, Gröbner Bases for Chordal Graphs, and Hardness of Gröbner Bases. - Jesús A. De Loera; Susan Margulies; Michael Pernpeintner; Eric Riedl; David Rolnick; Gwen Spencer; Despina Stasi; Jon Swenson (ISSAC, 2015)

Weak orientability of matroids and polynomial equations. - Jesús A. De Loera; Jon Lee 001; Susan Margulies; Jacob Miller 002 (Eur. J. Comb., 2015)

Coefficients of Sylvester's Denumerant. - Velleda Baldoni; Nicole Berline; Jesús A. De Loera; Brandon E. Dutra; Matthias Köppe; Michèle Vergne (Integers, 2015)

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond. - Jesús A. De Loera; Raymond Hemmecke; Jon Lee 001 (SIAM J. Optim., 2015)

A rainbow Ramsey analogue of Rado's theorem. - Jesús A. De Loera; Reuben N. La Haye; Amanda Montejano; Déborah Oliveros; Edgardo Roldán-Pensado (Discret. Math., 2016)

Random sampling in computational algebra: Helly numbers and violator spaces. - Jesús A. De Loera; Sonja Petrovic; Despina Stasi (J. Symb. Comput., 2016)

A quantitative Doignon-Bell-Scarf theorem. - Iskander Aliev; Robert Bassett; Jesús A. De Loera; Quentin Louveaux (Comb., 2017)

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg. - Jesús A. De Loera; Xavier Goaoc; Frédéric Meunier; Nabil H. Mustafa (CoRR, 2017)

Quantitative Combinatorial Geometry for Continuous Parameters. - Jesús A. De Loera; Reuben N. La Haye; David Rolnick; Pablo Soberón (Discret. Comput. Geom., 2017)

Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets. - Jesús A. De Loera; Reuben N. La Haye; David Rolnick; Pablo Soberón (Discret. Comput. Geom., 2017)

Sparse Solutions of Linear Diophantine Equations. - Iskander Aliev; Jesús A. De Loera; Timm Oertel; Christopher O'Neill (SIAM J. Appl. Algebra Geom., 2017)

A Sampling Kaczmarz-Motzkin Algorithm for Linear Feasibility. - Jesús A. De Loera; Jamie Haddock; Deanna Needell (SIAM J. Sci. Comput., 2017)

Random Numerical Semigroups and a Simplicial Complex of Irreducible Semigroups. - Jesús A. De Loera; Christopher O'Neill; Dane Wilburne (Electron. J. Comb., 2018)

Integer and Mixed Integer Tverberg Numbers. - Jesús A. De Loera; Thomas A. Hogan; Frédéric Meunier; Nabil H. Mustafa (CoRR, 2018)

Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns. - Jesús A. De Loera; Thomas A. Hogan; Déborah Oliveros; Dominic Yang (CoRR, 2018)

The hierarchy of circuit diameters and transportation polytopes. - Steffen Borgwardt; Jesús A. De Loera; Elisabeth Finhold; Jacob Miller 002 (Discret. Appl. Math., 2018)

The diameters of network-flow polytopes satisfy the Hirsch conjecture. - Steffen Borgwardt; Jesús A. De Loera; Elisabeth Finhold (Math. Program., 2018)

The Support of Integer Optimal Solutions. - Iskander Aliev; Jesús A. De Loera; Friedrich Eisenbrand; Timm Oertel; Robert Weismantel (SIAM J. Optim., 2018)

Data-driven Algorithm Selection and Parameter Tuning: Two Case studies in Optimization and Signal Processing. - Jesús A. De Loera; Jamie Haddock; Anna Ma; Deanna Needell (CoRR, 2019)

Optimizing Sparsity over Lattices and Semigroups. - Iskander Aliev; Gennadiy Averkov; Jesús A. De Loera; Timm Oertel (IPCO, 2020)

The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential. - Jesús A. De Loera; Jamie Haddock; Luis Rademacher (SIAM J. Comput., 2020)

Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data. - Jesús A. De Loera; Thomas A. Hogan (SIAM J. Math. Data Sci., 2020)

Data-driven algorithm selection and tuning in optimization and signal processing. - Jesús A. De Loera; Jamie Haddock; Anna Ma; Deanna Needell (Ann. Math. Artif. Intell., 2021)

Diameters of Cocircuit Graphs of Oriented Matroids: An Update. - Ilan Adler; Jesús A. De Loera; Steven Klee; Zhenyang Zhang (Electron. J. Comb., 2021)

(Machine) Learning to Improve the Empirical Performance of Discrete Algorithms. - Imran Adham; Jesús A. De Loera; Zhenyang Zhang (CoRR, 2021)

Tverberg-Type Theorems with Altered Intersection Patterns (Nerves). - Jesús A. De Loera; Thomas A. Hogan; Déborah Oliveros; Dominic Yang (Discret. Comput. Geom., 2021)

On the Length of Monotone Paths in Polyhedra. - Moïse Blanchard; Jesús A. De Loera; Quentin Louveaux (SIAM J. Discret. Math., 2021)

Rado Numbers and SAT Computations. - Yuan Chang; Jesús A. De Loera; William J. Wesley (ISSAC, 2022)

Geometric Policy Iteration for Markov Decision Processes. - Yue Wu; Jesús A. De Loera (KDD, 2022)

Turning Mathematics Problems into Games: Reinforcement Learning and Gröbner bases together solve Integer Feasibility Problems. - Yue Wu; Jesús A. De Loera (CoRR, 2022)

Enumerative problems for arborescences and monotone paths on polytope graphs. - Christos A. Athanasiadis; Jesús A. De Loera; Zhenyang Zhang (J. Graph Theory, 2022)

Sparse representation of vectors in lattices and semigroups. - Iskander Aliev; Gennadiy Averkov; Jesús A. De Loera; Timm Oertel (Math. Program., 2022)

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization. - Jesús A. De Loera; Sean Kafer; Laura Sanità (SIAM J. Optim., 2022)

A Model for Birdwatching and other Chronological Sampling Activities. - Jesús A. De Loera; Edgar Jaramillo-Rodriguez; Déborah Oliveros; Antonio J. Torres (Am. Math. Mon., 2023)

The Polyhedral Geometry of Pivot Rules and Monotone Paths. - Alexander E. Black; Jesús A. De Loera; Niklas Lütjeharms; Raman Sanyal (SIAM J. Appl. Algebra Geom., 2023)

Monotone Paths on Cross-Polytopes. - Alexander E. Black; Jesús A. De Loera (Discret. Comput. Geom., 2023)

Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones. - Jesús A. De Loera; Brittney Marsters; Luze Xu; Shixuan Zhang (IPCO, 2024)

Irreducible Markov Chains on spaces of graphs with fixed degree-color sequences. - Félix Almendra-Hernández; Jesús A. De Loera; Sonja Petrovic (CoRR, 2024)

Optimization tools for computing colorings of [1,...,n] with few monochromatic solutions on 3-variable linear equations. - Jesús A. De Loera; Denae Ventura; Liuyue Wang; William J. Wesley (Discret. Appl. Math., 2025)

On the Simplex Method for 0/1-Polytopes. - Alexander E. Black; Jesús A. De Loera; Sean Kafer; Laura Sanità (Math. Oper. Res., 2025)