| Publication | Date of Publication | Type |
|---|
| Monotone paths on cross-polytopes | 2023-12-21 | Paper |
| Convexity in (Colored) Affine Semigroups | 2023-12-05 | Paper |
| Enumerative problems for arborescences and monotone paths on polytope graphs | 2023-10-04 | Paper |
| The Polyhedral Geometry of Pivot Rules and Monotone Paths | 2023-09-20 | Paper |
| A Model for Birdwatching and other Chronological Sampling Activities | 2023-05-31 | Paper |
| The Best Ways to Slice a Polytope | 2023-04-27 | Paper |
| Optimizing Sparsity over Lattices and Semigroups | 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 | 2022-09-14 | Paper |
| Diameters of cocircuit graphs of oriented matroids: an update | 2022-04-04 | Paper |
| Sparse representation of vectors in lattices and semigroups | 2022-03-22 | Paper |
| Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data | 2022-03-01 | Paper |
| On the Simplex method for 0/1 polytopes | 2021-11-27 | Paper |
| On the Length of Monotone Paths in Polyhedra | 2021-08-20 | Paper |
| Data-driven algorithm selection and tuning in optimization and signal processing | 2021-08-02 | Paper |
| Tverberg theorems over discrete sets of points | 2021-07-09 | Paper |
| Tverberg-type theorems with altered intersection patterns (nerves) | 2021-04-20 | Paper |
| The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential | 2020-02-20 | Paper |
| The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg | 2019-10-30 | Paper |
| Algebraic and Topological Tools in Linear Optimization | 2019-10-28 | Paper |
| The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential | 2019-08-22 | Paper |
| Average behavior of minimal free resolutions of monomial ideals | 2019-07-17 | Paper |
| Three Ehrhart quasi-polynomials | 2019-06-17 | Paper |
| Algebraic, Geometric, and Topological Methods in Optimization | 2019-06-11 | Paper |
| Random monomial ideals | 2018-12-04 | Paper |
| Random numerical semigroups and a simplicial complex of irreducible semigroups | 2018-11-22 | Paper |
| The diameters of network-flow polytopes satisfy the Hirsch conjecture | 2018-09-28 | Paper |
| The Support of Integer Optimal Solutions | 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 | 2018-04-12 | Paper |
| The hierarchy of circuit diameters and transportation polytopes | 2018-04-04 | Paper |
| Edges versus circuits: a hierarchy of diameters in polyhedra | 2018-03-29 | Paper |
| Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem | 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 |
| A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility | 2017-10-27 | Paper |
| Quantitative Tverberg theorems over lattices and other discrete sets | 2017-10-10 | Paper |
| Viro's method disproves Ragsdale's conjecture | 2017-09-29 | Paper |
| Sparse Solutions of Linear Diophantine Equations | 2017-05-30 | Paper |
| Helly’s theorem: New variations and applications | 2017-04-25 | Paper |
| Quantitative combinatorial geometry for continuous parameters | 2017-03-23 | Paper |
| On Chubanov's Method for Linear Programming | 2017-02-17 | Paper |
| Parametric polyhedra with at least k lattice points: Their semigroup structure and the k-Frobenius problem | 2017-01-25 | Paper |
| INTERMEDIATE SUMS ON POLYHEDRA II: BIDEGREE AND POISSON FORMULA | 2016-10-21 | Paper |
| Graph-Coloring Ideals | 2016-09-29 | Paper |
| A rainbow Ramsey analogue of Rado's theorem | 2016-07-05 | Paper |
| Random sampling in computational algebra: Helly numbers and violator spaces | 2016-05-04 | Paper |
| Combinatorics and Geometry of Transportation Polytopes: An Update | 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 | 2015-12-11 | Paper |
| Weak orientability of matroids and polynomial equations | 2015-08-19 | Paper |
| Coefficients of Sylvester's Denumerant | 2015-07-09 | Paper |
| Quantitative Tverberg, Helly, & Carath\'eodory theorems | 2015-03-20 | Paper |
| Software for exact integration of polynomials over polyhedra | 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 | 2014-10-21 | Paper |
| Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem | 2014-06-02 | Paper |
| Computation in multicriteria matroid optimization | 2014-04-01 | Paper |
| Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes | 2013-11-28 | Paper |
| On Volumes of Permutation Polytopes | 2013-09-13 | Paper |
| Foundations of discrete optimization: in transition from linear to non-linear models and methods | 2013-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904855 | 2013-02-12 | Paper |
| Software for exact integration of polynomials over polyhedra | 2013-01-25 | Paper |
| The central curve in linear programming | 2012-12-21 | Paper |
| Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra | 2012-12-21 | Paper |
| Pareto Optima of Multicriteria Integer Linear Programs | 2012-07-28 | Paper |
| Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization | 2012-07-10 | Paper |
| \(h\)-vectors of small matroid complexes | 2012-06-12 | Paper |
| Not all simplicial polytopes are weakly vertex-decomposable | 2012-03-07 | Paper |
| Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz | 2011-12-07 | Paper |
| How to integrate a polynomial over a simplex | 2011-03-07 | Paper |
| Recognizing graph theoretic properties with polynomial ideals | 2010-10-13 | Paper |
| FPTAS for mixed-integer polynomial optimization with a fixed number of variables | 2010-08-16 | Paper |
| Triangulations. Structures for algorithms and applications | 2010-08-11 | Paper |
| Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz | 2010-04-22 | Paper |
| Ehrhart polynomials of matroid polytopes and polymatroids | 2009-12-14 | Paper |
| Graphs of transportation polytopes | 2009-11-26 | Paper |
| Erratum to: ``The Gromov norm of the product of two surfaces | 2009-08-20 | Paper |
| Convex integer maximization via Graver bases | 2009-05-12 | Paper |
| Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility | 2009-01-20 | Paper |
| \(N\)-fold integer programming | 2008-10-29 | Paper |
| FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension | 2008-10-16 | Paper |
| Integer Polynomial Optimization in Fixed Dimension | 2008-05-27 | Paper |
| Markov bases of three-way tables are arbitrarily complicated | 2007-10-23 | Paper |
| All Linear and Integer Programs Are Slim 3‐Way Transportation Programs | 2007-09-06 | Paper |
| Short rational functions for toric algebra and applications | 2007-08-24 | Paper |
| Effective lattice point counting in rational convex polytopes | 2007-08-24 | Paper |
| On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect | 2006-12-13 | Paper |
| The many aspects of counting lattice points in polytopes | 2006-05-31 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5701854 | 2005-11-04 | Paper |
| A computational study of integer programming algorithms based on Barvinok's rational functions | 2005-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692690 | 2005-09-28 | Paper |
| Counting integer flows in networks | 2005-03-11 | Paper |
| The Gromov norm of the product of two surfaces | 2005-03-08 | Paper |
| Vertices of Gelfand-Tsetlin polytopes | 2005-02-23 | Paper |
| The Complexity of Three-Way Statistical Tables | 2005-02-21 | Paper |
| Algebraic unimodular counting | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790462 | 2003-06-01 | Paper |
| A polytopal generalization of Sperner's lemma | 2003-03-26 | Paper |
| Extremal Properties for Dissections of Convex 3-Polytopes | 2001-03-19 | Paper |
| Fiber polytopes for the projections between cyclic polytopes | 2001-01-03 | Paper |
| \(Q\)-matrix recognition via secondary and universal polytopes | 2000-06-04 | Paper |
| The number of geometric bistellar neighbors of a triangulation | 1999-03-30 | Paper |
| On the need of convexity in patchworking | 1998-11-11 | Paper |
| An effective version of Pólya's theorem on positive definite forms | 1997-04-09 | Paper |
| Nonregular triangulations of products of simplices | 1996-11-28 | Paper |
| The polytope of all triangulations of a point configuration | 1996-07-07 | Paper |
| Gröbner bases and triangulations of the second hypersimplex | 1995-10-17 | Paper |
| Gröbner bases and graph colorings | 1995-06-25 | Paper |
