Gábor Galambos

	2010
19		János Balogh, József Békési, Gábor Galambos: New Lower Bounds for Certain Classes of Bin Packing Algorithms. WAOA 2010: 25-36
	2009
18		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): 139-148 (2009)
17		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): 93-96 (2009)
	2008
16		József Békési, Gábor Galambos: Routing. Encyclopedia of Algorithms 2008
15		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): 398-410 (2008)
	2001
14		József Békési, Gábor Galambos: Worst-case analysis of the Iterated Longest Fragment algorithm. Inf. Process. Lett. 79(3): 147-153 (2001)
	2000
13		József Békési, Gábor Galambos, Péter Hajnal: Analysis of permutation routing algorithms. European Journal of Operational Research 125(2): 249-256 (2000)
12		József Békési, Gábor Galambos, Hans Kellerer: A 5/4 Linear Time Bin Packing Algorithm. J. Comput. Syst. Sci. 60(1): 145-160 (2000)
	1997
11		József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger: Greedy Algorithms for On-Line Data Compression. J. Algorithms 25(2): 274-289 (1997)
10		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): 870-872 (1997)
	1996
9		József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger: The Fractional Greedy Algorithm for Data Compression. Computing 56(1): 29-46 (1996)
	1995
8		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: 288-300
	1994
7		Gábor Galambos, André van Vliet: Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms. Computing 52(3): 281-297 (1994)
	1993
6		Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger: A Lower Bound for On-Line Vector-Packing Algorithms. Acta Cybern. 11(1-2): 23-34 (1993)
5		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. Discrete Applied Mathematics 41(2): 173-178 (1993)
4		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): 349-355 (1993)
	1991
3		Gábor Galambos: A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectange Bin-Packing. Acta Cybern. 10(1-2): 21-24 (1991)
2		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): 189-203 (1991)
	1987
1		János Csirik, Gábor Galambos: On the expected behaviour of the NF algorithm for a dual bin-packing problem. Acta Cybern. 8: 5-9 (1987)

Coauthor Index

1	János Balogh	[15] [18] [19]
2	József Békési	[8] [9] [11] [12] [13] [14] [15] [16] [17] [18] [19]
3	Ramaswamy Chandrasekaran (R. Chandrasekaran)	[10]
4	Bo Chen	[10]
5	János Csirik	[1] [2]
6	J. B. G. Frenk	[2] [5]
7	Péter Hajnal	[13]
8	Alexander H. G. Rinnooy Kan (A. H. G. Rinnooy Kan)	[2]
9	Hans Kellerer	[6] [12]
10	Mihály Csaba Markót	[18]
11	P. R. Narayanan	[10]
12	Marcus Oswald	[17]
13	Ulrich Pferschy	[8] [9] [11]
14	Gerhard Reinelt	[15] [17]
15	André van Vliet	[7] [10]
16	Gerhard J. Woeginger	[4] [6] [8] [9] [11]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page