Gábor Galambos

发表

Lower bound for 3-batched bin packing

Zhiyi Tan, József Békési, György Dósa, 2016, Discret. Optim..

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

J. B. G. Frenk, Alexander H. G. Rinnooy Kan, János Csirik, 1991, J. Algorithms.

New lower bounds for certain classes of bin packing algorithms

József Békési, János Balogh, Gábor Galambos, 2010, Theor. Comput. Sci..

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

János Csirik, Gábor Galambos, 1987, Acta Cybern..

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

József Békési, Gábor Galambos, J. Békési, 2018, J. Comb. Optim..

Bin Packing Approximation Algorithms: Combinatorial Analysis

Daniele Vigo, Edward G. Coffman, Silvano Martello, 1999, Handbook of Combinatorial Optimization.

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

Gábor Galambos, 1991, Acta Cybern..

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

Gerhard J. Woeginger, Gábor Galambos, G. Woeginger, 1993, SIAM J. Comput..

A Lower Bound for On-Line Vector-Packing Algorithms

Gerhard J. Woeginger, Hans Kellerer, Gábor Galambos, 1993, Acta Cybern..

Matrix transpose on meshes with buses

József Békési, Gábor Galambos, 2016, J. Parallel Distributed Comput..

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

Gábor Galambos, André van Vliet, 2005, Computing.

Improved lower bounds for semi-online bin packing problems

Mihály Csaba Markót, József Békési, János Balogh, 2008, Computing.

Worst-Case Analysis for On-Line Data Compression

Gerhard J. Woeginger, Ulrich Pferschy, József Békési, 1995, Combinatorics and Computer Science.

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

J. B. G. Frenk, Gábor Galambos, 1993, Discret. Appl. Math..

Data Compression: Theory and Techniques

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

The fractional greedy algorithm for data compression

Gerhard J. Woeginger, Ulrich Pferschy, József Békési, 2005, Computing.

Minimizing the weighted number of late jobs in UET open shops

Gerhard J. Woeginger, Gábor Galambos, 1995, Math. Methods Oper. Res..

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

Gerhard Reinelt, Marcus Oswald, József Békési, 2009, Oper. Res. Lett..

Parallelization of video compressing with FFmpeg and OpenMP in supercomputing environment

József Békési, Miklós Krész, Gábor Galambos, 2015 .

Lower Bound for the Online Bin Packing Problem with Restricted Repacking

Gerhard Reinelt, József Békési, János Balogh, 2008, SIAM J. Comput..

On-line bin packing with restricted repacking

Gerhard Reinelt, József Békési, János Balogh, 2014, J. Comb. Optim..

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

Gerhard Reinelt, Marcus Oswald, József Békési, 2014, Math. Methods Oper. Res..

A 5/4 Linear Time Bin Packing Algorithm

Hans Kellerer, József Békési, Gábor Galambos, 2000, J. Comput. Syst. Sci..

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

Andrej Brodnik, Gábor Galambos, 2019, Informatica.

Bin packing approximation algorithms: Survey and classification

Daniele Vigo, János Csirik, Edward G. Coffman, 2013 .

New lower bounds for certain classes of bin packing algorithms

József Békési, János Balogh, Gábor Galambos, 2012, Theor. Comput. Sci..

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

János Csirik, Gábor Galambos, 2005, Computing.

Worst-case analysis of the Iterated Longest Fragment algorithm

József Békési, Gábor Galambos, 2001, Inf. Process. Lett..

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

Andrej Brodnik, Gábor Galambos, 2015, Informatica.

Competitive algorithms in discrete optimization = Versenyképes algoritmusok a diszkrét optimalizálásban

Gábor Galambos, 2016 .

On-line bin packing — A restricted survey

Gerhard J. Woeginger, Gábor Galambos, G. Woeginger, 1995, Math. Methods Oper. Res..

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

Ramaswamy Chandrasekaran, Bo Chen, Gábor Galambos, 1997, SIAM J. Comput..

Analysis of permutation routing algorithms

József Békési, Gábor Galambos, Péter Hajnal, 2000, Eur. J. Oper. Res..

Longest Fragment First Algorithms for Data Compression

József Békési, Gábor Galambos, Timo Raita, 1998 .

Greedy Algorithms for On-Line Data Compression

Gerhard J. Woeginger, Ulrich Pferschy, József Békési, 1997, J. Algorithms.

Ütemezési feladatok az autóbuszos közösségi közlekedés operatív tervezésében: Egy áttekintés

József Békési, Balázs Dávid, Miklós Krész, 2014 .

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

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

An exact algorithm for scheduling identical coupled tasks

Gerhard Reinelt, Marcus Oswald, Dino Ahr, 2004, Math. Methods Oper. Res..

Repacking helps in bounded space on-line bind-packing

Gerhard J. Woeginger, Gábor Galambos, G. Woeginger, 1993, Computing.

A probabilistic analysis of the dual bin packing problem

János Csirik, Gábor Galambos, Ahg Alexander Rinnooy Kan, 1986 .

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, 2021, Eur. J. Oper. Res..

Operations research in Hungary: VOCAL 2018

Tibor Csendes, Botond Bertók, Gábor Galambos, 2021, Central European Journal of Operations Research.

Introduction to Special issue MATCOS-19

Andrej Brodnik, Gábor Galambos, 2021, Informatica.

On a Multidimensional Semi-on-line Bin Packing Problem *

Gerhard Reinelt, József Békési, Gábor Galambos, 2010 .