| Publication | Date of Publication | Type |
|---|
| Combinatorial redundancy detection | 2018-08-13 | Paper |
| Combinatorial Redundancy Detection | 2017-10-10 | Paper |
| The criss-cross method can take Ω(n d ) pivots | 2017-09-29 | Paper |
| Complete enumeration of small realizable oriented matroids | 2013-03-20 | Paper |
| Every non-Euclidean oriented matroid admits a biquadratic final polynomial | 2011-02-08 | Paper |
| Combinatorial characterizations of \(K\)-matrices | 2010-12-01 | Paper |
| A linear equation for Minkowski sums of polytopes relatively in general position | 2010-04-27 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| The Holt-Klee condition for oriented matroids | 2009-12-03 | Paper |
| Pivoting in linear complementarity: Two polynomial-time cases | 2009-07-24 | Paper |
| An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices | 2009-04-28 | Paper |
| Exact algorithms and software in optimization and polyhedral computation | 2009-01-20 | Paper |
| Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. | 2008-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442483 | 2008-02-22 | Paper |
| The generic Gröbner walk | 2007-10-23 | Paper |
| Computing Gröbner fans | 2007-09-13 | Paper |
| From the zonotope construction to the Minkowski addition of convex polytopes | 2007-08-24 | Paper |
| \(f\)-vectors of Minkowski additions of convex polytopes | 2007-06-21 | Paper |
| New polynomial-time algorithms for Camion bases | 2006-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5717952 | 2006-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692709 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024756 | 2005-07-04 | Paper |
| Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm | 2005-06-01 | Paper |
| A case when the union of polytopes is convex | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464662 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790468 | 2003-06-16 | Paper |
| An adaptive algorithm for vector partitioning | 2003-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547798 | 2002-08-21 | Paper |
| Generation of oriented matroids --- a graph theoretical approach | 2002-05-21 | Paper |
| Cocircuit graphs and efficient orientation reconstruction in oriented matroids | 2002-02-19 | Paper |
| Extended convex hull | 2002-01-14 | Paper |
| Convexity recognition of the union of polyhedra | 2001-09-27 | Paper |
| On the cocircuit graph of an oriented matroid | 2001-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707294 | 2001-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494407 | 2001-01-04 | Paper |
| A polynomial case of unconstrained zero-one quadratic optimization | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518985 | 2000-12-03 | Paper |
| Isolating points by lines in the plane | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935157 | 2000-01-30 | Paper |
| The parallel search bench ZRAM and its applications | 1999-12-02 | Paper |
| Primal-dual methods for vertex and facet enumeration | 1999-04-12 | Paper |
| EP theorems and linear complementarity problems | 1999-03-18 | Paper |
| The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP | 1998-08-20 | Paper |
| Criss-cross methods: A fresh view on pivot algorithms | 1998-06-01 | Paper |
| Reverse search for enumeration | 1997-01-13 | Paper |
| Finding all common bases in two matroids | 1995-10-23 | Paper |
| McMullen's conditions and some lower bounds for general convex polytopes | 1995-05-02 | Paper |
| The inequicut cone | 1994-12-01 | Paper |
| Combinatorial face enumeration in convex polytopes | 1994-09-25 | Paper |
| On extremal behaviors of Murty's least index method | 1994-09-08 | Paper |
| Antipodal graphs and oriented matroids | 1994-02-24 | Paper |
| A theorem on the average number of subfaces in arrangements and oriented matroids | 1993-09-30 | Paper |
| Oriented matroids and combinatorial manifolds | 1993-05-16 | Paper |
| A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra | 1993-01-16 | Paper |
| LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS | 1993-01-16 | Paper |
| Finding all minimum-cost perfect matchings in Bipartite graphs | 1992-10-13 | Paper |
| A basis enumeration algorithm for linear systems with geometric applications | 1992-06-27 | Paper |
| Combinatorial face enumeration in arrangements and oriented matroids | 1992-06-25 | Paper |
| Bounding the number of \(k\)-faces in arrangements of hyperplanes | 1992-06-25 | Paper |
| Clutters and matroids | 1992-06-25 | Paper |
| On the finiteness of the criss-cross method | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3970245 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3211359 | 1990-01-01 | Paper |
| Characterizations of *-families | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789578 | 1988-01-01 | Paper |
| A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD | 1988-01-01 | Paper |
