Print preview VALIDITY EXPIRED personal data approved: 2017. XII. 02. Publications |
2017
from data base, 2018. III. 03. |
József Békési, Gábor Galambos: Tight bounds for NF-based bounded-space online bin packing algorithms, JOURNAL OF COMBINATORIAL OPTIMIZATION : pp. 1-15. type of document: Journal paper/Article language: English DOI |
2016
from data base, 2018. III. 03. |
Balogh János, Békési József, Galambos Gábor, Dósa György, Tan Zhiyi: Lower bound for 3-batched bin packing, DISCRETE OPTIMIZATION 21: pp. 14-24. type of document: Journal paper/Article number of independent citations: 2 language: English DOI |
2014
from data base, 2018. III. 03. |
János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt: On-line bin packing with restricted repacking, JOURNAL OF COMBINATORIAL OPTIMIZATION 27: (1) pp. 115-131. type of document: Journal paper/Article number of independent citations: 9 language: English DOI |
2014
from data base, 2018. III. 03. |
J Békési, G Galambos, M N Jung, M Oswald G Reinelt: A branch-and-bound algorithm for the coupled task problem, MATHEMATICAL METHODS OF OPERATIONS RESEARCH 80: pp. 47-81. type of document: Journal paper/Article number of independent citations: 2 language: English DOI |
2013
from data base, 2018. III. 03. |
EG Coffman, J Csirik, G Galambos, S Martello, D Vigo: Bin Packing Approximation Algorithms: Survey and Classification, In: Szerk.: Pardalos Panos, Szerk.: Du Ding-Zhu, Szerk.: Graham Ronald L Handbook of Combinatorial Optimization. New York: Springer, 2013. pp. 455-531. Second edition type of document: Part of book/Könyvfejezet (to be translated) number of independent citations: 36 language: English DOI |
2012
from data base, 2018. III. 03. |
János Balogh, József Békési, Gábor Galambos: New lower bounds for certain classes of bin packing algorithms, THEORETICAL COMPUTER SCIENCE 440-441: pp. 1-13. type of document: Journal paper/Article number of independent citations: 44 language: English DOI |
2004
from data base, 2018. III. 03. |
Ahr D, Békési J, Galambos G, Oswald M, Reinelt G: An exact algorithm for scheduling identical coupled tasks, MATHEMATICAL METHODS OF OPERATIONS RESEARCH 59: (2) pp. 193-203. type of document: Journal paper/Article number of independent citations: 25 language: English DOI |
1997
from data base, 2018. III. 03. |
Bekesi J, Galambos G, Pferschy U, Woeginger GJ: Greedy algorithms for on-line data compression, JOURNAL OF ALGORITHMS 25: (2) pp. 274-289. type of document: Journal paper/Article number of independent citations: 7 language: English DOI |
1993
from data base, 2018. III. 03. |
GALAMBOS G, WOEGINGER GJ: AN ONLINE SCHEDULING HEURISTIC WITH BETTER WORST CASE RATIO THAN GRAHAM LIST SCHEDULING, SIAM JOURNAL ON COMPUTING 22: (2) pp. 349-355. type of document: Journal paper/Article number of independent citations: 93 language: English DOI |
1991
from data base, 2018. III. 03. |
G Galambos: A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing, ACTA CYBERNETICA 10: (1-2) pp. 21-24. type of document: Journal paper/Article number of independent citations: 19 language: English
|
| Number of independent citations to these publications: | 237 |
|
|