Jesús A. De Loera

Sonja Petrovic

CoRR, 2024

Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

Monotone Paths on Cross-Polytopes.

[BibT_eX]

[DOI]

Alexander E. Black

Discret. Comput. Geom., December, 2023

The Polyhedral Geometry of Pivot Rules and Monotone Paths.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., September, 2023

A Model for Birdwatching and other Chronological Sampling Activities.

[BibT_eX]

[DOI]

Edgar Jaramillo-Rodriguez

Deborah Oliveros

Antonio J. Torres

Am. Math. Mon., July, 2023

2022

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization.

[BibT_eX]

[DOI]

Sean Kafer

Laura Sanità

SIAM J. Optim., September, 2022

Sparse representation of vectors in lattices and semigroups.

[BibT_eX]

[DOI]

Math. Program., 2022

Enumerative problems for arborescences and monotone paths on polytope graphs.

[BibT_eX]

[DOI]

Christos A. Athanasiadis

Zhenyang Zhang

J. Graph Theory, 2022

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

[BibT_eX]

[DOI]

Yue Wu

CoRR, 2022

Geometric Policy Iteration for Markov Decision Processes.

[BibT_eX]

[DOI]

Yue Wu

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.

[BibT_eX]

[DOI]

Yuan Chang

William J. Wesley

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.

[BibT_eX]

[DOI]

Moïse Blanchard

Quentin Louveaux

SIAM J. Discret. Math., 2021

Tverberg-Type Theorems with Altered Intersection Patterns (Nerves).

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

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

[BibT_eX]

[DOI]

Imran Adham

Zhenyang Zhang

CoRR, 2021

Diameters of Cocircuit Graphs of Oriented Matroids: An Update.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Data-driven algorithm selection and tuning in optimization and signal processing.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2021

2020

Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data.

[BibT_eX]

[DOI]

Thomas A. Hogan

SIAM J. Math. Data Sci., 2020

The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential.

[BibT_eX]

[DOI]

Jamie Haddock

Luis Rademacher

SIAM J. Comput., 2020

Optimizing Sparsity over Lattices and Semigroups.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2019

2018

The Support of Integer Optimal Solutions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

The diameters of network-flow polytopes satisfy the Hirsch conjecture.

[BibT_eX]

[DOI]

Steffen Borgwardt

Elisabeth Finhold

Math. Program., 2018

The hierarchy of circuit diameters and transportation polytopes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Integer and Mixed Integer Tverberg Numbers.

[BibT_eX]

[DOI]

CoRR, 2018

Random Numerical Semigroups and a Simplicial Complex of Irreducible Semigroups.

[BibT_eX]

[DOI]

Christopher O'Neill

Dane Wilburne

Electron. J. Comb., 2018

2017

A Sampling Kaczmarz-Motzkin Algorithm for Linear Feasibility.

[BibT_eX]

[DOI]

Jamie Haddock

Deanna Needell

SIAM J. Sci. Comput., 2017

Sparse Solutions of Linear Diophantine Equations.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2017

Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Quantitative Combinatorial Geometry for Continuous Parameters.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

A quantitative Doignon-Bell-Scarf theorem.

[BibT_eX]

[DOI]

Comb., 2017

2016

Random sampling in computational algebra: Helly numbers and violator spaces.

[BibT_eX]

[DOI]

Sonja Petrovic

Despina Stasi

J. Symb. Comput., 2016

A rainbow Ramsey analogue of Rado's theorem.

[BibT_eX]

[DOI]

Edgardo Roldán-Pensado

Discret. Math., 2016

2015

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond.

[BibT_eX]

[DOI]

Raymond Hemmecke

Jon Lee

SIAM J. Optim., 2015

Coefficients of Sylvester's Denumerant.

[BibT_eX]

[DOI]

Integers, 2015

Weak orientability of matroids and polynomial equations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Graph-Coloring Ideals: Nullstellensatz Certificates, Gröbner Bases for Chordal Graphs, and Hardness of Gröbner Bases.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

On Chubanov's Method for Linear Programming.

[BibT_eX]

[DOI]

Amitabh Basu

Mark Junod

INFORMS J. Comput., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem.

[BibT_eX]

[DOI]

Iskander Aliev

Quentin Louveaux

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Systems of Polynomials for Detecting Orientable Matroids.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Polyhedral Embeddings of Cayley Graphs.

[BibT_eX]

[DOI]

Yvonne Kemper

Electron. Notes Discret. Math., 2013

Software for exact integration of polynomials over polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Combinatorics and geometry of transportation polytopes: An update.

[BibT_eX]

[DOI]

Edward D. Kim

Proceedings of the Discrete Geometry and Algebraic Combinatorics, 2013

Algebraic and Geometric Ideas in the Theory of Discrete Optimization.

[BibT_eX]

[DOI]

