Szegedi Tudományegyetem | Válogatott publikációk

E-Universitas

Szabadegyetem - Szeged

Korábbi szemeszterek

XII. szemeszter

Könnyű volt-e Sherlock Holmes dolga?

Válogatott publikációk

Cikk nyomtatás

Link küldés

Megosztás

[1]. G. Galambos [1986]: Parametric lower bound for on-line bin-packing. SIAM J. Alg. Disc. Meth. 7 (1986), 362-367.

[2]. J.B.G. Frenk and G. Galambos [1987]: Hybrid Next-Fit Algorithm for the Two-dimensional Rectangular Bin-Packing Problem. Computing 39 (1987), 201-217.

[3]. G. Galambos [1990]: 1.6 Lower Bound for the Two-dimensional On-line Bin-Packing. Acta Cybernetica 10 (1990), 21-24.

[4]. G. Galambos, H. Kellerer, G. Woeginger [1991]: A Lower Bound for On-line Vector Packing Algorithms. Acta Cybernetica. 11 (1993), 23-34.

[5]. J.B.G. Frenk and G. Galambos [1993]: A Simple Proof of Liang's Lower-Bound for On-line Bin-Packing and Extension to the Parametric Case. Discrete Applied Mathematics. 41 (1993), 173-178.

[6]. G. Galambos, G.J. Woeginger [1993]: Repacking Helps in Bounded Space On-line Bin-Packing. Computing. 49 (1993), 329-338.

[7]. G. Galambos, G. Woeginger [1993]: An on-line scheduling heuristic with better worst case ratio than Grahams list scheduling. SIAM Journal on Computing. 22 (1993), 349-355.

[8]. G. Galambos, A. van Vliet [1994]: Lower Bounds for On-line Algorithms for the 1-, 2- and 3- Dimensional Bin Packing Problem. Computing. 52 (1994), 281-297.

[9]. G. Galambos, G.J. Woeginger [1995]: On-line Bin Packing - A Restricted Survey. ZOR 42 (1995), 25-45.

[10]. E.G. Coffman, G. Galambos, S. Martello, D. Vigo [1999]: Bin Packing Approximation Algorithms: Combinatorial Analysis”. In “Handbook of Combinatorial Optimization” Supplement Volume. (Eds. D.-Z. Du and P.M. Pardalos Eds.). Kluwer Academic Publishers. 151-208.

[11]. J. Békési, G. Galambos, P. Hajnal [2000]: ”Analysis of permutation routing algorithms”. EJOR Special Issue of ECCO XI Conference. Eds. J. Krarup and D. Pisinger. 125(2000), 249-256.

[12]. Galambos Gábor [2003]: Operációs Rendszerek. Műszaki Kiadó. 1-172. ISBN 963 162284 3. Budapest, 2003. Book in Hungarian.

[13]. D. Ahr, J. Békési, G. Galambos, M. Oswald, G. Reinelt [2004]: “An Exact Algorithm for Scheduling Identical Coupled Tasks.” Mathematical Methods of Operations Research, Vol.59, Issue 2, 2004.

[14]. Balogh, J., J. Békési, G. Galambos, and G. Reinelt: Lower Bound for the
On-line Bin Packing Problem with Restricted Repacking, SIAM Journal on Computing, 38(2008), 398-410.

[15]. Balogh, J., Békési, J. and Galambos, G.: New Lower Bounds for Certain Classes of Bin Packing Algorithms, Theoretical Computer Science, Vol 440-441(2012), 1-13.