| Publication | Date of Publication | Type |
|---|
| Scheduling independent multiprocessor tasks | 2021-12-20 | Paper |
| Alternation and redundancy analysis of the intersection problem | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501258 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501299 | 2015-08-03 | Paper |
| Matchings in lattice graphs | 2015-05-07 | Paper |
| Dynamic TCP acknowledgement and other stories about e/(e-1) | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921790 | 2014-10-13 | Paper |
| On the sum-of-squares algorithm for bin packing | 2014-09-26 | Paper |
| Polynomial-time approximation scheme for data broadcast | 2014-09-26 | Paper |
| Low Distortion Maps Between Point Sets | 2010-09-06 | Paper |
| OPT versus LOAD in dynamic storage allocation | 2010-08-16 | Paper |
| Low distortion maps between point sets | 2010-08-15 | Paper |
| Huffman coding with unequal letter costs | 2010-08-05 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| The reverse greedy algorithm for the metric k-median problem | 2009-12-18 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| On the Sum-of-Squares algorithm for bin packing | 2008-12-21 | Paper |
| Oblivious Medians Via Online Bidding | 2008-09-18 | Paper |
| Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes | 2008-05-27 | Paper |
| Incremental medians via online bidding | 2008-04-23 | Paper |
| On Hierarchical Diameter-Clustering, and the Supplier Problem | 2008-02-21 | Paper |
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2007-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374105 | 2006-03-09 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463608 | 2005-08-05 | Paper |
| Glauber dynamics on trees and hyperbolic graphs | 2005-06-15 | Paper |
| OPTVersusLOADin Dynamic Storage Allocation | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828958 | 2004-11-29 | Paper |
| Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions | 2004-11-23 | Paper |
| Broadcasting on trees and the Ising model. | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472467 | 2004-08-04 | Paper |
| Dynamic TCP acknowledgment and other stories about \(e/(e-1)\) | 2003-08-17 | Paper |
| A PTAS for the average weighted completion time problem on unrelated machines. | 2003-07-27 | Paper |
| The data broadcast problem with non-uniform transmission times | 2003-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768403 | 2003-04-02 | Paper |
| A randomized approximation scheme for metric MAX-CUT | 2002-07-04 | Paper |
| Linear waste of best fit bin packing on skewed distributions | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768348 | 2002-03-24 | Paper |
| Scheduling independent multiprocessor tasks | 2002-03-07 | Paper |
| A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem | 2001-11-26 | Paper |
| Approximating the number of monomer-dimer coverings of a lattice. | 2001-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4704801 | 2000-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252332 | 1999-06-17 | Paper |
| Multilayer neural networks and polyhedral dichotomies | 1999-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228435 | 1999-03-01 | Paper |
| Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing | 1998-10-21 | Paper |
| Data Structures' Maxima | 1998-02-10 | Paper |
| PLANAR CAYLEY GRAPHS WITH REGULAR DUAL | 1997-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128919 | 1997-04-23 | Paper |
| Perfect matchings in the triangular lattice | 1997-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875219 | 1996-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875207 | 1996-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875206 | 1996-04-28 | Paper |
| Finding a target subnetwork in sparse networks with random faults | 1994-09-25 | Paper |
| On boolean decision trees with faulty nodes | 1994-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3136239 | 1993-12-15 | Paper |
| Optimal Randomized Algorithms for Local Sorting and Set-Maxima | 1993-05-17 | Paper |
| How to take short cuts | 1993-01-16 | Paper |
| Maximum queue size and hashing with lazy deletion | 1991-01-01 | Paper |
| ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS | 1990-01-01 | Paper |
