| Publication | Date of Publication | Type |
|---|
Near-optimal disjoint-path facility location through set cover by pairs
Operations Research | 2020-11-04 | Paper |
The combinatorics of hidden diversity
Theoretical Computer Science | 2020-02-20 | Paper |
Disjoint-path facility location: theory and practice
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Min-sum bin packing
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
Resource-based corruptions and the combinatorics of hidden diversity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
The geometric maximum traveling salesman problem
Journal of the ACM | 2015-11-12 | Paper |
A little honesty goes a long way. The two-tier model for secure multiparty computation
Theory of Cryptography | 2015-07-06 | Paper |
Markov chains, computer proofs, and average-case analysis of best fit bin packing
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
| Compressing rectilinear pictures and minimizing access control lists | 2014-12-18 | Paper |
On the sum-of-squares algorithm for bin packing
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A brief history of NP-completeness, 1954--2012
Documenta Mathematica | 2013-04-17 | Paper |
On the Sum-of-Squares algorithm for bin packing
Journal of the ACM | 2008-12-21 | Paper |
| scientific article; zbMATH DE number 2065615 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2064412 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2064413 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 1893558 (Why is no real title available?) | 2003-04-07 | Paper |
Perfect packing theorems and the average-case behavior of optimal and online bin packing
SIAM Review | 2002-04-15 | Paper |
| Better approximation algorithms for bin covering | 2002-03-24 | Paper |
Bounded space on-line bin packing: Best is better than first
Algorithmica | 2002-03-04 | Paper |
| scientific article; zbMATH DE number 1445375 (Why is no real title available?) | 2000-10-23 | 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 |
| scientific article; zbMATH DE number 1305522 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1187152 (Why is no real title available?) | 1999-04-19 | Paper |
| scientific article; zbMATH DE number 1142309 (Why is no real title available?) | 1998-05-04 | Paper |
| scientific article; zbMATH DE number 1082106 (Why is no real title available?) | 1997-10-30 | Paper |
| scientific article; zbMATH DE number 1003242 (Why is no real title available?) | 1997-10-16 | Paper |
| scientific article; zbMATH DE number 956839 (Why is no real title available?) | 1997-05-13 | Paper |
| Bin packing with discrete item sizes, part II: Tight bounds on First Fit | 1997-03-05 | Paper |
| scientific article; zbMATH DE number 871931 (Why is no real title available?) | 1996-09-16 | Paper |
The Complexity of Multiterminal Cuts
SIAM Journal on Computing | 1994-10-17 | Paper |
| scientific article; zbMATH DE number 432833 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 177832 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176070 (Why is no real title available?) | 1993-05-18 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1993-01-16 | Paper |
Unit disk graphs
Discrete Mathematics | 1992-06-25 | Paper |
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
Operations Research | 1992-06-25 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1990-01-01 | Paper |
Generalized planar matching
Journal of Algorithms | 1990-01-01 | Paper |
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Operations Research | 1989-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1988-01-01 | Paper |
How easy is local search?
Journal of Computer and System Sciences | 1988-01-01 | Paper |
The complexity of searching a graph
Journal of the ACM | 1988-01-01 | Paper |
On generating all maximal independent sets
Information Processing Letters | 1988-01-01 | Paper |
Hypergraph planarity and the complexity of drawing venn diagrams
Journal of Graph Theory | 1987-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1987-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3959478 (Why is no real title available?) | 1986-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1986-01-01 | Paper |
The computational complexity of inferring rooted phylogenies by parsimony
Mathematical Biosciences | 1986-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1986-01-01 | Paper |
A 71/60 theorem for bin packing
Journal of Complexity | 1985-01-01 | Paper |
Scheduling File Transfers
SIAM Journal on Computing | 1985-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1985-01-01 | Paper |
The NP-completeness column: an ongoing guide
Journal of Algorithms | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3926663 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3918121 (Why is no real title available?) | 1985-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1985-01-01 | Paper |
Composing Functions to Minimize Image Size
SIAM Journal on Computing | 1985-01-01 | Paper |
On a dual version of the one-dimensional bin packing problem
Journal of Algorithms | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3890754 (Why is no real title available?) | 1984-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1984-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1984-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1984-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 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 |
On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
Mathematics of Operations Research | 1983-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1983-01-01 | Paper |
Scheduling Opposing Forests
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1983-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1983-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 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 NP-completeness column: An ongoing guide
Journal of Algorithms | 1982-01-01 | Paper |
The complexity of the generalized Lloyd - Max problem (Corresp.)
IEEE Transactions on Information Theory | 1982-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1982-01-01 | Paper |
The NP-completeness column: An ongoing gulde
Journal of Algorithms | 1982-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 1982-01-01 | Paper |
Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
SIAM Journal on Computing | 1981-01-01 | Paper |
The NP-completeness column: An ongoing guide
Journal of Algorithms | 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 |
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 |
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 |
The complexity of the network design problem
Networks | 1978-01-01 | Paper |
The densest hemisphere problem
Theoretical Computer Science | 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 |
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 |
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 |
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 |
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences | 1974-01-01 | Paper |
Fast algorithms for bin packing
Journal of Computer and System Sciences | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3482375 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3495588 (Why is no real title available?) | 1973-01-01 | Paper |
