Gábor Galambos

39 papers B 1Journal 34Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Introduction to Special issue MATCOS-22.
Informatica (Slovenia)
Andrej Brodnik, Gábor Galambos, Attila Sali
2022 J jnl
A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays.
Eur. J. Oper. Res.
József Békési, György Dósa, Gábor Galambos
2021 J jnl
Introduction to Special issue MATCOS-19.
Informatica (Slovenia)
Andrej Brodnik, Gábor Galambos
2021 J jnl
Operations research in Hungary: VOCAL 2018.
Central Eur. J. Oper. Res.
Botond Bertók, Tibor Csendes, Gábor Galambos
2019 J jnl
Editors' Introduction to the Special Issue on "MATCOS-16 conference".
Informatica (Slovenia)
Andrej Brodnik, Gábor Galambos
2018 J jnl
Tight bounds for NF-based bounded-space online bin packing algorithms.
J. Comb. Optim.
József Békési, Gábor Galambos
2016 J jnl
Lower bound for 3-batched bin packing.
Discret. Optim.
János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan
2016 J jnl
Matrix transpose on meshes with buses.
J. Parallel Distributed Comput.
József Békési, Gábor Galambos
2016 — ch.
Routing.
Encyclopedia of Algorithms
József Békési, Gábor Galambos
2015 J jnl
Editors' Introduction to the Special Issue on "MATCOS-13 conference".
Informatica (Slovenia)
Andrej Brodnik, Gábor Galambos
2014 J jnl
A branch-and-bound algorithm for the coupled task problem.
Math. Methods Oper. Res.
József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt
2014 J jnl
On-line bin packing with restricted repacking.
J. Comb. Optim.
János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
2012 J jnl
New lower bounds for certain classes of bin packing algorithms.
Theor. Comput. Sci.
János Balogh, József Békési, Gábor Galambos
2010 B conf
New Lower Bounds for Certain Classes of Bin Packing Algorithms.
WAOA
János Balogh, József Békési, Gábor Galambos
2009 J jnl
Improved analysis of an algorithm for the coupled task problem with UET jobs.
Oper. Res. Lett.
József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt
2009 J jnl
Improved lower bounds for semi-online bin packing problems.
Computing
János Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót
2008 J jnl
Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
SIAM J. Comput.
János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
2008 — ch.
Routing.
Encyclopedia of Algorithms
József Békési, Gábor Galambos
2004 J jnl
An exact algorithm for scheduling identical coupled tasks.
Math. Methods Oper. Res.
Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt
2001 J jnl
Worst-case analysis of the Iterated Longest Fragment algorithm.
Inf. Process. Lett.
József Békési, Gábor Galambos
2000 J jnl
A 5/4 Linear Time Bin Packing Algorithm.
J. Comput. Syst. Sci.
József Békési, Gábor Galambos, Hans Kellerer
2000 J jnl
Analysis of permutation routing algorithms.
Eur. J. Oper. Res.
József Békési, Gábor Galambos, Péter Hajnal
1999 — ch.
Bin Packing Approximation Algorithms: Combinatorial Analysis.
Handbook of Combinatorial Optimization
Edward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo
1997 J jnl
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling".
SIAM J. Comput.
R. Chandrasekaran, Bo Chen, Gábor Galambos, P. R. Narayanan, André van Vliet
1997 J jnl
Greedy Algorithms for On-Line Data Compression.
J. Algorithms
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1996 J jnl
The Fractional Greedy Algorithm for Data Compression.
Computing
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1995 J jnl
Minimizing the weighted number of late jobs in UET open shops.
Math. Methods Oper. Res.
Gábor Galambos, Gerhard J. Woeginger
1995 J jnl
On-line bin packing - A restricted survey.
Math. Methods Oper. Res.
Gábor Galambos, Gerhard J. Woeginger
1995 — conf
Worst-Case Analysis for On-Line Data Compression.
Combinatorics and Computer Science
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1994 J jnl
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms.
Computing
Gábor Galambos, André van Vliet
1993 J jnl
A Lower Bound for On-Line Vector-Packing Algorithms.
Acta Cybern.
Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger
1993 J jnl
A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case.
Discret. Appl. Math.
Gábor Galambos, J. B. G. Frenk
1993 J jnl
An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling.
SIAM J. Comput.
Gábor Galambos, Gerhard J. Woeginger
1993 J jnl
Repacking helps in bounded space on-line bind-packing.
Computing
Gábor Galambos, Gerhard Johannes Woeginger
1991 J jnl
A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing.
Acta Cybern.
Gábor Galambos
1991 J jnl
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems.
J. Algorithms
János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan
1987 J jnl
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem.
Computing
J. B. G. Frenk, Gábor Galambos
1987 J jnl
On the expected behaviour of the NF algorithm for a dual bin-packing problem.
Acta Cybern.
János Csirik, Gábor Galambos
1986 J jnl
An O(n) bin-packing algorithm for uniformly distributed data.
Computing
János Csirik, Gábor Galambos