| Publication | Date of Publication | Type |
|---|
| Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements | 1996-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845372 | 1996-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873762 | 1996-04-22 | Paper |
| NETPAD: An interactive graphics system for network modeling and optimization | 1996-01-07 | Paper |
| Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times | 1994-04-06 | Paper |
| Subtree and substar intersection numbers | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035361 | 1993-05-18 | Paper |
| Further Development of a Primal-Dual Interior Point Method | 1993-02-18 | Paper |
| Transitions in geometric minimum spanning trees | 1993-01-16 | Paper |
| Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints | 1993-01-16 | Paper |
| An Implementation of a Primal-Dual Interior Point Method for Linear Programming | 1993-01-16 | Paper |
| Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints | 1992-09-27 | Paper |
| On the complexity of embedding planar graphs to minimize certain distance measures | 1990-01-01 | Paper |
| Minimum-weight two-connected spanning networks | 1990-01-01 | Paper |
| Computing Euclidean maximum spanning trees | 1990-01-01 | Paper |
| Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints | 1990-01-01 | Paper |
| On the Structure of Minimum-Weight k-Connected Spanning Networks | 1990-01-01 | Paper |
| Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions | 1990-01-01 | Paper |
| Optimal enclosing regions in planar graphs | 1989-01-01 | Paper |
| On the Complexity of Scheduling with Batch Setup Times | 1989-01-01 | Paper |
| On the Complexity of Covering Vertices by Faces in a Planar Graph | 1988-01-01 | Paper |
| Threshold tolerance graphs | 1988-01-01 | Paper |
| Computational experience with a dual affine variant of Karmarkar's method for linear programming | 1987-01-01 | Paper |
| Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions | 1987-01-01 | Paper |
| Send-and-Split Method for Minimum-Concave-Cost Network Flows | 1987-01-01 | Paper |
| Intersection graphs of paths in a tree | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3689221 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789612 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4731197 | 1985-01-01 | Paper |
| Tolerance graphs | 1984-01-01 | Paper |
| A concise survey of efficiently solvable special cases of the permutation flow-shop problem | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322150 | 1982-01-01 | Paper |
| Multigram codes (Corresp.) | 1982-01-01 | Paper |
| Linear-Time Algorithms for Scheduling on Parallel Processors | 1982-01-01 | Paper |
| Sequencing with general precedence constraints | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3869068 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3869069 | 1981-01-01 | Paper |
| Sequencing to Minimize the Maximum Job Cost | 1980-01-01 | Paper |
| On perfect graphs and polyhedra with (0, 1)-valued extreme points | 1979-01-01 | Paper |
| The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions | 1979-01-01 | Paper |
| Sequencing with Series-Parallel Precedence Constraints | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197628 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197629 | 1978-01-01 | Paper |