Raymond Hemmecke

Matthias Köppe

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.

[BibT_eX]

[DOI]

Steven Klee

Math. Oper. Res., 2012

The Central Curve in Linear Programming.

[BibT_eX]

[DOI]

Cynthia Vinzant

Found. Comput. Math., 2012

Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra.

[BibT_eX]

[DOI]

Found. Comput. Math., 2012

h-Vectors of Small Matroid Complexes.

[BibT_eX]

[DOI]

Yvonne Kemper

Steven Klee

Electron. J. Comb., 2012

2011

How to integrate a polynomial over a simplex.

[BibT_eX]

[DOI]

Math. Comput., 2011

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

2010

Recognizing Graph Theoretic Properties with Polynomial Ideals.

[BibT_eX]

[DOI]

Christopher J. Hillar

Peter N. Malkin

Mohamed Omar

Electron. J. Comb., 2010

2009

Computation in multicriteria matroid optimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

Graphs of transportation polytopes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2009

Pareto Optima of Multicriteria Integer Linear Programs.

[BibT_eX]

[DOI]

Raymond Hemmecke

Matthias Köppe

INFORMS J. Comput., 2009

Ehrhart Polynomials of Matroid Polytopes and Polymatroids.

[BibT_eX]

[DOI]

David C. Haws

Matthias Köppe

Discret. Comput. Geom., 2009

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

2008

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

[BibT_eX]

[DOI]

Math. Program., 2008

N-fold integer programming.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2006

Some Linear Recurrences: 11085.

[BibT_eX]

[DOI]

Am. Math. Mon., 2006

All Linear and Integer Programs Are Slim 3-Way Transportation Programs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

Integer Polynomial Optimization in Fixed Dimension.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

Markov bases of three-way tables are arbitrarily complicated.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

On the Computation of Clebsch-Gordan Coefficients and the Dilation Effect.

[BibT_eX]

[DOI]

Tyrrell B. McAllister

Exp. Math., 2006

FPTAS for mixed-integer polynomial optimization with a fixed number of variables.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Discret. Optim., 2005

Fast Computation of Clebsch-Gordan Coefficients.

[BibT_eX]

Tyrrell B. McAllister

Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2004

Problem 11085.

[BibT_eX]

[DOI]

Am. Math. Mon., 2004

The Complexity of Three-Way Statistical Tables.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Effective lattice point counting in rational convex polytopes.

[BibT_eX]

[DOI]

J. Symb. Comput., 2004

Short rational functions for toric algebra and applications.

[BibT_eX]

[DOI]

J. Symb. Comput., 2004

The complexity of finding small triangulations of convex 3-polytopes.

[BibT_eX]

[DOI]

Alexander Below

Maria Welleda Baldoni-Silva

Jürgen Richter-Gebert

J. Algorithms, 2004

Counting Integer Flows in Networks.

[BibT_eX]

[DOI]

Michèle Vergne

Found. Comput. Math., 2004

Vertices of Gelfand-Tsetlin Polytopes.

[BibT_eX]

[DOI]

Tyrrell B. McAllister

Discret. Comput. Geom., 2004

All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Algebraic unimodular counting.

[BibT_eX]

[DOI]

Math. Program., 2003

2002

A Polytopal Generalization of Sperner's Lemma.

[BibT_eX]

[DOI]

Elisha Peterson

Francis Edward Su

J. Comb. Theory A, 2002

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Frank Sottile

Discret. Comput. Geom., 2002

2001

Extremal Properties for Dissections of Convex 3-Polytopes.

[BibT_eX]

[DOI]

Francisco Santos

Fumihiko Takeuchi

SIAM J. Discret. Math., 2001

2000

Fiber Polytopes for the Projections between Cyclic Polytopes.

[BibT_eX]

[DOI]

Christos A. Athanasiadis

Victor Reiner

Francisco Santos

Eur. J. Comb., 2000

Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes.

[BibT_eX]

[DOI]

Alexander Below

Ulrich Brehm

Jürgen Richter-Gebert

Discret. Comput. Geom., 2000

Finding minimal triangulations of convex 3-polytopes is NP-hard.

[BibT_eX]

[DOI]

Alexander Below

Jürgen Richter-Gebert

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Viro's method disproves Ragsdale's conjecture: a story.

[BibT_eX]

[DOI]

Frederick J. Wicklin

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Q-matrix recognition via secondary and universal polytopes.

[BibT_eX]

[DOI]

Walter D. Morris Jr.

Math. Program., 1999

The Number of Geometric Bistellar Neighbors of a Triangulation.

[BibT_eX]

[DOI]

Francisco Santos

Jorge Urrutia

Discret. Comput. Geom., 1999

1996

Nonregular Triangulations of Products of Simplices.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

1995

Gröner Bases and Triangulations of the Second Hypersimplex.

[BibT_eX]

[DOI]