Search the dblp DataBase

Publications of Author

1. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
   Worst-Case Analysis for On-Line Data Compression. [Citation Graph (0, 0)][DBLP]
   Combinatorics and Computer Science, 1995, pp:288-300 [Conf]
   
2. János Csirik, Gábor Galambos
   On the expected behaviour of the NF algorithm for a dual bin-packing problem. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1987, v:8, n:, pp:5-9 [Journal]
   
3. Gábor Galambos
   A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectange Bin-Packing. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1991, v:10, n:1-2, pp:21-24 [Journal]
   
4. Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger
   A Lower Bound for On-Line Vector-Packing Algorithms. [Citation Graph (0, 0)][DBLP]
   Acta Cybern., 1993, v:11, n:1-2, pp:23-34 [Journal]
   
5. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
   The Fractional Greedy Algorithm for Data Compression. [Citation Graph (0, 0)][DBLP]
   Computing, 1996, v:56, n:1, pp:29-46 [Journal]
   
6. Gábor Galambos, J. B. G. Frenk
   A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:41, n:2, pp:173-178 [Journal]
   
7. József Békési, Gábor Galambos
   Worst-case analysis of the Iterated Longest Fragment algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:3, pp:147-153 [Journal]
   
8. József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
   Greedy Algorithms for On-Line Data Compression. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:25, n:2, pp:274-289 [Journal]
   
9. János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan
   Probabilistic Analysis of Algorithms for Dual Bin Packing Problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1991, v:12, n:2, pp:189-203 [Journal]
   
10. József Békési, Gábor Galambos, Hans Kellerer
    A 5/4 Linear Time Bin Packing Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:1, pp:145-160 [Journal]
    
11. R. Chandrasekaran, Bo Chen, Gábor Galambos, P. R. Narayanan, André van Vliet
    A Note on ``An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling''. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:870-872 [Journal]
    
12. Gábor Galambos, Gerhard J. Woeginger
    An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:349-355 [Journal]
    
13. 
    Improved lower bounds for semi-online bin packing problems. [Citation Graph (, )][DBLP]
    
    
14. 
    Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms. [Citation Graph (, )][DBLP]