Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf:
Lower bounds for batched bin packing.
JOURNAL OF COMBINATORIAL OPTIMIZATION, 43 (3).
pp. 613-629.
ISSN 1382-6905
(2022)
Balogh János and Epstein Leah and Levin Asaf:
More on ordered open end bin packing.
JOURNAL OF SCHEDULING, 24 (6).
pp. 589-614.
ISSN 1094-6136
(2021)
Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf:
A New Lower Bound for Classic Online Bin Packing.
ALGORITHMICA, 83 (7).
pp. 2047-2062.
ISSN 0178-4617
(2021)
Balogh János and Cohen Ilan Reuven and Epstein Leah and Levin Asaf:
Truly Asymptotic Lower Bounds for Online Vector Bin Packing.
In:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021).
Leibniz International Proceedings in Informatics, LIPIcs
(207).
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz, 8:1-8:18.
(2021)
ISBN 9783959772075
Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf:
A New Lower Bound for Classic Online Bin Packing.
LECTURE NOTES IN COMPUTER SCIENCE, 11926.
pp. 18-28.
ISSN 0302-9743
(2020)
Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf:
Online bin packing with cardinality constraints resolved.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 112.
pp. 34-49.
ISSN 0022-0000
(2020)
Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf:
Lower Bounds for Several Online Variants of Bin Packing.
THEORY OF COMPUTING SYSTEMS, 63 (8).
pp. 1757-1780.
ISSN 1432-4350
(2019)
Balogh János and Epstein Leah and Levin Asaf:
Lower bounds for online bin covering-type problems.
JOURNAL OF SCHEDULING, 22 (4).
pp. 487-497.
ISSN 1094-6136
(2019)
Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf:
Lower bounds for several online variants of bin packing.
LECTURE NOTES IN COMPUTER SCIENCE, 10787.
pp. 102-117.
ISSN 0302-9743
(2018)
Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf:
A New and Improved Algorithm for Online Bin Packing.
In:
26th Annual European Symposium on Algorithms (ESA 2018).
Leibniz-Zentrum für Informatik, Schloss Dagstuhl.
(2018)
ISBN 9783959770811
Balogh János and Békési József and Dósa György and Epstein Leah and Levin Asaf:
Online bin packing with cardinality constraints resolved.
In:
25th Annual European Symposium on Algorithms (ESA 2017).
Leibniz-Zentrum für Informatik, Wadern.
(2017)
ISBN 9783959770491
Epstein Leah and Imreh Csanád and Levin Asaf and Nagy-György Judit:
Online File Caching with Rejection Penalties.
ALGORITHMICA, 71 (2).
pp. 279-306.
ISSN 0178-4617
(2015)