 | 2009 |
|---|
| 9 |       | János Balogh,
József Békési,
Gábor Galambos,
Mihály Csaba Markót:
Improved lower bounds for semi-online bin packing problems.
Computing 84(1-2): 139-148 (2009) |
| 8 | | József Békési,
Gábor Galambos,
Marcus Oswald,
Gerhard Reinelt:
Improved analysis of an algorithm for the coupled task problem with UET jobs.
Oper. Res. Lett. 37(2): 93-96 (2009) |
| 2008 |
|---|
| 7 | | József Békési,
Gábor Galambos:
Routing.
Encyclopedia of Algorithms 2008 |
| 6 | | János Balogh,
József Békési,
Gábor Galambos,
Gerhard Reinelt:
Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
SIAM J. Comput. 38(1): 398-410 (2008) |
| 2001 |
|---|
| 5 | | József Békési,
Gábor Galambos:
Worst-case analysis of the Iterated Longest Fragment algorithm.
Inf. Process. Lett. 79(3): 147-153 (2001) |
| 2000 |
|---|
| 4 |  | 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) |
| 1997 |
|---|
| 3 | | József Békési,
Gábor Galambos,
Ulrich Pferschy,
Gerhard J. Woeginger:
Greedy Algorithms for On-Line Data Compression.
J. Algorithms 25(2): 274-289 (1997) |
| 1996 |
|---|
| 2 | | József Békési,
Gábor Galambos,
Ulrich Pferschy,
Gerhard J. Woeginger:
The Fractional Greedy Algorithm for Data Compression.
Computing 56(1): 29-46 (1996) |
| 1995 |
|---|
| 1 | | József Békési,
Gábor Galambos,
Ulrich Pferschy,
Gerhard J. Woeginger:
Worst-Case Analysis for On-Line Data Compression.
Combinatorics and Computer Science 1995: 288-300 |
