Gábor Galambos

Publication Activity (10 Years)

Years Active: 1986-2022
Publications (10 Years): 7

Top Topics

Top Venues

Informatica (Slovenia)

J. Comb. Optim.

Discret. Optim.

Central Eur. J. Oper. Res.

Publications

József Békési, György Dósa, Gábor Galambos
A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays. Eur. J. Oper. Res. 297 (3) (2022)
Botond Bertók, Tibor Csendes, Gábor Galambos
Operations research in Hungary: VOCAL 2018. Central Eur. J. Oper. Res. 29 (2) (2021)
Andrej Brodnik, Gábor Galambos
Introduction to Special issue MATCOS-19. Informatica (Slovenia) 45 (2) (2021)
Andrej Brodnik, Gábor Galambos
Editors' Introduction to the Special Issue on "MATCOS-16 conference". Informatica (Slovenia) 43 (1) (2019)
József Békési, Gábor Galambos
Tight bounds for NF-based bounded-space online bin packing algorithms. J. Comb. Optim. 35 (2) (2018)
János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan
Lower bound for 3-batched bin packing. Discret. Optim. 21 (2016)
József Békési, Gábor Galambos
Matrix transpose on meshes with buses. J. Parallel Distributed Comput. 96 (2016)
Andrej Brodnik, Gábor Galambos
Editors' Introduction to the Special Issue on "MATCOS-13 conference". Informatica (Slovenia) 39 (3) (2015)
János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
On-line bin packing with restricted repacking. J. Comb. Optim. 27 (1) (2014)
József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt
A branch-and-bound algorithm for the coupled task problem. Math. Methods Oper. Res. 80 (1) (2014)
János Balogh, József Békési, Gábor Galambos
New lower bounds for certain classes of bin packing algorithms. Theor. Comput. Sci. (2012)
János Balogh, József Békési, Gábor Galambos
New Lower Bounds for Certain Classes of Bin Packing Algorithms. WAOA (2010)
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) (2009)
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) (2009)
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) (2008)
Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt
An exact algorithm for scheduling identical coupled tasks. Math. Methods Oper. Res. 59 (2) (2004)
József Békési, Gábor Galambos
Worst-case analysis of the Iterated Longest Fragment algorithm. Inf. Process. Lett. 79 (3) (2001)
József Békési, Gábor Galambos, Péter Hajnal
Analysis of permutation routing algorithms. Eur. J. Oper. Res. 125 (2) (2000)
József Békési, Gábor Galambos, Hans Kellerer
A 5/4 Linear Time Bin Packing Algorithm. J. Comput. Syst. Sci. 60 (1) (2000)
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". SIAM J. Comput. 26 (3) (1997)
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
Greedy Algorithms for On-Line Data Compression. J. Algorithms 25 (2) (1997)
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
The Fractional Greedy Algorithm for Data Compression. Computing 56 (1) (1996)
Gábor Galambos, Gerhard J. Woeginger
Minimizing the weighted number of late jobs in UET open shops. Math. Methods Oper. Res. 41 (1) (1995)
Gábor Galambos, Gerhard J. Woeginger
On-line bin packing - A restricted survey. Math. Methods Oper. Res. 42 (1) (1995)
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)
Gábor Galambos, André van Vliet
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms. Computing 52 (3) (1994)
Gábor Galambos, Gerhard J. Woeginger
An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling. SIAM J. Comput. 22 (2) (1993)
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. Discret. Appl. Math. 41 (2) (1993)
Gábor Galambos, Gerhard Johannes Woeginger
Repacking helps in bounded space on-line bind-packing. Computing 49 (4) (1993)
Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger
A Lower Bound for On-Line Vector-Packing Algorithms. Acta Cybern. 11 (1-2) (1993)
János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems. J. Algorithms 12 (2) (1991)
Gábor Galambos
A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing. Acta Cybern. 10 (1-2) (1991)
J. B. G. Frenk, Gábor Galambos
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem. Computing 39 (3) (1987)
János Csirik, Gábor Galambos
On the expected behaviour of the NF algorithm for a dual bin-packing problem. Acta Cybern. 8 (1) (1987)
János Csirik, Gábor Galambos
An O(n) bin-packing algorithm for uniformly distributed data. Computing 36 (4) (1986)