János Balogh

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 27

Top Topics

Online Algorithms

Top Venues

J. Comput. Syst. Sci.

J. Comb. Optim.

Publications

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 (2024)
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)
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) (2022)
János Balogh, György Dósa, Leah Epstein, Lukasz Jez
Lower bounds on the performance of online algorithms for relaxed packing problems. CoRR (2022)
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)
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) (2022)
János Balogh, Leah Epstein, Asaf Levin
More on ordered open end bin packing. J. Sched. 24 (6) (2021)
János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM (2021)
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) (2021)
János Balogh, Leah Epstein, Asaf Levin
More on ordered open end bin packing. CoRR (2020)
János Balogh, Leah Epstein, Asaf Levin
Truly asymptotic lower bounds for online vector bin packing. CoRR (2020)
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)
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 (2020)
János Balogh, Leah Epstein, Asaf Levin
Lower bounds for online bin covering-type problems. J. Sched. 22 (4) (2019)
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) (2019)
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)
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 (2019)
Attila Bódis, János Balogh
Bin packing problem with scenarios. Central Eur. J. Oper. Res. 27 (2) (2019)
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)
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 (2018)
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)
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 (2017)
János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate
Computing a minimal partition of partial orders into heapable subsets. CoRR (2017)
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)
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 (2017)
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 (2016)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Online bin packing with cardinality constraints resolved. CoRR (2016)
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) (2015)
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 (2015)
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)
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) (2014)
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) (2013)
János Balogh, József Békési, Gábor Galambos
New lower bounds for certain classes of bin packing algorithms. Theor. Comput. Sci. (2012)
János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza
Black and White Bin Packing. WAOA (2012)
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)
János Balogh, József Békési, Gábor Galambos
New Lower Bounds for Certain Classes of Bin Packing Algorithms. WAOA (2010)
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) (2009)
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) (2008)
János Balogh, Tibor Csendes, Tamás Rapcsák
Some Global Optimization Problems on Stiefel Manifolds. J. Glob. Optim. 30 (1) (2004)