| Publication | Date of Publication | Type |
|---|
Perfect packing theorems and the average-case behavior of optimal and online bin packing
SIAM Review | 2002-04-15 | Paper |
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
Journal of the ACM | 1994-04-17 | Paper |
The complexity of searching a graph
Journal of the ACM | 1988-01-01 | Paper |
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
Mathematics of Operations Research | 1988-01-01 | Paper |
On the Fractional Covering Number of Hypergraphs
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Asymptotic results for partial concentrators
IEEE Transactions on Communications | 1988-01-01 | Paper |
Bin packing with divisible item sizes
Journal of Complexity | 1987-01-01 | Paper |
Minimizing expected makespans on uniform processor systems
Advances in Applied Probability | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3967928 (Why is no real title available?)
| 1986-01-01 | Paper |
A 71/60 theorem for bin packing
Journal of Complexity | 1985-01-01 | Paper |
Strongly connected orientations of mixed multigraphs
Networks | 1985-01-01 | Paper |
Scheduling File Transfers
SIAM Journal on Computing | 1985-01-01 | Paper |
Composing Functions to Minimize Image Size
SIAM Journal on Computing | 1985-01-01 | Paper |
Diameter bounds for altered graphs
Journal of Graph Theory | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3890754 (Why is no real title available?)
| 1984-01-01 | Paper |
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
IEEE Transactions on Computers | 1984-01-01 | Paper |
Optimum Scan-Width Selection Under Containment Constraints
AT&T Bell Laboratories Technical Journal | 1984-01-01 | Paper |
Crossing Number is NP-Complete
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
Dynamic Bin Packing
SIAM Journal on Computing | 1983-01-01 | Paper |
Scheduling Opposing Forests
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3827200 (Why is no real title available?)
| 1982-01-01 | Paper |
On Packing Two-Dimensional Bins
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
The complexity of the generalized Lloyd - Max problem (Corresp.)
IEEE Transactions on Information Theory | 1982-01-01 | Paper |
Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
SIAM Journal on Computing | 1981-01-01 | Paper |
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
SIAM Journal on Computing | 1980-01-01 | Paper |
The Complexity of Coloring Circular Arcs and Chords
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
| 1979-01-01 | Paper |
An Application of Bin-Packing to Multiprocessor Scheduling
SIAM Journal on Computing | 1978-01-01 | Paper |
`` Strong NP-Completeness Results
Journal of the ACM | 1978-01-01 | Paper |
Complexity Results for Bandwidth Minimization
SIAM Journal on Applied Mathematics | 1978-01-01 | Paper |
Triangulating a simple polygon
Information Processing Letters | 1978-01-01 | Paper |
Performance Guarantees for Scheduling Algorithms
Operations Research | 1978-01-01 | Paper |
A linear-time algorithm for finding all feedback vertices
Information Processing Letters | 1978-01-01 | Paper |
A note on bisecting minimum spanning trees
Networks | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3619919 (Why is no real title available?)
| 1978-01-01 | Paper |
Two-Processor Scheduling with Start-Times and Deadlines
SIAM Journal on Computing | 1977-01-01 | Paper |
The Rectilinear Steiner Tree Problem is $NP$-Complete
SIAM Journal on Applied Mathematics | 1977-01-01 | Paper |
The Complexity of Computing Steiner Minimal Trees
SIAM Journal on Applied Mathematics | 1977-01-01 | Paper |
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
IEEE Transactions on Computers | 1977-01-01 | Paper |
Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
Mathematics of Operations Research | 1977-01-01 | Paper |
Rectilinear steiner trees: Efficient special-case algorithms
Networks | 1977-01-01 | Paper |
On the distance matrix of a tree
Discrete Mathematics | 1976-01-01 | Paper |
The Planar Hamiltonian Circuit Problem is NP-Complete
SIAM Journal on Computing | 1976-01-01 | Paper |
Some simplified NP-complete graph problems
Theoretical Computer Science | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3588048 (Why is no real title available?)
| 1976-01-01 | Paper |
The Complexity of Flowshop and Jobshop Scheduling
Mathematics of Operations Research | 1976-01-01 | Paper |
Resource constrained scheduling as generalized bin packing
Journal of Combinatorial Theory. Series A | 1976-01-01 | Paper |
Computational aspects of deciding if all roots of a polynomial lie within the unit circle
Computing | 1976-01-01 | Paper |
Scheduling Tasks with Nonuniform Deadlines on Two Processors
Journal of the ACM | 1976-01-01 | Paper |
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3593565 (Why is no real title available?)
| 1976-01-01 | Paper |
An application of graph coloring to printed circuit testing
IEEE Transactions on Circuits and Systems | 1976-01-01 | Paper |
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
SIAM Journal on Computing | 1975-01-01 | Paper |
Complexity Results for Multiprocessor Scheduling under Resource Constraints
SIAM Journal on Computing | 1975-01-01 | Paper |
On cubical graphs
Journal of Combinatorial Theory. Series B | 1975-01-01 | Paper |
Bounds for Multiprocessor Scheduling with Resource Constraints
SIAM Journal on Computing | 1975-01-01 | Paper |
Isolating a Single Defective Using Group Testing
| 1974-01-01 | Paper |
Optimal Binary Search Trees with Restricted Maximal Depth
SIAM Journal on Computing | 1974-01-01 | Paper |
Performance bounds on the splitting algorithm for binary testing
Acta Informatica | 1974-01-01 | Paper |
Optimal task sequencing with precedence constraints
Discrete Mathematics | 1973-01-01 | Paper |
Optimal Binary Identification Procedures
SIAM Journal on Applied Mathematics | 1972-01-01 | Paper |
The Transitive Reduction of a Directed Graph
SIAM Journal on Computing | 1972-01-01 | Paper |
scientific article; zbMATH DE number 3557207 (Why is no real title available?)
| 1972-01-01 | Paper |
Simple Binary Identification Problems
IEEE Transactions on Computers | 1972-01-01 | Paper |
Optimal Test Point Selection for Sequential Manufacturing Processes
Bell System Technical Journal | 1972-01-01 | Paper |
On enumerating tournaments that admit exactly one Hamiltonian circuit
Journal of Combinatorial Theory. Series B | 1972-01-01 | Paper |
