According to our database1, Gábor Galambos authored at least 33 papers between 1986 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Editors' Introduction to the Special Issue on "MATCOS-16 conference".
Informatica (Slovenia), 2019
Tight bounds for NF-based bounded-space online bin packing algorithms.
J. Comb. Optim., 2018
Encyclopedia of Algorithms, 2016
Matrix transpose on meshes with buses.
J. Parallel Distrib. Comput., 2016
Lower bound for 3-batched bin packing.
Discrete Optimization, 2016
Editors' Introduction to the Special Issue on "MATCOS-13 conference".
Informatica (Slovenia), 2015
A branch-and-bound algorithm for the coupled task problem.
Math. Meth. of OR, 2014
On-line bin packing with restricted repacking.
J. Comb. Optim., 2014
New lower bounds for certain classes of bin packing algorithms.
Theor. Comput. Sci., 2012
Improved analysis of an algorithm for the coupled task problem with UET jobs.
Oper. Res. Lett., 2009
Improved lower bounds for semi-online bin packing problems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
SIAM J. Comput., 2008
An exact algorithm for scheduling identical coupled tasks.
Math. Meth. of OR, 2004
Worst-case analysis of the Iterated Longest Fragment algorithm.
Inf. Process. Lett., 2001
A 5/4 Linear Time Bin Packing Algorithm.
J. Comput. Syst. Sci., 2000
Analysis of permutation routing algorithms.
European Journal of Operational Research, 2000
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling".
SIAM J. Comput., 1997
Greedy Algorithms for On-Line Data Compression.
J. Algorithms, 1997
The Fractional Greedy Algorithm for Data Compression.
Minimizing the weighted number of late jobs in UET open shops.
Math. Meth. of OR, 1995
On-line bin packing - A restricted survey.
Math. Meth. of OR, 1995
Worst-Case Analysis for On-Line Data Compression.
Proceedings of the Combinatorics and Computer Science, 1995
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms.
An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling.
SIAM J. Comput., 1993
A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case.
Discrete Applied Mathematics, 1993
Repacking helps in bounded space on-line bind-packing.
A Lower Bound for On-Line Vector-Packing Algorithms.
Acta Cybern., 1993
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems.
J. Algorithms, 1991
A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing.
Acta Cybern., 1991
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem.
On the expected behaviour of the NF algorithm for a dual bin-packing problem.
Acta Cybern., 1987
An O(n) bin-packing algorithm for uniformly distributed data.