János Balogh

Orcid: 0000-0002-4611-616X

According to our database1, János Balogh authored at least 27 papers between 2004 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Guillotine cutting is asymptotically optimal for packing consecutive squares.
Optim. Lett., 2022

Lower bounds for batched bin packing.
J. Comb. Optim., 2022

Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021
More on ordered open end bin packing.
J. Sched., 2021

A New Lower Bound for Classic Online Bin Packing.
Algorithmica, 2021

Truly Asymptotic Lower Bounds for Online Vector Bin Packing.
Proceedings of the Approximation, 2021

2020
Online bin packing with cardinality constraints resolved.
J. Comput. Syst. Sci., 2020

On the heapability of finite partial orders.
Discret. Math. Theor. Comput. Sci., 2020

Truly asymptotic lower bounds for online vector bin packing.
CoRR, 2020

2019
Lower bounds for online bin covering-type problems.
J. Sched., 2019

Lower Bounds for Several Online Variants of Bin Packing.
Theory Comput. Syst., 2019

The optimal absolute ratio for online bin packing.
J. Comput. Syst. Sci., 2019

Bin packing problem with scenarios.
Central Eur. J. Oper. Res., 2019

2018
A New and Improved Algorithm for Online Bin Packing.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Computing a minimal partition of partial orders into heapable subsets.
CoRR, 2017

2016
Lower bound for 3-batched bin packing.
Discret. Optim., 2016

2015
Offline black and white bin packing.
Theor. Comput. Sci., 2015

Online Results for Black and White Bin Packing.
Theory Comput. Syst., 2015

2014
On-line bin packing with restricted repacking.
J. Comb. Optim., 2014

2013
Semi-on-line bin packing: a short overview and a new lower bound.
Central Eur. J. Oper. Res., 2013

2012
New lower bounds for certain classes of bin packing algorithms.
Theor. Comput. Sci., 2012

Black and White Bin Packing.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

2011
Driver scheduling based on "driver-friendly" vehicle schedules.
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
PhD thesis, 2009

Improved lower bounds for semi-online bin packing problems.
Computing, 2009

2008
Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
SIAM J. Comput., 2008

2004
Some Global Optimization Problems on Stiefel Manifolds.
J. Glob. Optim., 2004


  Loading...