According to our database1, József Békési authored at least 32 papers between 1995 and 2019.
Legend:Book In proceedings Article PhD thesis Other
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
A New Lower Bound for Classic Online Bin Packing.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019
Tight bounds for NF-based bounded-space online bin packing algorithms.
J. Comb. Optim., 2018
Integrated Vehicle Scheduling and Vehicle Assignment.
Acta Cybern., 2018
Regional Multicriteria and Multimodal Route Planning System for Public Transportation: A Case Study.
Acta Cybern., 2018
A New and Improved Algorithm for Online Bin Packing.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Online Bin Packing with Cardinality Constraints Resolved.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Encyclopedia of Algorithms, 2016
Matrix transpose on meshes with buses.
J. Parallel Distrib. Comput., 2016
Bounds for online bin packing with cardinality constraints.
Inf. Comput., 2016
Lower bound for 3-batched bin packing.
Discrete Optimization, 2016
Offline black and white bin packing.
Theor. Comput. Sci., 2015
Online Results for Black and White Bin Packing.
Theory Comput. Syst., 2015
A branch-and-bound algorithm for the coupled task problem.
Math. Meth. of OR, 2014
On-line bin packing with restricted repacking.
J. Comb. Optim., 2014
Lower bounds for online makespan minimization on a small number of related machines.
J. Scheduling, 2013
Semi-on-line bin packing: a short overview and a new lower bound.
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
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
Improved analysis of an algorithm for the coupled task problem with UET jobs.
Oper. Res. Lett., 2009
Improved lower bounds for semi-online bin packing problems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
SIAM J. Comput., 2008
An exact algorithm for scheduling identical coupled tasks.
Math. Meth. of OR, 2004
Worst-case analysis of the Iterated Longest Fragment algorithm.
Inf. Process. Lett., 2001
A 5/4 Linear Time Bin Packing Algorithm.
J. Comput. Syst. Sci., 2000
Analysis of permutation routing algorithms.
European Journal of Operational Research, 2000
Greedy Algorithms for On-Line Data Compression.
J. Algorithms, 1997
The Fractional Greedy Algorithm for Data Compression.
Worst-Case Analysis for On-Line Data Compression.
Proceedings of the Combinatorics and Computer Science, 1995