| Publication | Date of Publication | Type |
|---|
| Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective | 2023-10-26 | Paper |
| Complexity of branch-and-bound and cutting planes in mixed-integer optimization | 2023-03-01 | Paper |
| Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles | 2022-10-14 | Paper |
| A mickey-mouse decomposition theorem | 2022-08-30 | Paper |
| Extended formulations for stable set polytopes of graphs without two disjoint odd cycles | 2022-03-22 | Paper |
| Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II | 2021-12-21 | Paper |
| Recognizing Cartesian products of matrices and polytopes | 2021-12-08 | Paper |
| The stable set problem in graphs with bounded genus and bounded odd cycle packing number | 2021-02-02 | Paper |
| Split Cuts in the Plane | 2021-02-02 | Paper |
| The structure of the infinite models in integer programming | 2020-04-30 | Paper |
| Optimal Cutting Planes from the Group Relaxations | 2020-04-30 | Paper |
| Complexity of branch-and-bound and cutting planes in mixed-integer optimization | 2020-03-10 | Paper |
| Balas formulation for the union of polytopes is optimal | 2020-02-20 | Paper |
| An extreme function which is nonnegative and discontinuous everywhere | 2020-01-17 | Paper |
| ``Facet separation with one linear program | 2019-10-22 | Paper |
| Optimality certificates for convex minimization and Helly numbers | 2019-02-22 | Paper |
| Extreme functions with an arbitrary number of slopes | 2018-10-26 | Paper |
| Subgraph polytopes and independence polytopes of count matroids | 2018-09-28 | Paper |
| The structure of the infinite models in integer programming | 2017-08-31 | Paper |
| Maximal $S$-Free Convex Sets and the Helly Number | 2016-11-30 | Paper |
| Cut Dominants and Forbidden Minors | 2016-09-06 | Paper |
| Extreme functions with an arbitrary number of slopes | 2016-08-10 | Paper |
| The projected faces property and polyhedral relations | 2016-04-04 | Paper |
| Reverse split rank | 2015-12-09 | Paper |
| Reverse Chvátal--Gomory Rank | 2015-11-27 | Paper |
| Stable sets and graphs with no even holes | 2015-10-14 | Paper |
| A geometric approach to cut-generating functions | 2015-06-19 | Paper |
| Cut-Generating Functions and S-Free Sets | 2015-05-29 | Paper |
| Integer Programming | 2014-10-02 | Paper |
| Disjunctive programming and relaxations of polyhedra | 2014-06-02 | Paper |
| Reverse Split Rank | 2014-06-02 | Paper |
| Cutting planes from two-term disjunctions | 2014-05-15 | Paper |
| On the Convergence of the Affine Hull of the Chvátal--Gomory Closures | 2014-01-21 | Paper |
| Unique lifting of integer variables in minimal inequalities | 2013-11-11 | Paper |
| Extended formulations in combinatorial optimization | 2013-08-08 | Paper |
| Reverse Chvátal--Gomory Rank | 2013-03-19 | Paper |
| Cut-Generating Functions | 2013-03-19 | Paper |
| A counterexample to a conjecture of Gomory and Johnson | 2012-06-26 | Paper |
| A Geometric Perspective on Lifting | 2012-01-26 | Paper |
| Network Formulations of Mixed-Integer Programs | 2011-04-27 | Paper |
| Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs | 2011-04-27 | Paper |
| Maximal Lattice-Free Convex Sets in Linear Subspaces | 2011-04-27 | Paper |
| Minimal Inequalities for an Infinite Relaxation of Integer Programs | 2011-03-15 | Paper |
| On Lifting Integer Variables in Minimal Inequalities | 2010-06-22 | Paper |
| Equivalence between intersection cuts and the corner polyhedron | 2010-06-08 | Paper |
| Polyhedral Approaches to Mixed Integer Linear Programming | 2010-06-03 | Paper |
| Extended formulations in combinatorial optimization | 2010-05-21 | Paper |
| The mixing set with divisible capacities: a simple approach | 2009-12-07 | Paper |
| The Mixing Set with Divisible Capacities | 2008-06-10 | Paper |
| Compact formulations as a union of polyhedra | 2008-06-04 | Paper |
| Minimally Infeasible Set-Partitioning Problems with Balanced Constraints | 2008-05-27 | Paper |
| Packing Odd Circuits | 2008-05-22 | Paper |
| The Mixing Set with Flows | 2008-05-22 | Paper |
| Mixed-Integer Vertex Covers on Bipartite Graphs | 2007-11-29 | Paper |
| The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows | 2007-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292088 | 2007-06-19 | Paper |
| Decomposing Berge graphs containing no proper wheel, long prism or their complements | 2007-05-08 | Paper |
| Balanced matrices | 2006-10-30 | Paper |
| Odd Hole Recognition in Graphs of Bounded Clique Size | 2006-06-01 | Paper |
| Recognizing balanceable matrices | 2006-01-13 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465108 | 2005-08-22 | Paper |
| Disjoint paths in arborescences | 2005-04-28 | Paper |
| Decomposition of odd-hole-free graphs by double star cutsets and 2-joins | 2004-08-06 | Paper |
| Square-free perfect graphs. | 2004-03-14 | Paper |
| On the cut polyhedron. | 2004-03-14 | Paper |
| Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs | 2003-08-25 | Paper |
| Balanced \(0,\pm 1\) matrices. I: Decomposition | 2002-12-10 | Paper |
| Balanced \(0,\pm 1\) matrices. II: Recognition algorithm | 2002-12-10 | Paper |
| Perfect graphs, partitionable graphs and cutsets | 2002-10-20 | Paper |
| Even-hole-free graphs part II: Recognition algorithm | 2002-09-29 | Paper |
| Even-hole-free graphs part I: Decomposition theorem | 2002-06-02 | Paper |
| Shortest paths in conservative graphs | 2001-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500707 | 2001-01-23 | Paper |
| Perfect, ideal and balanced matrices | 2001-01-01 | Paper |
| A theorem of Truemper | 2000-11-13 | Paper |
| Balanced cycles and holes in bipartite graphs | 2000-07-05 | Paper |
| A polyhedral approach to an integer multicommodity flow problem | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4238043 | 1999-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840346 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228441 | 1999-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398363 | 1998-07-19 | Paper |
| A class of logic problems solvable by linear programming | 1998-01-28 | Paper |
| Universally signable graphs | 1998-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335200 | 1997-06-02 | Paper |
| Perfect \(0,\pm 1\) matrices | 1997-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892351 | 1997-02-17 | Paper |
| Perfect matchings in balanced hypergraphs | 1997-01-23 | Paper |
| A branch-and-cut algorithm for the equicut problem | 1997-01-01 | Paper |
| Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality | 1996-09-18 | Paper |
| From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes | 1994-10-31 | Paper |
| On the geometric structure of independence systems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4731202 | 1989-01-01 | Paper |
| A characterization of matroidal systems of inequalities | 1988-01-01 | Paper |
| On the Facial Structure of Independence System Polyhedra | 1988-01-01 | Paper |
| Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction | 1987-01-01 | Paper |
| A construction for binary matroids | 1987-01-01 | Paper |
| Sequentially rejective pairwise testing procedures | 1987-01-01 | Paper |
| Ki-covers. II.Ki-perfect graphs | 1987-01-01 | Paper |
| An algorithmic framework for the matching problem in some hypergraphs | 1987-01-01 | Paper |
| \(K_ i\)-covers. I: Complexity and polytopes | 1986-01-01 | Paper |
| Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem | 1984-01-01 | Paper |
