| Publication | Date of Publication | Type |
|---|
| Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing | 2002-04-15 | Paper |
| Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings | 2000-07-20 | Paper |
| Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling | 1994-04-17 | Paper |
| The complexity of searching a graph | 1988-01-01 | Paper |
| Asymptotic results for partial concentrators | 1988-01-01 | Paper |
| One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties | 1988-01-01 | Paper |
| On the Fractional Covering Number of Hypergraphs | 1988-01-01 | Paper |
| Bin packing with divisible item sizes | 1987-01-01 | Paper |
| Minimizing expected makespans on uniform processor systems | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735092 | 1986-01-01 | Paper |
| A 71/60 theorem for bin packing | 1985-01-01 | Paper |
| Composing Functions to Minimize Image Size | 1985-01-01 | Paper |
| Scheduling File Transfers | 1985-01-01 | Paper |
| Strongly connected orientations of mixed multigraphs | 1985-01-01 | Paper |
| A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347319 | 1984-01-01 | Paper |
| Optimum Scan-Width Selection Under Containment Constraints | 1984-01-01 | Paper |
| Diameter bounds for altered graphs | 1984-01-01 | Paper |
| Crossing Number is NP-Complete | 1983-01-01 | Paper |
| Dynamic Bin Packing | 1983-01-01 | Paper |
| Scheduling Opposing Forests | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3673102 | 1982-01-01 | Paper |
| The complexity of the generalized Lloyd - Max problem (Corresp.) | 1982-01-01 | Paper |
| On Packing Two-Dimensional Bins | 1982-01-01 | Paper |
| Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines | 1981-01-01 | Paper |
| Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms | 1980-01-01 | Paper |
| The Complexity of Coloring Circular Arcs and Chords | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4198056 | 1979-01-01 | Paper |
| Triangulating a simple polygon | 1978-01-01 | Paper |
| A linear-time algorithm for finding all feedback vertices | 1978-01-01 | Paper |
| Performance Guarantees for Scheduling Algorithms | 1978-01-01 | Paper |
| An Application of Bin-Packing to Multiprocessor Scheduling | 1978-01-01 | Paper |
| `` Strong NP-Completeness Results | 1978-01-01 | Paper |
| Complexity Results for Bandwidth Minimization | 1978-01-01 | Paper |
| A note on bisecting minimum spanning trees | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182529 | 1978-01-01 | Paper |
| Rectilinear steiner trees: Efficient special-case algorithms | 1977-01-01 | Paper |
| Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units | 1977-01-01 | Paper |
| Two-Processor Scheduling with Start-Times and Deadlines | 1977-01-01 | Paper |
| The Rectilinear Steiner Tree Problem is $NP$-Complete | 1977-01-01 | Paper |
| Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness | 1977-01-01 | Paper |
| The Complexity of Computing Steiner Minimal Trees | 1977-01-01 | Paper |
| Computational aspects of deciding if all roots of a polynomial lie within the unit circle | 1976-01-01 | Paper |
| On the distance matrix of a tree | 1976-01-01 | Paper |
| Some simplified NP-complete graph problems | 1976-01-01 | Paper |
| Resource constrained scheduling as generalized bin packing | 1976-01-01 | Paper |
| The Complexity of Near-Optimal Graph Coloring | 1976-01-01 | Paper |
| Scheduling Tasks with Nonuniform Deadlines on Two Processors | 1976-01-01 | Paper |
| An application of graph coloring to printed circuit testing | 1976-01-01 | Paper |
| The Planar Hamiltonian Circuit Problem is NP-Complete | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4155835 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4161330 | 1976-01-01 | Paper |
| The Complexity of Flowshop and Jobshop Scheduling | 1976-01-01 | Paper |
| On cubical graphs | 1975-01-01 | Paper |
| Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms | 1975-01-01 | Paper |
| Bounds for Multiprocessor Scheduling with Resource Constraints | 1975-01-01 | Paper |
| Complexity Results for Multiprocessor Scheduling under Resource Constraints | 1975-01-01 | Paper |
| Performance bounds on the splitting algorithm for binary testing | 1974-01-01 | Paper |
| Isolating a Single Defective Using Group Testing | 1974-01-01 | Paper |
| Optimal Binary Search Trees with Restricted Maximal Depth | 1974-01-01 | Paper |
| Optimal task sequencing with precedence constraints | 1973-01-01 | Paper |
| On enumerating tournaments that admit exactly one Hamiltonian circuit | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133108 | 1972-01-01 | Paper |
| Optimal Binary Identification Procedures | 1972-01-01 | Paper |
| Simple Binary Identification Problems | 1972-01-01 | Paper |
| Optimal Test Point Selection for Sequential Manufacturing Processes | 1972-01-01 | Paper |
| The Transitive Reduction of a Directed Graph | 1972-01-01 | Paper |
