| Publication | Date of Publication | Type |
|---|
Separation problems for the stable set polytope
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
On dual integrality in matching problems
Operations Research Letters | 2019-07-22 | Paper |
The coming of the matroids
Documenta Mathematica | 2013-04-17 | Paper |
An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
Combinatorica | 2008-10-21 | Paper |
On Integer Programming and the Branch-Width of the Constraint Matrix
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Optimal 3-terminal cuts and linear programming
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
On the even permutation polytope
Linear Algebra and its Applications | 2004-11-22 | Paper |
Matching, matroids, and extensions
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
Integral solutions of linear complementarity problems
Mathematics of Operations Research | 2001-11-26 | Paper |
Restricted 2-factor polytopes
Mathematical Programming. Series A. Series B | 2001-11-06 | Paper |
Principally unimodular skew-symmetric matrices
Combinatorica | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1342124 (Why is no real title available?) | 1999-09-22 | Paper |
The optimal path-matching problem
Combinatorica | 1998-11-23 | Paper |
| scientific article; zbMATH DE number 1102774 (Why is no real title available?) | 1998-01-12 | Paper |
Wheel inequalities for stable set polytopes
Mathematical Programming. Series A. Series B | 1997-11-25 | Paper |
| scientific article; zbMATH DE number 956857 (Why is no real title available?) | 1996-12-11 | Paper |
| scientific article; zbMATH DE number 863480 (Why is no real title available?) | 1996-04-08 | Paper |
Ladders for Travelling Salesmen
SIAM Journal on Optimization | 1996-04-01 | Paper |
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
SIAM Journal on Discrete Mathematics | 1995-09-11 | Paper |
A separation algorithm for the matchable set polytope
Mathematical Programming. Series A. Series B | 1994-09-26 | Paper |
A faster algorithm for computing the strength of a network
Information Processing Letters | 1994-04-05 | Paper |
| scientific article; zbMATH DE number 176254 (Why is no real title available?) | 1993-05-18 | Paper |
\(b\)-matching degree-sequence polyhedra
Combinatorica | 1992-06-27 | Paper |
Computing the binding number of a graph
Discrete Applied Mathematics | 1992-06-25 | Paper |
Small Travelling Salesman Polytopes
Mathematics of Operations Research | 1992-06-25 | Paper |
Short cocircuits in binary matroids
European Journal of Combinatorics | 1987-01-01 | Paper |
Improved Bounds for Matroid Partition and Intersection Algorithms
SIAM Journal on Computing | 1986-01-01 | Paper |
Dominants and submissives of matching polyhedra
Mathematical Programming | 1986-01-01 | Paper |
Compositions for perfect graphs
Discrete Mathematics | 1985-01-01 | Paper |
A Primal-Dual Algorithm for Submodular Flows
Mathematics of Operations Research | 1985-01-01 | Paper |
On submodular function minimization
Combinatorica | 1985-01-01 | Paper |
Optimal attack and reinforcement of a network
Journal of the ACM | 1985-01-01 | Paper |
The Partial Order of a Polymatroid Extreme Point
Mathematics of Operations Research | 1985-01-01 | Paper |
Minimum cuts, modular functions, and matroid polyhedra
Networks | 1985-01-01 | Paper |
A submodular network simplex method
Mathematical Programming Studies | 1984-01-01 | Paper |
Testing membership in matroid polyhedra
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
Decomposition of submodular functions
Combinatorica | 1983-01-01 | Paper |
Reductions to 1–matching polyhedra
Networks | 1983-01-01 | Paper |
On cycling in the network simplex method
Mathematical Programming | 1983-01-01 | Paper |
Technical Note—A Class of Linear Programs Convertible to Network Problems
Operations Research | 1983-01-01 | Paper |
Decomposition of Directed Graphs
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
Polyhedra for Composed Independence Systems
North-Holland Mathematics Studies | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3779067 (Why is no real title available?) | 1982-01-01 | Paper |
Separating cocircuits in binary matroids
Linear Algebra and its Applications | 1982-01-01 | Paper |
On matroid connectivity
Journal of Combinatorial Theory. Series B | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3749025 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3775289 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3744938 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3749024 (Why is no real title available?) | 1981-01-01 | Paper |
A Combinatorial Decomposition Theory
Canadian Journal of Mathematics | 1980-01-01 | Paper |
Converting Linear Programs to Network Problems
Mathematics of Operations Research | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3719168 (Why is no real title available?) | 1979-01-01 | Paper |
Theoretical Properties of the Network Simplex Method
Mathematics of Operations Research | 1979-01-01 | Paper |
BINARY MATROID SUMS
The Quarterly Journal of Mathematics | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3637616 (Why is no real title available?) | 1978-01-01 | Paper |
Chords and disjoint paths in matroids
Discrete Mathematics | 1977-01-01 | Paper |
An unbounded matroid intersection polyhedron
Linear Algebra and its Applications | 1977-01-01 | Paper |
A network simplex method
Mathematical Programming | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3512168 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3598496 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3470459 (Why is no real title available?) | 1971-01-01 | Paper |
