József Békési

According to our database, József Békési authored at least 38 papers between 1995 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

2023

Joint replenishment meets scheduling.

Péter Györgyi, Tamás Kis, Tímea Tamási, József Békési

J. Sched., February, 2023

Adaptive Savitzky-Golay Filters for Analysis of Copy Number Variation Peaks from Whole-Exome Sequencing Data.

Peter Juma Ochieng, Zoltán Maróti, József Dombi, Miklós Krész, József Békési, Tibor Kalmár

Inf., February, 2023

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

A first Fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays.

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

Eur. J. Oper. Res., 2022

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

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

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

2018

Tight bounds for NF-based bounded-space online bin packing algorithms.

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

J. Comb. Optim., 2018

Integrated Vehicle Scheduling and Vehicle Assignment.

József Békési, Balázs Dávid, Miklós Krész

Acta Cybern., 2018

Regional Multicriteria and Multimodal Route Planning System for Public Transportation: A Case Study.

József Békési

Acta Cybern., 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

2016

Routing.

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

Encyclopedia of Algorithms, 2016

Matrix transpose on meshes with buses.

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

J. Parallel Distributed Comput., 2016

Bounds for online bin packing with cardinality constraints.

József Békési, György Dósa, Leah Epstein

Inf. Comput., 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

A branch-and-bound algorithm for the coupled task problem.

József Békési, Gábor Galambos, Michael N. Jung, Marcus Oswald, Gerhard Reinelt

Math. Methods Oper. Res., 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

Lower bounds for online makespan minimization on a small number of related machines.

Lukasz Jez, Jarett Schwartz, Jirí Sgall, József Békési

J. Sched., 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

Improved analysis of an algorithm for the coupled task problem with UET jobs.

József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt

Oper. Res. Lett., 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

Routing.

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

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 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

An exact algorithm for scheduling identical coupled tasks.

Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt

Math. Methods Oper. Res., 2004

2001

Worst-case analysis of the Iterated Longest Fragment algorithm.

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

Inf. Process. Lett., 2001

2000

A 5/4 Linear Time Bin Packing Algorithm.

József Békési, Gábor Galambos, Hans Kellerer

J. Comput. Syst. Sci., 2000

Analysis of permutation routing algorithms.

József Békési, Gábor Galambos, Péter Hajnal

Eur. J. Oper. Res., 2000

1997

Greedy Algorithms for On-Line Data Compression.

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger

J. Algorithms, 1997

1996

The Fractional Greedy Algorithm for Data Compression.

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger

Computing, 1996

1995

Worst-Case Analysis for On-Line Data Compression.

József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger

Proceedings of the Combinatorics and Computer Science, 1995