Gábor Galambos

According to our database, Gábor Galambos authored at least 37 papers between 1986 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays.

József Békési, György Dósa, Gábor Galambos

Eur. J. Oper. Res., 2022

2021

Introduction to Special issue MATCOS-19.

Andrej Brodnik, Gábor Galambos

Informatica (Slovenia), 2021

Operations research in Hungary: VOCAL 2018.

Botond Bertók, Tibor Csendes, Gábor Galambos

Central Eur. J. Oper. Res., 2021

2019

Editors' Introduction to the Special Issue on "MATCOS-16 conference".

Andrej Brodnik, Gábor Galambos

Informatica (Slovenia), 2019

2018

Tight bounds for NF-based bounded-space online bin packing algorithms.

József Békési, Gábor Galambos

J. Comb. Optim., 2018

2016

Routing.

József Békési, Gábor Galambos

Encyclopedia of Algorithms, 2016

Matrix transpose on meshes with buses.

József Békési, Gábor Galambos

J. Parallel Distributed Comput., 2016

Lower bound for 3-batched bin packing.

János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan

Discret. Optim., 2016

2015

Editors' Introduction to the Special Issue on "MATCOS-13 conference".

Andrej Brodnik, Gábor Galambos

Informatica (Slovenia), 2015

2014

A branch-and-bound algorithm for the coupled task problem.

József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt

Math. Methods Oper. Res., 2014

On-line bin packing with restricted repacking.

János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt

J. Comb. Optim., 2014

2012

New lower bounds for certain classes of bin packing algorithms.

János Balogh, József Békési, Gábor Galambos

Theor. Comput. Sci., 2012

2009

Improved analysis of an algorithm for the coupled task problem with UET jobs.

József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt

Oper. Res. Lett., 2009

Improved lower bounds for semi-online bin packing problems.

János Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót

Computing, 2009

2008

Routing.

József Békési, Gábor Galambos

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Lower Bound for the Online Bin Packing Problem with Restricted Repacking.

János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt

SIAM J. Comput., 2008

2004

An exact algorithm for scheduling identical coupled tasks.

Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt

Math. Methods Oper. Res., 2004

2001

Worst-case analysis of the Iterated Longest Fragment algorithm.

József Békési, Gábor Galambos

Inf. Process. Lett., 2001

2000

A 5/4 Linear Time Bin Packing Algorithm.

József Békési, Gábor Galambos, Hans Kellerer

J. Comput. Syst. Sci., 2000

Analysis of permutation routing algorithms.

József Békési, Gábor Galambos, Péter Hajnal

Eur. J. Oper. Res., 2000

1999

Bin Packing Approximation Algorithms: Combinatorial Analysis.

Edward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo

Proceedings of the Handbook of Combinatorial Optimization, 1999

1997

A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling".

R. Chandrasekaran, Bo Chen, Gábor Galambos, P. R. Narayanan, André van Vliet

SIAM J. Comput., 1997

Greedy Algorithms for On-Line Data Compression.

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger

J. Algorithms, 1997

1996

The Fractional Greedy Algorithm for Data Compression.

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger

Computing, 1996

1995

Minimizing the weighted number of late jobs in UET open shops.

Gábor Galambos, Gerhard J. Woeginger

Math. Methods Oper. Res., 1995

On-line bin packing - A restricted survey.

Gábor Galambos, Gerhard J. Woeginger

Math. Methods Oper. Res., 1995

Worst-Case Analysis for On-Line Data Compression.

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger

Proceedings of the Combinatorics and Computer Science, 1995

1994

Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms.

Gábor Galambos, André van Vliet

Computing, 1994

1993

An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling.

Gábor Galambos, Gerhard J. Woeginger

SIAM J. Comput., 1993

A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case.

Gábor Galambos, J. B. G. Frenk

Discret. Appl. Math., 1993

Repacking helps in bounded space on-line bind-packing.

Gábor Galambos, Gerhard Johannes Woeginger

Computing, 1993

A Lower Bound for On-Line Vector-Packing Algorithms.

Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger

Acta Cybern., 1993

1991

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems.

János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan

J. Algorithms, 1991

A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing.

Gábor Galambos

Acta Cybern., 1991

1987

Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem.

J. B. G. Frenk, Gábor Galambos

Computing, 1987

On the expected behaviour of the NF algorithm for a dual bin-packing problem.

János Csirik, Gábor Galambos

Acta Cybern., 1987

1986

An O(n) bin-packing algorithm for uniformly distributed data.

János Csirik, Gábor Galambos

Computing, 1986