default search action
János Balogh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]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) - [c11]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 - 2022
- [j19]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) - [j18]János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
Guillotine cutting is asymptotically optimal for packing consecutive squares. Optim. Lett. 16(9): 2775-2785 (2022) - [c10]János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. IWOCA 2022: 101-113 - [i8]János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower bounds on the performance of online algorithms for relaxed packing problems. CoRR abs/2201.05999 (2022) - 2021
- [j17]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) - [j16]János Balogh, Leah Epstein, Asaf Levin:
More on ordered open end bin packing. J. Sched. 24(6): 589-614 (2021) - [c9]János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin:
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM 2021: 8:1-8:18 - 2020
- [j15]János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca:
On the heapability of finite partial orders. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j14]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) - [i7]János Balogh, Leah Epstein, Asaf Levin:
Truly asymptotic lower bounds for online vector bin packing. CoRR abs/2008.00811 (2020) - [i6]János Balogh, Leah Epstein, Asaf Levin:
More on ordered open end bin packing. CoRR abs/2010.07119 (2020)
2010 – 2019
- 2019
- [j13]Attila Bódis, János Balogh:
Bin packing problem with scenarios. Central Eur. J. Oper. Res. 27(2): 377-395 (2019) - [j12]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) - [j11]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) - [j10]János Balogh, Leah Epstein, Asaf Levin:
Lower bounds for online bin covering-type problems. J. Sched. 22(4): 487-497 (2019) - [c8]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
- [c7]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 - [i5]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
- [c6]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 - [c5]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 - [i4]János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate:
Computing a minimal partition of partial orders into heapable subsets. CoRR abs/1706.01230 (2017) - [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
- [j9]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) - [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
- [j8]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) - [j7]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) - [c4]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
- [j6]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) - 2013
- [j5]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) - 2012
- [j4]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) - [c3]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
- [c2]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
- [c1]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
- [b1]János Balogh:
Globális optimalizálási alkalmazások és szemi-on-line ládapakolás. University of Szeged, Hungary, 2009 - [j3]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) - 2008
- [j2]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) - 2004
- [j1]János Balogh, Tibor Csendes, Tamás Rapcsák:
Some Global Optimization Problems on Stiefel Manifolds. J. Glob. Optim. 30(1): 91-101 (2004)
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-08-03 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint