Gábor Galambos - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2022

A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delaysJózsef Békési, György Dósa, Gábor Galambos. eor, 297(3):844-852, 2022. [doi]

2021

Operations research in Hungary: VOCAL 2018Botond Bertók, Tibor Csendes, Gábor Galambos. cejor, 29(2):379-386, 2021. [doi]

Introduction to Special issue MATCOS-19Andrej Brodnik, Gábor Galambos. informaticaSI, 45(2), 2021. [doi]

2019

Editors' Introduction to the Special Issue on "MATCOS-16 conference"Andrej Brodnik, Gábor Galambos. informaticaSI, 43(1), 2019. [doi]

2018

Tight bounds for NF-based bounded-space online bin packing algorithmsJózsef Békési, Gábor Galambos. jco, 35(2):350-364, 2018. [doi]

2016

Lower bound for 3-batched bin packingJános Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan. disopt, 21:14-24, 2016. [doi]

Matrix transpose on meshes with busesJózsef Békési, Gábor Galambos. jpdc, 96:194-201, 2016. [doi]

2015

Editors' Introduction to the Special Issue on "MATCOS-13 conference"Andrej Brodnik, Gábor Galambos. informaticaSI, 39(3), 2015. [doi]

2014

On-line bin packing with restricted repackingJános Balogh, József Békési, Gábor Galambos, Gerhard Reinelt. jco, 27(1):115-131, 2014. [doi]

A branch-and-bound algorithm for the coupled task problemJózsef Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt. mmor, 80(1):47-81, 2014. [doi]

2012

New lower bounds for certain classes of bin packing algorithmsJános Balogh, József Békési, Gábor Galambos. TCS, 440-441:1-13, 2012. [doi]

2010

New Lower Bounds for Certain Classes of Bin Packing AlgorithmsJános Balogh, József Békési, Gábor Galambos. waoa 2011: 25-36 [doi]

2009

Improved lower bounds for semi-online bin packing problemsJános Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót. computing, 84(1-2):139-148, 2009. [doi]

Improved analysis of an algorithm for the coupled task problem with UET jobsJózsef Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt. orl, 37(2):93-96, 2009. [doi]

2008

Lower Bound for the Online Bin Packing Problem with Restricted RepackingJános Balogh, József Békési, Gábor Galambos, Gerhard Reinelt. SICOMP, 38(1):398-410, 2008. [doi]

2004

An exact algorithm for scheduling identical coupled tasksDino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt. mmor, 59(2):193-203, 2004. [doi]

2001

Worst-case analysis of the Iterated Longest Fragment algorithmJózsef Békési, Gábor Galambos. ipl, 79(3):147-153, 2001. [doi]

2000

A 5/4 Linear Time Bin Packing AlgorithmJózsef Békési, Gábor Galambos, Hans Kellerer. jcss, 60(1):145-160, 2000.

Analysis of permutation routing algorithmsJózsef Békési, Gábor Galambos, Péter Hajnal. eor, 125(2):249-256, 2000. [doi]

1999

Bin Packing Approximation Algorithms: Combinatorial AnalysisEdward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo. In Ding-Zhu Du, Panos M. Pardalos, editors, Handbook of Combinatorial Optimization. pages 151-207, Springer, 1999. [doi]

1997

Greedy Algorithms for On-Line Data CompressionJózsef Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger. jal, 25(2):274-289, 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. SICOMP, 26(3):870-872, 1997.

1996

The Fractional Greedy Algorithm for Data CompressionJózsef Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger. computing, 56(1):29-46, 1996. [doi]

1995

Worst-Case Analysis for On-Line Data CompressionJózsef Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger. cococ 1996: 288-300

Minimizing the weighted number of late jobs in UET open shopsGábor Galambos, Gerhard J. Woeginger. mmor, 41(1):109-114, 1995. [doi]

On-line bin packing - A restricted surveyGábor Galambos, Gerhard J. Woeginger. mmor, 42(1):25-45, 1995. [doi]

1994

Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithmsGábor Galambos, André van Vliet. computing, 52(3):281-297, 1994. [doi]

1993

1991

Probabilistic Analysis of Algorithms for Dual Bin Packing ProblemsJános Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan. jal, 12(2):189-203, 1991.

A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectange Bin-PackingGábor Galambos. actaC, 10(1-2):21-24, 1991. [doi]

1987

On the expected behaviour of the NF algorithm for a dual bin-packing problemJános Csirik, Gábor Galambos. actaC, 8:5-9, 1987.

Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problemJ. B. G. Frenk, Gábor Galambos. computing, 39(3):201-217, 1987. [doi]

1986

An O(n) bin-packing algorithm for uniformly distributed dataJános Csirik, Gábor Galambos. computing, 36(4):313-319, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL