József Békési

50 papers A* 1A 2B 4Misc 1Journal 38Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
More on online cardinality constrained bin packing with small cardinality bounds.
Theor. Comput. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2026 J jnl
No tiling of the 70 × 70 square with consecutive squares.
Theor. Comput. Sci.
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
2024 J jnl
Extremal behavior of the Greedy algorithm for a triangle scheduling problem.
Comput. Oper. Res.
János Balogh, József Békési, Nóra Büki, György Dósa, Zsolt Tuza
2024 Misc conf
No Tiling of the 70 × 70 Square with Consecutive Squares.
FUN
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
2023 J jnl
Adaptive Savitzky-Golay Filters for Analysis of Copy Number Variation Peaks from Whole-Exome Sequencing Data.
Inf.
Peter Juma Ochieng, Zoltán Maróti, József Dombi, Miklós Krész, József Békési, Tibor Kalmár
2023 J jnl
Joint replenishment meets scheduling.
J. Sched.
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
2022 J jnl
A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays.
Eur. J. Oper. Res.
József Békési, György Dósa, Gábor Galambos
2022 J jnl
Lower bounds for batched bin packing.
J. Comb. Optim.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2021 J jnl
A New Lower Bound for Classic Online Bin Packing.
Algorithmica
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2021 J jnl
Joint replenishment meets scheduling.
CoRR
Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési
2020 J jnl
Online bin packing with cardinality constraints resolved.
J. Comput. Syst. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019 B conf
A New Lower Bound for Classic Online Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019 J jnl
Lower Bounds for Several Online Variants of Bin Packing.
Theory Comput. Syst.
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019 J jnl
The optimal absolute ratio for online bin packing.
J. Comput. Syst. Sci.
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2018 A conf
A New and Improved Algorithm for Online Bin Packing.
ESA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2018 J jnl
A new lower bound for classic online bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2018 J jnl
Integrated Vehicle Scheduling and Vehicle Assignment.
Acta Cybern.
József Békési, Balázs Dávid, Miklós Krész
2018 J jnl
Regional Multicriteria and Multimodal Route Planning System for Public Transportation: A Case Study.
Acta Cybern.
József Békési
2018 J jnl
Tight bounds for NF-based bounded-space online bin packing algorithms.
J. Comb. Optim.
József Békési, Gábor Galambos
2017 J jnl
A new and improved algorithm for online bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 B conf
Lower Bounds for Several Online Variants of Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 J jnl
Lower bounds for several online variants of bin packing.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017 A conf
Online Bin Packing with Cardinality Constraints Resolved.
ESA
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2016 J jnl
Bounds for online bin packing with cardinality constraints.
Inf. Comput.
József Békési, György Dósa, Leah Epstein
2016 J jnl
Lower bound for 3-batched bin packing.
Discret. Optim.
János Balogh, József Békési, Gábor Galambos, György Dósa, Zhiyi Tan
2016 J jnl
Matrix transpose on meshes with buses.
J. Parallel Distributed Comput.
József Békési, Gábor Galambos
2016 J jnl
Online bin packing with cardinality constraints resolved.
CoRR
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2016 — ch.
Routing.
Encyclopedia of Algorithms
József Békési, Gábor Galambos
2015 J jnl
Offline black and white bin packing.
Theor. Comput. Sci.
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza
2015 J jnl
Online Results for Black and White Bin Packing.
Theory Comput. Syst.
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza
2015 A* conf
The optimal absolute ratio for online bin packing.
SODA
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2014 J jnl
A branch-and-bound algorithm for the coupled task problem.
Math. Methods Oper. Res.
József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt
2014 J jnl
On-line bin packing with restricted repacking.
J. Comb. Optim.
János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
2013 J jnl
Lower bounds for online makespan minimization on a small number of related machines.
J. Sched.
Lukasz Jez, Jarett Schwartz, Jirí Sgall, József Békési
2013 J jnl
Semi-on-line bin packing: a short overview and a new lower bound.
Central Eur. J. Oper. Res.
János Balogh, József Békési
2012 B conf
Black and White Bin Packing.
WAOA
János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza
2012 J jnl
New lower bounds for certain classes of bin packing algorithms.
Theor. Comput. Sci.
János Balogh, József Békési, Gábor Galambos
2011 — conf
Driver scheduling based on "driver-friendly" vehicle schedules.
OR
Viktor Árgilán, János Balogh, József Békési, Balázs Dávid, Miklós Krész, Attila Tóth
2010 B conf
New Lower Bounds for Certain Classes of Bin Packing Algorithms.
WAOA
János Balogh, József Békési, Gábor Galambos
2009 J jnl
Improved analysis of an algorithm for the coupled task problem with UET jobs.
Oper. Res. Lett.
József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt
2009 J jnl
Improved lower bounds for semi-online bin packing problems.
Computing
János Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót
2008 J jnl
Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
SIAM J. Comput.
János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
2008 — ch.
Routing.
Encyclopedia of Algorithms
József Békési, Gábor Galambos
2004 J jnl
An exact algorithm for scheduling identical coupled tasks.
Math. Methods Oper. Res.
Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt
2001 J jnl
Worst-case analysis of the Iterated Longest Fragment algorithm.
Inf. Process. Lett.
József Békési, Gábor Galambos
2000 J jnl
A 5/4 Linear Time Bin Packing Algorithm.
J. Comput. Syst. Sci.
József Békési, Gábor Galambos, Hans Kellerer
2000 J jnl
Analysis of permutation routing algorithms.
Eur. J. Oper. Res.
József Békési, Gábor Galambos, Péter Hajnal
1997 J jnl
Greedy Algorithms for On-Line Data Compression.
J. Algorithms
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1996 J jnl
The Fractional Greedy Algorithm for Data Compression.
Computing
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger
1995 — conf
Worst-Case Analysis for On-Line Data Compression.
Combinatorics and Computer Science
József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger