| Publication | Date of Publication | Type |
|---|
Ramsey numbers through the lenses of polynomial ideals and Nullstellensätze
The Electronic Journal of Combinatorics | 2026-02-04 | Paper |
An algebraic perspective on Ramsey numbers
Séminaire Lotharingien de Combinatoire | 2025-09-24 | Paper |
Sums of weighted lattice points of polytopes
Séminaire Lotharingien de Combinatoire | 2025-09-24 | Paper |
Optimization tools for computing colorings of \([1, \dots, n]\) with few monochromatic solutions on 3-variable linear equations
Discrete Applied Mathematics | 2025-06-30 | Paper |
On the simplex method for 0/1-polytopes
Mathematics of Operations Research | 2025-06-02 | Paper |
| Integer points in arbitrary convex cones: the case of the PSD and SOC cones | 2025-02-07 | Paper |
| Rado numbers and SAT computations | 2025-01-17 | Paper |
The best ways to slice a polytope
Mathematics of Computation | 2025-01-06 | Paper |
Markov Bases: A 25 Year Update
Journal of the American Statistical Association | 2024-07-05 | Paper |
Weighted Ehrhart theory: extending Stanley's nonnegativity theorem
Advances in Mathematics | 2024-04-24 | Paper |
Monotone paths on cross-polytopes
Discrete & Computational Geometry | 2023-12-21 | Paper |
Convexity in (Colored) Affine Semigroups
Studia Scientiarum Mathematicarum Hungarica | 2023-12-05 | Paper |
Enumerative problems for arborescences and monotone paths on polytope graphs
Journal of Graph Theory | 2023-10-04 | Paper |
The Polyhedral Geometry of Pivot Rules and Monotone Paths
SIAM Journal on Applied Algebra and Geometry | 2023-09-20 | Paper |
A Model for Birdwatching and other Chronological Sampling Activities
The American Mathematical Monthly | 2023-05-31 | Paper |
| The Best Ways to Slice a Polytope | 2023-04-27 | Paper |
Optimizing sparsity over lattices and semigroups
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
| Rado Numbers and SAT Computations | 2022-10-06 | Paper |
| Ramsey Numbers through the Lenses of Polynomial Ideals and Nullstellens\"atze | 2022-09-28 | Paper |
Pivot rules for circuit-augmentation algorithms in linear optimization
SIAM Journal on Optimization | 2022-09-14 | Paper |
Diameters of cocircuit graphs of oriented matroids: an update
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Sparse representation of vectors in lattices and semigroups
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
SIAM Journal on Mathematics of Data Science | 2022-03-01 | Paper |
| On the Simplex method for 0/1 polytopes | 2021-11-27 | Paper |
On the length of monotone paths in polyhedra
SIAM Journal on Discrete Mathematics | 2021-08-20 | Paper |
Data-driven algorithm selection and tuning in optimization and signal processing
Annals of Mathematics and Artificial Intelligence | 2021-08-02 | Paper |
Tverberg theorems over discrete sets of points
Polytopes and Discrete Geometry | 2021-07-09 | Paper |
Tverberg-type theorems with altered intersection patterns (nerves)
Discrete & Computational Geometry | 2021-04-20 | Paper |
The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
SIAM Journal on Computing | 2020-02-20 | Paper |
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Bulletin of the American Mathematical Society | 2019-10-30 | Paper |
Algebraic and Topological Tools in Linear Optimization
Notices of the American Mathematical Society | 2019-10-28 | Paper |
The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Average behavior of minimal free resolutions of monomial ideals
Proceedings of the American Mathematical Society | 2019-07-17 | Paper |
Three Ehrhart quasi-polynomials
Algebraic Combinatorics | 2019-06-17 | Paper |
Algebraic, Geometric, and Topological Methods in Optimization
Notices of the American Mathematical Society | 2019-06-11 | Paper |
Random monomial ideals
Journal of Algebra | 2018-12-04 | Paper |
Random numerical semigroups and a simplicial complex of irreducible semigroups
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
Random numerical semigroups and a simplicial complex of irreducible semigroups
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
The diameters of network-flow polytopes satisfy the Hirsch conjecture
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
The support of integer optimal solutions
SIAM Journal on Optimization | 2018-08-03 | Paper |
| Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns | 2018-08-01 | Paper |
A quantitative Doignon-Bell-Scarf theorem
Combinatorica | 2018-04-12 | Paper |
A quantitative Doignon-Bell-Scarf theorem
Combinatorica | 2018-04-12 | Paper |
The hierarchy of circuit diameters and transportation polytopes
Discrete Applied Mathematics | 2018-04-04 | Paper |
Edges versus circuits: a hierarchy of diameters in polyhedra
advg | 2018-03-29 | Paper |
Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
advg | 2018-03-29 | Paper |
| Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization | 2018-03-27 | Paper |
Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
(available as arXiv preprint) | 2018-03-27 | Paper |
A sampling Kaczmarz-Motzkin algorithm for linear feasibility
SIAM Journal on Scientific Computing | 2017-10-27 | Paper |
Quantitative Tverberg theorems over lattices and other discrete sets
Discrete & Computational Geometry | 2017-10-10 | Paper |
Viro's method disproves Ragsdale's conjecture
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Sparse Solutions of Linear Diophantine Equations
SIAM Journal on Applied Algebra and Geometry | 2017-05-30 | Paper |
Helly’s theorem: New variations and applications
Algebraic and Geometric Methods in Discrete Mathematics | 2017-04-25 | Paper |
Quantitative combinatorial geometry for continuous parameters
Discrete & Computational Geometry | 2017-03-23 | Paper |
On Chubanov's Method for Linear Programming
INFORMS Journal on Computing | 2017-02-17 | Paper |
Parametric polyhedra with at least \(k\) lattice points: their semigroup structure and the \(k\)-Frobenius problem
Recent Trends in Combinatorics | 2017-01-25 | Paper |
Intermediate sums on polyhedra. II: Bidegree and Poisson formula
Mathematika | 2016-10-21 | Paper |
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 | 2016-09-29 | Paper |
A rainbow Ramsey analogue of Rado's theorem
Discrete Mathematics | 2016-07-05 | Paper |
Random sampling in computational algebra: Helly numbers and violator spaces
Journal of Symbolic Computation | 2016-05-04 | Paper |
Combinatorics and geometry of transportation polytopes: an update
(available as arXiv preprint) | 2016-01-27 | Paper |
| Approximating the maximum of a polynomial over a polytope: Handelman decomposition and continuous generating functions | 2016-01-15 | Paper |
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
SIAM Journal on Optimization | 2015-12-11 | Paper |
Weak orientability of matroids and polynomial equations
European Journal of Combinatorics | 2015-08-19 | Paper |
| Coefficients of Sylvester's denumerant | 2015-07-09 | Paper |
Coefficients of Sylvester's denumerant
(available as arXiv preprint) | 2015-07-09 | Paper |
| Quantitative Tverberg, Helly, & Carath\'eodory theorems | 2015-03-20 | Paper |
Software for exact integration of polynomials over polyhedra
ACM Communications in Computer Algebra | 2015-02-20 | Paper |
| Gr\"obner Bases and Nullstellens\"atze for Graph-Coloring Ideals | 2014-10-24 | Paper |
Transportation problems and simplicial polytopes that are not weakly vertex-decomposable
Mathematics of Operations Research | 2014-10-21 | Paper |
Integer programs with prescribed number of solutions and a weighted version of Doignon-Bell-Scarf's theorem
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Computation in multicriteria matroid optimization
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
Top | 2013-11-28 | Paper |
On volumes of permutation polytopes
Discrete Geometry and Optimization | 2013-09-13 | Paper |
On volumes of permutation polytopes
Discrete Geometry and Optimization | 2013-09-13 | Paper |
Foundations of discrete optimization: in transition from linear to non-linear models and methods
Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) | 2013-02-14 | Paper |
| Algebraic and geometric ideas in the theory of discrete optimization | 2013-02-12 | Paper |
Software for exact integration of polynomials over polyhedra
Computational Geometry | 2013-01-25 | Paper |
The central curve in linear programming
Foundations of Computational Mathematics | 2012-12-21 | Paper |
Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
Foundations of Computational Mathematics | 2012-12-21 | Paper |
Pareto optima of multicriteria integer linear programs
INFORMS Journal on Computing | 2012-07-28 | Paper |
Computation with polynomial equations and inequalities arising in combinatorial optimization
Mixed Integer Nonlinear Programming | 2012-07-10 | Paper |
h-vectors of small matroid complexes
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
h-vectors of small matroid complexes
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Not all simplicial polytopes are weakly vertex-decomposable
(available as arXiv preprint) | 2012-03-07 | Paper |
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Journal of Symbolic Computation | 2011-12-07 | Paper |
How to integrate a polynomial over a simplex
Mathematics of Computation | 2011-03-07 | Paper |
Recognizing graph theoretic properties with polynomial ideals
The Electronic Journal of Combinatorics | 2010-10-13 | Paper |
Recognizing graph theoretic properties with polynomial ideals
The Electronic Journal of Combinatorics | 2010-10-13 | Paper |
Recognizing graph theoretic properties with polynomial ideals
The Electronic Journal of Combinatorics | 2010-10-13 | Paper |
FPTAS for mixed-integer polynomial optimization with a fixed number of variables
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Triangulations. Structures for algorithms and applications
Algorithms and Computation in Mathematics | 2010-08-11 | Paper |
Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Ehrhart polynomials of matroid polytopes and polymatroids
Discrete & Computational Geometry | 2009-12-14 | Paper |
Graphs of transportation polytopes
Journal of Combinatorial Theory. Series A | 2009-11-26 | Paper |
Erratum to: ``The Gromov norm of the product of two surfaces''
Topology | 2009-08-20 | Paper |
Convex integer maximization via Graver bases
Journal of Pure and Applied Algebra | 2009-05-12 | Paper |
Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility
(available as arXiv preprint) | 2009-01-20 | Paper |
\(N\)-fold integer programming
Discrete Optimization | 2008-10-29 | Paper |
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
Mathematical Programming. Series A. Series B | 2008-10-16 | Paper |
Integer Polynomial Optimization in Fixed Dimension
Mathematics of Operations Research | 2008-05-27 | Paper |
Markov bases of three-way tables are arbitrarily complicated
Journal of Symbolic Computation | 2007-10-23 | Paper |
All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
SIAM Journal on Optimization | 2007-09-06 | Paper |
Effective lattice point counting in rational convex polytopes
Journal of Symbolic Computation | 2007-08-24 | Paper |
Short rational functions for toric algebra and applications
Journal of Symbolic Computation | 2007-08-24 | Paper |
On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
Experimental Mathematics | 2006-12-13 | Paper |
On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
Experimental Mathematics | 2006-12-13 | Paper |
The many aspects of counting lattice points in polytopes
Mathematische Semesterberichte | 2006-05-31 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
scientific article; zbMATH DE number 2223032 (Why is no real title available?)
(available as arXiv preprint) | 2005-11-04 | Paper |
A computational study of integer programming algorithms based on Barvinok's rational functions
Discrete Optimization | 2005-10-10 | Paper |
scientific article; zbMATH DE number 2209709 (Why is no real title available?)
(available as arXiv preprint) | 2005-09-28 | Paper |
Counting integer flows in networks
Foundations of Computational Mathematics | 2005-03-11 | Paper |
The Gromov norm of the product of two surfaces
Topology | 2005-03-08 | Paper |
Vertices of Gelfand-Tsetlin polytopes
Discrete & Computational Geometry | 2005-02-23 | Paper |
The Complexity of Three-Way Statistical Tables
SIAM Journal on Computing | 2005-02-21 | Paper |
Algebraic unimodular counting
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 1860732 (Why is no real title available?) | 2003-06-01 | Paper |
A polytopal generalization of Sperner's lemma
Journal of Combinatorial Theory. Series A | 2003-03-26 | Paper |
Extremal properties for dissections of convex 3-polytopes
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
Fiber polytopes for the projections between cyclic polytopes
European Journal of Combinatorics | 2001-01-03 | Paper |
\(Q\)-matrix recognition via secondary and universal polytopes
Mathematical Programming. Series A. Series B | 2000-06-04 | Paper |
The number of geometric bistellar neighbors of a triangulation
Discrete & Computational Geometry | 1999-03-30 | Paper |
On the need of convexity in patchworking
Advances in Applied Mathematics | 1998-11-11 | Paper |
An effective version of Pólya's theorem on positive definite forms
Journal of Pure and Applied Algebra | 1997-04-09 | Paper |
Nonregular triangulations of products of simplices
Discrete & Computational Geometry | 1996-11-28 | Paper |
The polytope of all triangulations of a point configuration
Documenta Mathematica | 1996-07-07 | Paper |
Gröbner bases and triangulations of the second hypersimplex
Combinatorica | 1995-10-17 | Paper |
Gröbner bases and graph colorings
Beiträge zur Algebra und Geometrie | 1995-06-25 | Paper |
Gröbner bases and graph colorings
Beiträge zur Algebra und Geometrie | 1995-06-25 | Paper |
Markov bases: a 25 year update
(available as arXiv preprint) | N/A | Paper |
Irreducible Markov Chains on spaces of graphs with fixed degree-color sequences
(available as arXiv preprint) | N/A | Paper |
Sums of Weighted Lattice Points of Polytopes
(available as arXiv preprint) | N/A | Paper |
Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones
(available as arXiv preprint) | N/A | Paper |
