default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Galambos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j33]József Békési
, György Dósa, Gábor Galambos:
A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays. Eur. J. Oper. Res. 297(3): 844-852 (2022)- 2021
- [j32]Botond Bertók, Tibor Csendes, Gábor Galambos:
Operations research in Hungary: VOCAL 2018. Central Eur. J. Oper. Res. 29(2): 379-386 (2021) - [j31]Andrej Brodnik, Gábor Galambos:
Introduction to Special issue MATCOS-19. Informatica (Slovenia) 45(2) (2021)
2010 – 2019
- 2019
- [j30]Andrej Brodnik, Gábor Galambos:
Editors' Introduction to the Special Issue on "MATCOS-16 conference". Informatica (Slovenia) 43(1) (2019) - 2018
- [j29]József Békési, Gábor Galambos:
Tight bounds for NF-based bounded-space online bin packing algorithms. J. Comb. Optim. 35(2): 350-364 (2018) - 2016
- [j28]János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan:
Lower bound for 3-batched bin packing. Discret. Optim. 21: 14-24 (2016) - [j27]József Békési, Gábor Galambos:
Matrix transpose on meshes with buses. J. Parallel Distributed Comput. 96: 194-201 (2016) - [r2]József Békési, Gábor Galambos:
Routing. Encyclopedia of Algorithms 2016: 1868-1871 - 2015
- [j26]Andrej Brodnik, Gábor Galambos:
Editors' Introduction to the Special Issue on "MATCOS-13 conference". Informatica (Slovenia) 39(3) (2015) - 2014
- [j25]János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt:
On-line bin packing with restricted repacking. J. Comb. Optim. 27(1): 115-131 (2014) - [j24]József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt:
A branch-and-bound algorithm for the coupled task problem. Math. Methods Oper. Res. 80(1): 47-81 (2014) - 2012
- [j23]János Balogh, József Békési, Gábor Galambos:
New lower bounds for certain classes of bin packing algorithms. Theor. Comput. Sci. 440-441: 1-13 (2012) - 2010
- [c2]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
2000 – 2009
- 2009
- [j22]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) - [j21]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
- [j20]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) - [r1]József Békési, Gábor Galambos:
Routing. Encyclopedia of Algorithms 2008 - 2004
- [j19]Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt:
An exact algorithm for scheduling identical coupled tasks. Math. Methods Oper. Res. 59(2): 193-203 (2004) - 2001
- [j18]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
- [j17]József Békési, Gábor Galambos, Péter Hajnal:
Analysis of permutation routing algorithms. Eur. J. Oper. Res. 125(2): 249-256 (2000) - [j16]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)
1990 – 1999
- 1999
- [p1]Edward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo:
Bin Packing Approximation Algorithms: Combinatorial Analysis. Handbook of Combinatorial Optimization 1999: 151-207 - 1997
- [j15]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) - [j14]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
- [j13]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
- [j12]Gábor Galambos, Gerhard J. Woeginger:
Minimizing the weighted number of late jobs in UET open shops. Math. Methods Oper. Res. 41(1): 109-114 (1995) - [j11]Gábor Galambos, Gerhard J. Woeginger:
On-line bin packing - A restricted survey. Math. Methods Oper. Res. 42(1): 25-45 (1995) - [c1]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
- [j10]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
- [j9]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) - [j8]Gábor Galambos, Gerhard Johannes Woeginger:
Repacking helps in bounded space on-line bind-packing. Computing 49(4): 329-338 (1993) - [j7]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. Discret. Appl. Math. 41(2): 173-178 (1993) - [j6]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
- [j5]Gábor Galambos:
A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing. Acta Cybern. 10(1-2): 21-24 (1991) - [j4]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)
1980 – 1989
- 1987
- [j3]János Csirik, Gábor Galambos:
On the expected behaviour of the NF algorithm for a dual bin-packing problem. Acta Cybern. 8(1): 5-9 (1987) - [j2]J. B. G. Frenk, Gábor Galambos:
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem. Computing 39(3): 201-217 (1987) - 1986
- [j1]János Csirik, Gábor Galambos:
An O(n) bin-packing algorithm for uniformly distributed data. Computing 36(4): 313-319 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
