| Publication | Date of Publication | Type |
|---|
| Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs | 2020-11-04 | Paper |
| The combinatorics of hidden diversity | 2020-02-20 | Paper |
| Disjoint-Path Facility Location: Theory and Practice | 2019-09-12 | Paper |
| Min-sum bin packing | 2018-07-20 | Paper |
| Resource-based corruptions and the combinatorics of hidden diversity | 2017-05-16 | Paper |
| The geometric maximum traveling salesman problem | 2015-11-12 | Paper |
| A Little Honesty Goes a Long Way | 2015-07-06 | Paper |
| Markov chains, computer proofs, and average-case analysis of best fit bin packing | 2015-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934701 | 2014-12-18 | Paper |
| On the sum-of-squares algorithm for bin packing | 2014-09-26 | Paper |
| A brief history of NP-completeness, 1954--2012 | 2013-04-17 | Paper |
| On the Sum-of-Squares algorithm for bin packing | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460278 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461911 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461912 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801179 | 2003-04-07 | Paper |
| Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768348 | 2002-03-24 | Paper |
| Bounded space on-line bin packing: Best is better than first | 2002-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952698 | 2000-10-23 | Paper |
| Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings | 2000-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252414 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840359 | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385525 | 1998-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365133 | 1997-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335202 | 1997-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687246 | 1997-05-13 | Paper |
| Bin packing with discrete item sizes, part II: Tight bounds on First Fit | 1997-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875205 | 1996-09-16 | Paper |
| The Complexity of Multiterminal Cuts | 1994-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138967 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035170 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038710 | 1993-05-18 | Paper |
| The NP-completeness column: An ongoing guide | 1993-01-16 | Paper |
| Unit disk graphs | 1992-06-25 | Paper |
| Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning | 1992-06-25 | Paper |
| The NP-completeness column: An ongoing guide | 1990-01-01 | Paper |
| Generalized planar matching | 1990-01-01 | Paper |
| Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning | 1989-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1988-01-01 | Paper |
| On generating all maximal independent sets | 1988-01-01 | Paper |
| How easy is local search? | 1988-01-01 | Paper |
| The complexity of searching a graph | 1988-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1987-01-01 | Paper |
| Hypergraph planarity and the complexity of drawing venn diagrams | 1987-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1987-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1986-01-01 | Paper |
| The computational complexity of inferring rooted phylogenies by parsimony | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728034 | 1986-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1986-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1985-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1985-01-01 | Paper |
| A 71/60 theorem for bin packing | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693290 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3701213 | 1985-01-01 | Paper |
| Composing Functions to Minimize Image Size | 1985-01-01 | Paper |
| Scheduling File Transfers | 1985-01-01 | Paper |
| The NP-completeness column: an ongoing guide | 1985-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1984-01-01 | Paper |
| On a dual version of the one-dimensional bin packing problem | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347319 | 1984-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1984-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1984-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1984-01-01 | Paper |
| Crossing Number is NP-Complete | 1983-01-01 | Paper |
| Dynamic Bin Packing | 1983-01-01 | Paper |
| On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees | 1983-01-01 | Paper |
| Scheduling Opposing Forests | 1983-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1983-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1983-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1983-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1983-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1982-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1982-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1982-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 |
| The NP-completeness column: An ongoing gulde | 1982-01-01 | Paper |
| The NP-completeness column: An ongoing guide | 1981-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 |
| The densest hemisphere problem | 1978-01-01 | Paper |
| Triangulating a simple polygon | 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 |
| The complexity of the network design problem | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182529 | 1978-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 |
| 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 |
| Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms | 1975-01-01 | Paper |
| Complexity Results for Multiprocessor Scheduling under Resource Constraints | 1975-01-01 | Paper |
| Approximation algorithms for combinatorial problems | 1974-01-01 | Paper |
| Fast algorithms for bin packing | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4065570 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4077442 | 1973-01-01 | Paper |
