| 2008 |
|---|
| 33 | EE | Hans Kellerer:
Knapsack.
Encyclopedia of Algorithms 2008 |
| 32 | EE | Hans Kellerer:
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times.
Oper. Res. Lett. 36(2): 157-159 (2008) |
| 2006 |
|---|
| 31 | EE | Hans Kellerer,
Vitaly A. Strusevich:
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date.
Theor. Comput. Sci. 369(1-3): 230-238 (2006) |
| 2005 |
|---|
| 30 | EE | T. C. Edwin Cheng,
Hans Kellerer,
Vladimir Kotov:
Semi-on-line multiprocessor scheduling with given total processing time.
Theor. Comput. Sci. 337(1-3): 134-146 (2005) |
| 2004 |
|---|
| 29 | EE | Luitpold Babel,
Bo Chen,
Hans Kellerer,
Vladimir Kotov:
Algorithms for on-line bin-packing problems with cardinality constraints.
Discrete Applied Mathematics 143(1-3): 238-251 (2004) |
| 28 | EE | Hans Kellerer,
Ulrich Pferschy:
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem.
J. Comb. Optim. 8(1): 5-11 (2004) |
| 2003 |
|---|
| 27 | EE | Hans Kellerer,
Vitaly A. Strusevich:
Scheduling problems for parallel dedicated machines under multiple resource constraints.
Discrete Applied Mathematics 133(1-3): 45-68 (2003) |
| 26 | EE | Hans Kellerer,
Vitaly A. Strusevich:
Scheduling parallel dedicated machines under a single non-shared resource.
European Journal of Operational Research 147(2): 345-364 (2003) |
| 25 | EE | Hans Kellerer,
Renata Mansini,
Ulrich Pferschy,
Maria Grazia Speranza:
An efficient fully polynomial approximation scheme for the Subset-Sum Problem.
J. Comput. Syst. Sci. 66(2): 349-370 (2003) |
| 24 | | Alberto Caprara,
Hans Kellerer,
Ulrich Pferschy:
A 3/4-Approximation Algorithm for Multiple Subset Sum.
J. Heuristics 9(2): 99-111 (2003) |
| 23 | EE | Hans Kellerer,
Vladimir Kotov:
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing.
Oper. Res. Lett. 31(1): 35-41 (2003) |
| 2001 |
|---|
| 22 | EE | Luitpold Babel,
Bo Chen,
Hans Kellerer,
Vladimir Kotov:
On-Line Algorithms for Cardinality Constrained Bin Packing Problems.
ISAAC 2001: 695-706 |
| 21 | EE | Alberto Caprara,
Hans Kellerer,
Ulrich Pferschy:
Approximation Schemes for Ordered Vector Packing Problems.
RANDOM-APPROX 2001: 63-74 |
| 20 | EE | Thomas Erlebach,
Hans Kellerer,
Ulrich Pferschy:
Approximating Multi-objective Knapsack Problems.
WADS 2001: 210-221 |
| 19 | | Peter Greistorfer,
Hans Kellerer:
Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem.
J. Heuristics 7(4): 371-390 (2001) |
| 2000 |
|---|
| 18 | EE | Alberto Caprara,
Hans Kellerer,
Ulrich Pferschy:
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities.
Inf. Process. Lett. 73(3-4): 111-118 (2000) |
| 17 | | József Békési,
Gábor Galambos,
Hans Kellerer:
A 5/4 Linear Time Bin Packing Algorithm.
J. Comput. Syst. Sci. 60(1): 145-160 (2000) |
| 1999 |
|---|
| 16 | | Hans Kellerer:
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.
RANDOM-APPROX 1999: 51-62 |
| 15 | | Hans Kellerer,
Ulrich Pferschy:
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem.
J. Comb. Optim. 3(1): 59-71 (1999) |
| 14 | | Hans Kellerer,
Thomas Tautenhahn,
Gerhard J. Woeginger:
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
SIAM J. Comput. 28(4): 1155-1166 (1999) |
| 1998 |
|---|
| 13 | EE | Hans Kellerer,
Ulrich Pferschy:
A New Fully Polynomial Approximation Scheme for the Knapsack Problem.
APPROX 1998: 123-134 |
| 12 | EE | Rainer E. Burkard,
Y. He,
Hans Kellerer:
A Linear Compound Algorithm for Uniform Machine Scheduling.
Computing 61(1): 1-10 (1998) |
| 11 | EE | Paolo Dell'Olmo,
Hans Kellerer,
Maria Grazia Speranza,
Zsolt Tuza:
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett. 65(5): 229-233 (1998) |
| 1997 |
|---|
| 10 | | Hans Kellerer,
Ulrich Pferschy,
Maria Grazia Speranza:
An Efficient Approximation Scheme for the Subset-Sum Problem.
ISAAC 1997: 394-403 |
| 9 | EE | Hans Kellerer,
Vladimir Kotov,
Maria Grazia Speranza,
Zsolt Tuza:
Semi on-line algorithms for the partition problem.
Oper. Res. Lett. 21(5): 235-242 (1997) |
| 1996 |
|---|
| 8 | EE | Hans Kellerer,
Thomas Tautenhahn,
Gerhard J. Woeginger:
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
STOC 1996: 418-426 |
| 1993 |
|---|
| 7 | | Hans Kellerer,
Franz Rendl,
Gerhard J. Woeginger:
Computing the optimum stock size.
IPCO 1993: 147-159 |
| 6 | EE | Gábor Galambos,
Hans Kellerer,
Gerhard J. Woeginger:
A Lower Bound for On-Line Vector-Packing Algorithms.
Acta Cybern. 11(1-2): 23-34 (1993) |
| 5 | EE | Hans Kellerer,
Gerhard J. Woeginger:
A Tight Bound for 3-Partitioning.
Discrete Applied Mathematics 45(3): 249-259 (1993) |
| 4 | EE | Hans Kellerer,
Gerhard J. Woeginger:
On the Euclidean two Paths Problem.
Discrete Applied Mathematics 47(2): 165-173 (1993) |
| 1992 |
|---|
| 3 | EE | Hans Kellerer,
Gerhard J. Woeginger:
UET-scheduling with constrained processor allocations.
Computers & OR 19(1): 1-8 (1992) |
| 1990 |
|---|
| 2 | EE | Hans Kellerer,
Günther Wirsching:
Prime covers and periodic patterns.
Discrete Mathematics 85(2): 191-206 (1990) |
| 1987 |
|---|
| 1 | | Werner Heise,
Hans Kellerer:
Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4.
Elektronische Informationsverarbeitung und Kybernetik 23(2/3): 113-124 (1987) |
