default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJózsef Békési
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]János Balogh, József Békési, Nóra Büki
, György Dósa, Zsolt Tuza:
Extremal behavior of the Greedy algorithm for a triangle scheduling problem. Comput. Oper. Res. 169: 106718 (2024)- [c10]Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza:
No Tiling of the 70 × 70 Square with Consecutive Squares. FUN 2024: 28:1-28:16 - 2023
- [j30]Peter Juma Ochieng, Zoltán Maróti, József Dombi, Miklós Krész, József Békési, Tibor Kalmár:
Adaptive Savitzky-Golay Filters for Analysis of Copy Number Variation Peaks from Whole-Exome Sequencing Data. Inf. 14(2): 128 (2023) - [j29]Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési:
Joint replenishment meets scheduling. J. Sched. 26(1): 77-94 (2023) - 2022
- [j28]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) - [j27]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower bounds for batched bin packing. J. Comb. Optim. 43(3): 613-629 (2022) - 2021
- [j26]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New Lower Bound for Classic Online Bin Packing. Algorithmica 83(7): 2047-2062 (2021) - [i5]Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési:
Joint replenishment meets scheduling. CoRR abs/2104.09178 (2021) - 2020
- [j25]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online bin packing with cardinality constraints resolved. J. Comput. Syst. Sci. 112: 34-49 (2020)
2010 – 2019
- 2019
- [j24]János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee:
The optimal absolute ratio for online bin packing. J. Comput. Syst. Sci. 102: 1-17 (2019) - [j23]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower Bounds for Several Online Variants of Bin Packing. Theory Comput. Syst. 63(8): 1757-1780 (2019) - [c9]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New Lower Bound for Classic Online Bin Packing. WAOA 2019: 18-28 - 2018
- [j22]József Békési:
Regional Multicriteria and Multimodal Route Planning System for Public Transportation: A Case Study. Acta Cybern. 23(3): 773-782 (2018) - [j21]József Békési, Balázs Dávid, Miklós Krész:
Integrated Vehicle Scheduling and Vehicle Assignment. Acta Cybern. 23(3): 783-800 (2018) - [j20]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) - [c8]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New and Improved Algorithm for Online Bin Packing. ESA 2018: 5:1-5:14 - [i4]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A new lower bound for classic online bin packing. CoRR abs/1807.05554 (2018) - 2017
- [c7]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online Bin Packing with Cardinality Constraints Resolved. ESA 2017: 10:1-10:14 - [c6]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower Bounds for Several Online Variants of Bin Packing. WAOA 2017: 102-117 - [i3]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A new and improved algorithm for online bin packing. CoRR abs/1707.01728 (2017) - [i2]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower bounds for several online variants of bin packing. CoRR abs/1708.03228 (2017) - 2016
- [j19]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) - [j18]József Békési, György Dósa, Leah Epstein:
Bounds for online bin packing with cardinality constraints. Inf. Comput. 249: 190-204 (2016) - [j17]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 - [i1]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online bin packing with cardinality constraints resolved. CoRR abs/1608.06415 (2016) - 2015
- [j16]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza:
Online Results for Black and White Bin Packing. Theory Comput. Syst. 56(1): 137-155 (2015) - [j15]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza:
Offline black and white bin packing. Theor. Comput. Sci. 596: 92-101 (2015) - [c5]János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee:
The optimal absolute ratio for online bin packing. SODA 2015: 1425-1438 - 2014
- [j14]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) - [j13]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) - 2013
- [j12]János Balogh, József Békési:
Semi-on-line bin packing: a short overview and a new lower bound. Central Eur. J. Oper. Res. 21(4): 685-698 (2013) - [j11]Lukasz Jez, Jarett Schwartz, Jirí Sgall, József Békési:
Lower bounds for online makespan minimization on a small number of related machines. J. Sched. 16(5): 539-547 (2013) - 2012
- [j10]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) - [c4]János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza:
Black and White Bin Packing. WAOA 2012: 131-144 - 2011
- [c3]Viktor Árgilán, János Balogh, József Békési, Balázs Dávid, Miklós Krész, Attila Tóth:
Driver scheduling based on "driver-friendly" vehicle schedules. OR 2011: 323-328 - 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
- [j9]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) - [j8]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
- [j7]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
- [j6]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
- [j5]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
- [j4]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) - [j3]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
- 1997
- [j2]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) - 1996
- [j1]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
- [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
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 2024-10-07 21:17 CEST 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:
