János Balogh

According to our database, János Balogh authored at least 29 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Extremal behavior of the Greedy algorithm for a triangle scheduling problem.

János Balogh, József Békési, Nóra Büki, György Dósa, Zsolt Tuza

Comput. Oper. Res., 2024

No Tiling of the 70 × 70 Square with Consecutive Squares.

Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2022

Guillotine cutting is asymptotically optimal for packing consecutive squares.

János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza

Optim. Lett., 2022

Lower bounds for batched bin packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

J. Comb. Optim., 2022

Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems.

János Balogh, György Dósa, Leah Epstein, Lukasz Jez

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

More on ordered open end bin packing.

János Balogh, Leah Epstein, Asaf Levin

J. Sched., 2021

A New Lower Bound for Classic Online Bin Packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

Algorithmica, 2021

Truly Asymptotic Lower Bounds for Online Vector Bin Packing.

János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin

Proceedings of the Approximation, 2021

2020

Online bin packing with cardinality constraints resolved.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

J. Comput. Syst. Sci., 2020

On the heapability of finite partial orders.

János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca

Discret. Math. Theor. Comput. Sci., 2020

Truly asymptotic lower bounds for online vector bin packing.

János Balogh, Leah Epstein, Asaf Levin

CoRR, 2020

2019

Lower bounds for online bin covering-type problems.

János Balogh, Leah Epstein, Asaf Levin

J. Sched., 2019

Lower Bounds for Several Online Variants of Bin Packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

Theory Comput. Syst., 2019

The optimal absolute ratio for online bin packing.

János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee

J. Comput. Syst. Sci., 2019

Bin packing problem with scenarios.

Attila Bódis, János Balogh

Central Eur. J. Oper. Res., 2019

2018

A New and Improved Algorithm for Online Bin Packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Computing a minimal partition of partial orders into heapable subsets.

János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate

CoRR, 2017

2016

Lower bound for 3-batched bin packing.

János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan

Discret. Optim., 2016

2015

Offline black and white bin packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza

Theor. Comput. Sci., 2015

Online Results for Black and White Bin Packing.

János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza

Theory Comput. Syst., 2015

2014

On-line bin packing with restricted repacking.

János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt

J. Comb. Optim., 2014

2013

Semi-on-line bin packing: a short overview and a new lower bound.

János Balogh, József Békési

Central Eur. J. Oper. Res., 2013

2012

New lower bounds for certain classes of bin packing algorithms.

János Balogh, József Békési, Gábor Galambos

Theor. Comput. Sci., 2012

Black and White Bin Packing.

János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

2011

Driver scheduling based on "driver-friendly" vehicle schedules.

Viktor Árgilán, János Balogh, József Békési, Balázs Dávid, Miklós Krész, Attila Tóth

Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2009

Globális optimalizálási alkalmazások és szemi-on-line ládapakolás

János Balogh

PhD thesis, 2009

Improved lower bounds for semi-online bin packing problems.

János Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót

Computing, 2009

2008

Lower Bound for the Online Bin Packing Problem with Restricted Repacking.

János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt

SIAM J. Comput., 2008

2004

Some Global Optimization Problems on Stiefel Manifolds.

János Balogh, Tibor Csendes, Tamás Rapcsák

J. Glob. Optim., 2004