Publication | Date of Publication | Type |
---|
Separation problems for the stable set polytope | 2022-08-30 | Paper |
On dual integrality in matching problems | 2019-07-22 | Paper |
The coming of the matroids | 2013-04-17 | Paper |
An algorithm for packing non-zero \(A\)-paths in group-labelled graphs | 2008-10-21 | Paper |
On Integer Programming and the Branch-Width of the Constraint Matrix | 2007-11-29 | Paper |
Optimal 3-terminal cuts and linear programming | 2006-05-02 | Paper |
On the even permutation polytope | 2004-11-22 | Paper |
Matching, matroids, and extensions | 2002-12-01 | Paper |
Integral Solutions of Linear Complementarity Problems | 2001-11-26 | Paper |
Restricted 2-factor polytopes | 2001-11-06 | Paper |
Principally unimodular skew-symmetric matrices | 1999-10-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4263706 | 1999-09-22 | Paper |
The optimal path-matching problem | 1998-11-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4371290 | 1998-01-12 | Paper |
Wheel inequalities for stable set polytopes | 1997-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q5687265 | 1996-12-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4871759 | 1996-04-08 | Paper |
Ladders for Travelling Salesmen | 1996-04-01 | Paper |
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra | 1995-09-11 | Paper |
A separation algorithm for the matchable set polytope | 1994-09-26 | Paper |
A faster algorithm for computing the strength of a network | 1994-04-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q4035360 | 1993-05-18 | Paper |
\(b\)-matching degree-sequence polyhedra | 1992-06-27 | Paper |
Computing the binding number of a graph | 1992-06-25 | Paper |
Small Travelling Salesman Polytopes | 1992-06-25 | Paper |
Short cocircuits in binary matroids | 1987-01-01 | Paper |
Improved Bounds for Matroid Partition and Intersection Algorithms | 1986-01-01 | Paper |
Dominants and submissives of matching polyhedra | 1986-01-01 | Paper |
On submodular function minimization | 1985-01-01 | Paper |
Compositions for perfect graphs | 1985-01-01 | Paper |
A Primal-Dual Algorithm for Submodular Flows | 1985-01-01 | Paper |
The Partial Order of a Polymatroid Extreme Point | 1985-01-01 | Paper |
Minimum cuts, modular functions, and matroid polyhedra | 1985-01-01 | Paper |
Optimal attack and reinforcement of a network | 1985-01-01 | Paper |
Testing membership in matroid polyhedra | 1984-01-01 | Paper |
A submodular network simplex method | 1984-01-01 | Paper |
Decomposition of submodular functions | 1983-01-01 | Paper |
Reductions to 1–matching polyhedra | 1983-01-01 | Paper |
On cycling in the network simplex method | 1983-01-01 | Paper |
Technical Note—A Class of Linear Programs Convertible to Network Problems | 1983-01-01 | Paper |
Separating cocircuits in binary matroids | 1982-01-01 | Paper |
Polyhedra for Composed Independence Systems | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3958239 | 1982-01-01 | Paper |
Decomposition of Directed Graphs | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3929414 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3932815 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3932816 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3955180 | 1981-01-01 | Paper |
On matroid connectivity | 1981-01-01 | Paper |
A Combinatorial Decomposition Theory | 1980-01-01 | Paper |
Converting Linear Programs to Network Problems | 1980-01-01 | Paper |
BINARY MATROID SUMS | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3909066 | 1979-01-01 | Paper |
Theoretical Properties of the Network Simplex Method | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4197644 | 1978-01-01 | Paper |
Chords and disjoint paths in matroids | 1977-01-01 | Paper |
An unbounded matroid intersection polyhedron | 1977-01-01 | Paper |
A network simplex method | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4091998 | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4165400 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4056042 | 1971-01-01 | Paper |