dblp.uni-trier.dewww.uni-trier.de

József Békési Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
9EEJá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)
8EEJó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
7EEJózsef Békési, Gábor Galambos: Routing. Encyclopedia of Algorithms 2008
6EEJá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
5EEJó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
2EEJó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

Coauthor Index

1János Balogh [6] [9]
2Gábor Galambos [1] [2] [3] [4] [5] [6] [7] [8] [9]
3Hans Kellerer [4]
4Mihály Csaba Markót [9]
5Marcus Oswald [8]
6Ulrich Pferschy [1] [2] [3]
7Gerhard Reinelt [6] [8]
8Gerhard J. Woeginger [1] [2] [3]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)