| New lower bounds for certain classes of bin packing algorithms J Balogh, J Békési, G Galambos Theoretical Computer Science 440, 1-13, 2012 | 134 | 2012 |
| A new and improved algorithm for online bin packing J Balogh, J Békési, G Dósa, L Epstein, A Levin arXiv preprint arXiv:1707.01728, 2017 | 98 | 2017 |
| An exact algorithm for scheduling identical coupled tasks D Ahr, J Békési, G Galambos, M Oswald, G Reinelt Mathematical Methods of Operations Research 59 (2), 193-203, 2004 | 68 | 2004 |
| A new lower bound for classic online bin packing J Balogh, J Békési, G Dósa, L Epstein, A Levin Algorithmica 83 (7), 2047-2062, 2021 | 65 | 2021 |
| A 5/4 linear time bin packing algorithm J Bekesi, G Galambos, H Kellerer Journal of Computer and System Sciences 60 (1), 145-160, 2000 | 54 | 2000 |
| The optimal absolute ratio for online bin packing J Balogh, J Békési, G Dósa, J Sgall, R Stee Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete …, 2014 | 53 | 2014 |
| Lower bound for the online bin packing problem with restricted repacking J Balogh, J Békési, G Galambos, G Reinelt SIAM Journal on Computing 38 (1), 398-410, 2008 | 38 | 2008 |
| New lower bounds for certain classes of bin packing algorithms J Balogh, J Békési, G Galambos International Workshop on Approximation and Online Algorithms, 25-36, 2010 | 37 | 2010 |
| Online bin packing with cardinality constraints resolved J Balogh, J Békési, G Dósa, L Epstein, A Levin Journal of Computer and System Sciences 112, 34-49, 2020 | 31 | 2020 |
| On-line bin packing with restricted repacking J Balogh, J Békési, G Galambos, G Reinelt Journal of Combinatorial Optimization 27 (1), 115-131, 2014 | 31 | 2014 |
| Online results for black and white bin packing J Balogh, J Békési, G Dósa, L Epstein, H Kellerer, Z Tuza Theory of Computing Systems 56 (1), 137-155, 2015 | 26 | 2015 |
| Bounds for online bin packing with cardinality constraints J Békési, G Dósa, L Epstein Information and Computation 249, 190-204, 2016 | 24 | 2016 |
| Black and white bin packing J Balogh, J Békési, G Dosa, H Kellerer, Z Tuza International Workshop on Approximation and Online Algorithms, 131-144, 2012 | 23 | 2012 |
| Lower bound for 3-batched bin packing J Balogh, J Békési, G Galambos, G Dósa, Z Tan Discrete Optimization 21, 14-24, 2016 | 20 | 2016 |
| Improved analysis of an algorithm for the coupled task problem with UET jobs J Békési, G Galambos, M Oswald, G Reinelt Operations Research Letters 37 (2), 93-96, 2009 | 20 | 2009 |
| An integrated framework for bus logistics management: Case studies J Békési, A Brodnik, M Krész, D Pash Logistik Management: Systeme, Methoden, Integration, 389-411, 2009 | 19 | 2009 |
| Adaptive Savitzky–Golay Filters for Analysis of Copy Number Variation Peaks from Whole-Exome Sequencing Data PJ Ochieng, Z Maróti, J Dombi, M Krész, J Békési, T Kalmár Information 14 (2), 128, 2023 | 18 | 2023 |
| Semi-on-line bin packing: a short overview and a new lower bound J Balogh, J Békési Central European Journal of Operations Research 21 (4), 685-698, 2013 | 17 | 2013 |
| Lower bounds for several online variants of bin packing J Balogh, J Békési, G Dósa, L Epstein, A Levin Theory of Computing Systems 63 (8), 1757-1780, 2019 | 16 | 2019 |
| Offline black and white bin packing J Balogh, J Békési, G Dósa, L Epstein, H Kellerer, A Levin, Z Tuza Theoretical Computer Science 596, 92-101, 2015 | 16 | 2015 |
János BaloghAssociate Professor of Operations ResearchVerified email at inf.u-szeged.hu
