| Publication | Date of Publication | Type |
|---|
| Obituary: Ailsa H. Land, EURO Gold Medallist (1927--2021) | 2021-11-05 | Paper |
| The power of linear programming: some surprising and unexpected LPs | 2021-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5256140 | 2015-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396116 | 2014-02-05 | Paper |
| Algebraic methods applied to shortest path and maximum flow problems in stochastic networks | 2013-08-06 | Paper |
| On the Distributed Bellman-Ford Algorithm and the Looping Problem | 2012-06-18 | Paper |
| Minimax Models for Diverse Routing | 2012-05-30 | Paper |
| Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems | 2011-09-09 | Paper |
| Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks | 2009-07-18 | Paper |
| Extended dominance and a stochastic shortest path problem | 2008-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447231 | 2007-06-28 | Paper |
| Cut scheduling in the apparel industry | 2007-06-04 | Paper |
| An Efficient Enumeration Algorithm for the Two-Sample Randomization Distribution | 2007-05-21 | Paper |
| Minimum spanning trees in networks with varying edge weights | 2007-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494215 | 2006-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405798 | 2003-08-07 | Paper |
| Cancellation in cyclic consecutive systems | 2002-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264759 | 1999-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390614 | 1998-05-26 | Paper |
| An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks | 1997-11-25 | Paper |
| A paradigm for listing \((s,t)\)-cuts in graphs | 1996-08-13 | Paper |
| Some applications of nonnegative linear systems: Farkas strikes again | 1995-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035370 | 1993-05-18 | Paper |
| Generating the states of a binary stochastic system | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4017178 | 1993-01-16 | Paper |
| Reliability Computations for Planar Networks | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3999466 | 1992-09-17 | Paper |
| A factoring approach for the stochastic shortest path problem | 1992-06-27 | Paper |
| Perron eigenvectors and the symmetric transportation polytope | 1992-06-25 | Paper |
| Reliability covering problems | 1992-06-25 | Paper |
| A Multistage Linear Array Assignment Problem | 1990-01-01 | Paper |
| Maximal chordal subgraphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3201236 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815109 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3816085 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3823399 | 1988-01-01 | Paper |
| Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes | 1987-01-01 | Paper |
| Algebraic Methods Applied to Network Reliability Problems | 1987-01-01 | Paper |
| Iterative algorithms for generating minimal cutsets in directed graphs | 1986-01-01 | Paper |
| Algorithms for Generating Minimal Cutsets by Inversion | 1985-01-01 | Paper |
| Some aspects of perfect elimination orderings in chordal graphs | 1984-01-01 | Paper |
| Computational Methods for Minimum Spanning Tree Algorithms | 1984-01-01 | Paper |
| Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights | 1984-01-01 | Paper |
| Counterexamples in measuring the distance between binary trees | 1983-01-01 | Paper |
| On powers and centers of chordal graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318517 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3320434 | 1983-01-01 | Paper |
| Testing for homogeneity of two-dimensional surfaces | 1983-01-01 | Paper |
| Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745273 | 1982-01-01 | Paper |
| Arc tolerances in shortest path and network flow problems | 1981-01-01 | Paper |
| Properties of Labeling Methods for Determining Shortest Path Trees | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950576 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950579 | 1981-01-01 | Paper |
| Player aggregation in noncooperative Games | 1980-01-01 | Paper |
| A Test Problem Generator for Discrete Linear L 1 Approximation Problems | 1980-01-01 | Paper |
| Algorithm 564: A Test Problem Generator for Discrete Linear L 1 Approximation Problem | 1980-01-01 | Paper |
| On algorithms for finding the k shortest paths in a network | 1979-01-01 | Paper |
| Norm approximation problems and norm statistics | 1978-01-01 | Paper |
| Planes, Cubes and Center-Representable Polytopes | 1977-01-01 | Paper |
| Inverting sparse matrices by tree partitioning | 1976-01-01 | Paper |
| Iterative methods for determining the k shortest paths in a network | 1976-01-01 | Paper |
| Maximizing the number of spanning trees in a graph with n nodes and m edges | 1974-01-01 | Paper |
| Computational experience with an algorithm for finding the k shortest paths in a network | 1974-01-01 | Paper |
| A decomposition algorithm for optimality problems in tree-structured networks | 1973-01-01 | Paper |
| A Note on an Algebra for the k Best Routes in a Network | 1973-01-01 | Paper |
