Jesús A. De Loera

Orcid: 0000-0002-9556-1112

According to our database1, Jesús A. De Loera authored at least 90 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Irreducible Markov Chains on spaces of graphs with fixed degree-color sequences.
CoRR, 2024

2023
Monotone Paths on Cross-Polytopes.
Discret. Comput. Geom., December, 2023

The Polyhedral Geometry of Pivot Rules and Monotone Paths.
SIAM J. Appl. Algebra Geom., September, 2023

A Model for Birdwatching and other Chronological Sampling Activities.
Am. Math. Mon., July, 2023

2022
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization.
SIAM J. Optim., September, 2022

Sparse representation of vectors in lattices and semigroups.
Math. Program., 2022

Enumerative problems for arborescences and monotone paths on polytope graphs.
J. Graph Theory, 2022

Turning Mathematics Problems into Games: Reinforcement Learning and Gröbner bases together solve Integer Feasibility Problems.
CoRR, 2022

Geometric Policy Iteration for Markov Decision Processes.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Rado Numbers and SAT Computations.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
On the Length of Monotone Paths in Polyhedra.
SIAM J. Discret. Math., 2021

Tverberg-Type Theorems with Altered Intersection Patterns (Nerves).
Discret. Comput. Geom., 2021

(Machine) Learning to Improve the Empirical Performance of Discrete Algorithms.
CoRR, 2021

Diameters of Cocircuit Graphs of Oriented Matroids: An Update.
Electron. J. Comb., 2021

Data-driven algorithm selection and tuning in optimization and signal processing.
Ann. Math. Artif. Intell., 2021

2020
Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data.
SIAM J. Math. Data Sci., 2020

The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential.
SIAM J. Comput., 2020

Optimizing Sparsity over Lattices and Semigroups.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019
Data-driven Algorithm Selection and Parameter Tuning: Two Case studies in Optimization and Signal Processing.
CoRR, 2019

2018
The Support of Integer Optimal Solutions.
SIAM J. Optim., 2018

The diameters of network-flow polytopes satisfy the Hirsch conjecture.
Math. Program., 2018

The hierarchy of circuit diameters and transportation polytopes.
Discret. Appl. Math., 2018

Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns.
CoRR, 2018

Integer and Mixed Integer Tverberg Numbers.
CoRR, 2018

Random Numerical Semigroups and a Simplicial Complex of Irreducible Semigroups.
Electron. J. Comb., 2018

2017
A Sampling Kaczmarz-Motzkin Algorithm for Linear Feasibility.
SIAM J. Sci. Comput., 2017

Sparse Solutions of Linear Diophantine Equations.
SIAM J. Appl. Algebra Geom., 2017

Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets.
Discret. Comput. Geom., 2017

Quantitative Combinatorial Geometry for Continuous Parameters.
Discret. Comput. Geom., 2017

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg.
CoRR, 2017

A quantitative Doignon-Bell-Scarf theorem.
Comb., 2017

2016
Random sampling in computational algebra: Helly numbers and violator spaces.
J. Symb. Comput., 2016

A rainbow Ramsey analogue of Rado's theorem.
Discret. Math., 2016

2015
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond.
SIAM J. Optim., 2015

Coefficients of Sylvester's Denumerant.
Integers, 2015

Weak orientability of matroids and polynomial equations.
Eur. J. Comb., 2015

Graph-Coloring Ideals: Nullstellensatz Certificates, Gröbner Bases for Chordal Graphs, and Hardness of Gröbner Bases.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
On Chubanov's Method for Linear Programming.
INFORMS J. Comput., 2014

Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals.
CoRR, 2014

Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013
Preface.
Electron. Notes Discret. Math., 2013

Systems of Polynomials for Detecting Orientable Matroids.
Electron. Notes Discret. Math., 2013

Polyhedral Embeddings of Cayley Graphs.
Electron. Notes Discret. Math., 2013

Combinatorics and geometry of transportation polytopes: An update.
Proceedings of the Discrete Geometry and Algebraic Combinatorics, 2013

Algebraic and Geometric Ideas in the Theory of Discrete Optimization.
MOS-SIAM Series on Optimization 14, SIAM, ISBN: 978-1-61197-243-6, 2013

2012
Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable.
Math. Oper. Res., 2012

The Central Curve in Linear Programming.
Found. Comput. Math., 2012

Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra.
Found. Comput. Math., 2012

h-Vectors of Small Matroid Complexes.
Electron. J. Comb., 2012

2011
How to integrate a polynomial over a simplex.
Math. Comput., 2011

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.
J. Symb. Comput., 2011

Software for exact integration of polynomials over polyhedra.
ACM Commun. Comput. Algebra, 2011

2010
Recognizing Graph Theoretic Properties with Polynomial Ideals.
Electron. J. Comb., 2010

2009
Computation in multicriteria matroid optimization.
ACM J. Exp. Algorithmics, 2009

Graphs of transportation polytopes.
J. Comb. Theory, Ser. A, 2009

Pareto Optima of Multicriteria Integer Linear Programs.
INFORMS J. Comput., 2009

Ehrhart Polynomials of Matroid Polytopes and Polymatroids.
Discret. Comput. Geom., 2009

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.
Comb. Probab. Comput., 2009

2008
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.
Math. Program., 2008

N-fold integer programming.
Discret. Optim., 2008

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2006
Some Linear Recurrences: 11085.
Am. Math. Mon., 2006

All Linear and Integer Programs Are Slim 3-Way Transportation Programs.
SIAM J. Optim., 2006

Integer Polynomial Optimization in Fixed Dimension.
Math. Oper. Res., 2006

Markov bases of three-way tables are arbitrarily complicated.
J. Symb. Comput., 2006

On the Computation of Clebsch-Gordan Coefficients and the Dilation Effect.
Exp. Math., 2006

FPTAS for mixed-integer polynomial optimization with a fixed number of variables.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
A computational study of integer programming algorithms based on Barvinok's rational functions.
Discret. Optim., 2005

Fast Computation of Clebsch-Gordan Coefficients.
Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2004
Problem 11085.
Am. Math. Mon., 2004

The Complexity of Three-Way Statistical Tables.
SIAM J. Comput., 2004

Effective lattice point counting in rational convex polytopes.
J. Symb. Comput., 2004

Short rational functions for toric algebra and applications.
J. Symb. Comput., 2004

The complexity of finding small triangulations of convex 3-polytopes.
J. Algorithms, 2004

Counting Integer Flows in Networks.
Found. Comput. Math., 2004

Vertices of Gelfand-Tsetlin Polytopes.
Discret. Comput. Geom., 2004

All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Algebraic unimodular counting.
Math. Program., 2003

2002
A Polytopal Generalization of Sperner's Lemma.
J. Comb. Theory, Ser. A, 2002

Guest Editors' Foreword.
Discret. Comput. Geom., 2002

2001
Extremal Properties for Dissections of Convex 3-Polytopes.
SIAM J. Discret. Math., 2001

2000
Fiber Polytopes for the Projections between Cyclic Polytopes.
Eur. J. Comb., 2000

Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes.
Discret. Comput. Geom., 2000

Finding minimal triangulations of convex 3-polytopes is NP-hard.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Viro's method disproves Ragsdale's conjecture: a story.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Q-matrix recognition via secondary and universal polytopes.
Math. Program., 1999

The Number of Geometric Bistellar Neighbors of a Triangulation.
Discret. Comput. Geom., 1999

1996
Nonregular Triangulations of Products of Simplices.
Discret. Comput. Geom., 1996

1995
Gröner Bases and Triangulations of the Second Hypersimplex.
Comb., 1995


  Loading...