| Publication | Date of Publication | Type |
|---|
| Constructing Maximal Dynamic Flows from Static Flows | 2019-06-03 | Paper |
| On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem | 2019-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3057916 | 2010-11-18 | Paper |
| Solution of a Large-Scale Traveling-Salesman Problem | 2010-06-03 | Paper |
| A suggested computation for maximal multi-commodity network flows | 2002-10-22 | Paper |
| A network flow computation for project cost curves | 2002-10-22 | Paper |
| Increasing the capacity of a network: the parametric budget problem | 2002-10-22 | Paper |
| Maximizing the minimum source-sink path subject to a budget constraint | 1977-01-01 | Paper |
| On edge-disjoint branchings | 1976-01-01 | Paper |
| Blocking pairs of polyhedra arising from network flows | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4088546 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124603 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133404 | 1974-01-01 | Paper |
| Packing rooted directed cuts in a weighted directed graph | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4121713 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777322 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5685113 | 1973-01-01 | Paper |
| Anti-blocking polyhedra | 1972-01-01 | Paper |
| Blocking and anti-blocking pairs of polyhedra | 1971-01-01 | Paper |
| Minimal k‐arc connected graphs | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5619837 | 1971-01-01 | Paper |
| Bottleneck extrema | 1970-01-01 | Paper |
| Flows in infinite graphs | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5620998 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5609153 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5604409 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5572841 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5574558 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5514188 | 1966-01-01 | Paper |
| Flow Networks and Combinatorial Operations Research | 1966-01-01 | Paper |
| Incidence matrices and interval graphs | 1965-01-01 | Paper |
| Transversals and matroid partition | 1965-01-01 | Paper |
| Some Properties of Graphs with Multiple Edges | 1965-01-01 | Paper |
| Upsets in Round Robin Tournaments | 1965-01-01 | Paper |
| Incidence matrices with the consecutive 1’s property | 1964-01-01 | Paper |
| The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones | 1964-01-01 | Paper |
| Width Sequences for Special Classes of (0, 1)-Matrices | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5636666 | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3292914 | 1962-01-01 | Paper |
| Multiplicities and Minimal Widths for (0, 1)-Matrices | 1962-01-01 | Paper |
| Expected Critical Path Lengths in PERT Networks | 1962-01-01 | Paper |
| An Algorithm for Scaling Matrices | 1962-01-01 | Paper |
| Widths and Heights of (0,1) -Matrices | 1961-01-01 | Paper |
| An Out-of-Kilter Method for Minimal-Cost Flow Problems | 1961-01-01 | Paper |
| Zero-one matrices with zero trace | 1960-01-01 | Paper |
| Traces, Term Ranks, Widths and Heights | 1960-01-01 | Paper |
| A Network-Flow Feasibility Theorem and Combinatorial Applications | 1959-01-01 | Paper |
| Network Flow and Systems of Representatives | 1958-01-01 | Paper |
| A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem | 1957-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5519729 | 1957-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5732241 | 1957-01-01 | Paper |
| Maximal Flow Through a Network | 1956-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3236250 | 1956-01-01 | Paper |
| Note on Dilworth's Decomposition Theorem for Partially Ordered Sets | 1956-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3236245 | 1956-01-01 | Paper |
