| Publication | Date of Publication | Type |
|---|
| Circuit and Graver walks and linear and integer programming | 2025-01-23 | Paper |
| Kissing polytopes | 2024-10-22 | Paper |
| On supmodular matrices | 2024-10-15 | Paper |
| Reducibility bounds of objective functions over the integers | 2024-06-17 | Paper |
| Asymptotic behavior of Markov complexity | 2024-02-23 | Paper |
| Degree sequence optimization in bounded treewidth | 2023-06-05 | Paper |
| Kissing polytopes | 2023-05-29 | Paper |
| High-multiplicity \(N\)-fold IP via configuration LP | 2023-05-25 | Paper |
| Separable and equatable hypergraphs | 2023-04-17 | Paper |
| Asymptotic behavior of Markov complexity of matrices | 2022-10-04 | Paper |
| Oriented matroid polytopes and polyhedral fans are signable | 2022-08-30 | Paper |
| The complexity of vector partition | 2022-07-15 | Paper |
| Approximate separable multichoice optimization over monotone systems | 2022-06-09 | Paper |
| Separable and Equatable Hypergraphs | 2022-06-06 | Paper |
| Matching orderable and separable hypergraphs | 2022-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5071029 | 2022-04-19 | Paper |
| Parameterized complexity of configuration integer programs | 2022-03-11 | Paper |
| Optimization over Young diagrams | 2021-11-29 | Paper |
| The Complexity of Vector Partition | 2021-09-14 | Paper |
| A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs | 2021-07-28 | Paper |
| Uniform and monotone line sum optimization | 2021-05-31 | Paper |
| Optimization over degree sequences of graphs | 2021-04-20 | Paper |
| On degree sequence optimization | 2021-04-07 | Paper |
| On line sum optimization | 2021-02-16 | Paper |
| On Degree Sequence Optimization | 2020-03-11 | Paper |
| Hypergraphic Degree Sequences are Hard | 2020-01-13 | Paper |
| Small primitive zonotopes | 2019-04-30 | Paper |
| On the Complexity of Toric Ideals | 2019-02-04 | Paper |
| Colourful linear programming | 2019-01-11 | Paper |
| Parameterized shifted combinatorial optimization | 2018-12-10 | Paper |
| Robust integer programming | 2018-09-28 | Paper |
| The unimodular intersection problem | 2018-09-28 | Paper |
| Optimization over Degree Sequences | 2018-08-10 | Paper |
| Primitive zonotopes | 2018-07-26 | Paper |
| Efficient solutions for weight-balanced partitioning problems | 2018-05-24 | Paper |
| Shifted matroid optimization | 2018-02-06 | Paper |
| Parameterized shifted combinatorial optimization | 2017-10-23 | Paper |
| On nonlinear multi-covering problems | 2017-02-22 | Paper |
| Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory | 2016-09-16 | Paper |
| Minimal average degree aberration and the state polytope for experimental designs | 2016-02-19 | Paper |
| Huge Unimodular $n$-Fold Programs | 2015-12-04 | Paper |
| Huge multiway table problems | 2015-04-09 | Paper |
| Some efficiently solvable problems over integer partition polytopes | 2014-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2928711 | 2014-11-10 | Paper |
| On the complexity of Hilbert refutations for partition | 2014-07-16 | Paper |
| Convex integer optimization by constantly many linear counterparts | 2014-06-04 | Paper |
| \(n\)-fold integer programming in cubic time | 2013-03-18 | Paper |
| The quadratic Graver cone, quadratic integer minimization, and extensions | 2012-12-19 | Paper |
| Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes | 2012-11-02 | Paper |
| Theory and Applications of n-Fold Integer Programming | 2012-07-10 | Paper |
| Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes | 2012-03-08 | Paper |
| The Graver complexity of integer programming | 2012-01-24 | Paper |
| Intractability of approximate multi-dimensional nonlinear optimization on independence systems | 2011-05-06 | Paper |
| Accuracy Certificates for Computational Problems with Convex Structure | 2011-04-27 | Paper |
| \(N\)-fold integer programming and nonlinear multi-transshipment | 2011-03-14 | Paper |
| A polynomial oracle-time algorithm for convex integer minimization | 2011-02-14 | Paper |
| Approximate Nonlinear Optimization over Weighted Independence Systems | 2010-12-03 | Paper |
| Parametric nonlinear discrete optimization over well-described sets and matroid intersections | 2010-09-16 | Paper |
| Nonlinear discrete optimization. An algorithmic theory | 2010-09-10 | Paper |
| Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz – Corrigendum | 2010-04-23 | Paper |
| Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz | 2010-04-22 | Paper |
| Two graph isomorphism polytopes | 2009-12-09 | Paper |
| Graphs of transportation polytopes | 2009-11-26 | Paper |
| Nonlinear Matroid Optimization and Experimental Design | 2009-08-20 | Paper |
| Nonlinear Optimization over a Weighted Independence System | 2009-07-02 | Paper |
| Convex integer maximization via Graver bases | 2009-05-12 | Paper |
| On test sets for nonlinear integer maximization | 2009-03-04 | Paper |
| \(N\)-fold integer programming | 2008-10-29 | Paper |
| Nonlinear optimization for matroid intersection and extensions | 2008-07-24 | Paper |
| Nonlinear bipartite matching | 2008-05-16 | Paper |
| The use of edge-directions and linear programming to enumerate vertices | 2008-02-18 | 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 |
| The convex dimension of a graph | 2007-07-19 | Paper |
| Edge-directions of standard polyhedra with applications to network flows | 2006-01-23 | Paper |
| Permutohedra and minimal matrices | 2005-12-27 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Convex combinatorial optimization | 2005-02-23 | Paper |
| The Complexity of Three-Way Statistical Tables | 2005-02-21 | Paper |
| Nowhere-zero flow polynomials | 2005-01-11 | Paper |
| A note on the minimum number of edge-directions of a convex polytope | 2004-08-06 | Paper |
| Convex Matroid Optimization | 2004-01-08 | Paper |
| The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. | 2003-09-15 | Paper |
| An adaptive algorithm for vector partitioning | 2003-06-09 | Paper |
| Social network coordination and graph routing | 2003-03-10 | Paper |
| Automated Transformations for PDE Systems with Application to Multigrid Solvers | 2003-01-05 | Paper |
| The Radon-split and the Helly-core of a point configuration | 2002-12-16 | Paper |
| Vertex characterization of partition polytopes of bipartitions and of planar point sets | 2002-12-02 | Paper |
| Solitaire lattices | 2002-07-29 | Paper |
| Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences | 2002-05-30 | Paper |
| The Vector Partition Problem for Convex Objective Functions | 2001-11-26 | Paper |
| Cutting corners | 2001-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761958 | 2001-02-21 | Paper |
| Explicit solution of partitioning problems over a 1-dimensional parameter space | 2000-12-07 | Paper |
| Linear-shaped partition problems | 2000-09-04 | Paper |
| Representations and characterizations of vertices of bounded-shape partition polytopes | 1999-12-19 | Paper |
| A Polynomial Time Algorithm for Shaped Partition Problems | 1999-11-24 | Paper |
| Separable partitions | 1999-11-02 | Paper |
| Determination of social laws for multi-agent mobilization | 1998-06-30 | Paper |
| Strongly signable and partitionable posets | 1998-05-06 | Paper |
| A Colorful Determinantal Identity, a Conjecture of Rota, and Latin Squares | 1998-04-14 | Paper |
| Colourful Linear Programming and its Relatives | 1997-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352311 | 1997-08-28 | Paper |
| Signable posets and partitionable simplicial complexes | 1996-05-27 | Paper |
| Hilbert series of group representations and Gröbner bases for generic modules | 1995-09-25 | Paper |
| Lattice-free polytopes and their diameter | 1995-08-13 | Paper |
| Approximating Oracle Machines for Combinatorial Optimization | 1995-01-12 | Paper |
| A Note on Lattice Simplices and Toric Varieties | 1995-01-02 | Paper |
| A quantitative Steinitz' theorem | 1994-12-12 | Paper |
| Geometry, complexity, and combinatorics of permutation polytopes | 1993-12-02 | Paper |
| On the diameter of convex polytopes | 1992-09-27 | Paper |
| On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice | 1992-06-26 | Paper |
| A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes | N/A | Paper |
