Nested convex bodies are chaseable N Bansal, M Böhm, M Eliáš, G Koumoutsos, SW Umboh
Algorithmica, 1-14, 2019
41 2019 Online colored bin packing M Böhm, J Sgall, P Veselý
International Workshop on Approximation and Online Algorithms, 35-46, 2014
24 2014 A two-phase algorithm for bin stretching with stretching factor 1.5 M Böhm, J Sgall, R Van Stee, P Veselý
Journal of Combinatorial Optimization 34 (3), 810-828, 2017
17 2017 Better algorithms for online bin stretching M Böhm, J Sgall, R van Stee, P Veselý
International Workshop on Approximation and Online Algorithms, 23-34, 2014
17 2014 Online packet scheduling with bounded delay and lookahead M Böhm, M Chrobak, Ł Jeż, F Li, J Sgall, P Veselý
Theoretical Computer Science 776, 95-113, 2019
14 2019 Colored Bin Packing: Online Algorithms and Lower Bounds M Böhm, G Dósa, L Epstein, J Sgall, P Veselý
Algorithmica 80 (1), 155-184, 2018
13 2018 Improved Analysis of Online Balanced Clustering M Bienkowski, M Böhm, M Koutecký, T Rothvoß, J Sgall, P Veselý
International Workshop on Approximation and Online Algorithms, 224-233, 2021
12 2021 Online bin stretching with three bins M Böhm, J Sgall, R van Stee, P Veselý
Journal of Scheduling 20 (6), 601-621, 2017
11 2017 Online Facility Location with Linear Delay M Bienkowski, M Böhm, J Byrka, J Marcinkowski
arXiv preprint arXiv:2110.15155, 2021
8 2021 New results on multi-level aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarczný, Ł Jeż, ...
Theoretical Computer Science 861, 133-143, 2021
8 2021 Online algorithms for multilevel aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarczný, Ł Jeż, ...
Operations Research 68 (1), 214-232, 2020
8 2020 Lower Bounds for Online Bin Stretching with Several Bins. M Böhm
SOFSEM (Student Research Forum Papers/Posters), 1-12, 2016
8 2016 Throughput scheduling with equal additive laxity M Böhm, N Megow, J Schlöter
Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021
7 2021 Online chromatic number is PSPACE-complete M Böhm, P Veselý
Theory of Computing Systems 62 (6), 1366-1391, 2018
6 2018 Discovering and certifying lower bounds for the online bin stretching problem M Böhm, B Simon
Theoretical Computer Science 938, 1-15, 2022
5 2022 Logarithmic price of buffer downscaling on line metrics M Bienkowski, M Böhm, Ł Jeż, P Laskoś-Grabowski, J Marcinkowski, ...
Theoretical Computer Science 707, 89-93, 2018
4 2018 On packet scheduling with adversarial jamming and speedup M Böhm, Ł Jeż, J Sgall, P Veselý
Annals of Operations Research 298, 7-42, 2021
3 2021 Approximating TSP Variants Using a Bridge Lemma M Böhm, Z Friggstad, T Mömke, J Spoerhase
arXiv preprint arXiv:2405.12876, 2024
2 2024 Computing a Minimum-Cost M Böhm, R Hoeksma, N Megow, L Nölke, B Simon
arXiv preprint arXiv:2003.05699, 2020
2 2020 The Best Two-Phase Algorithm for Bin Stretching M Böhm, J Sgall, R Van Stee, P Veselý
Springer, 2016
2 2016 
Pavel VeselýComputer Science Institute of Charles University, Prague, Czech RepublicПодтвержден адрес электронной почты в домене iuuk.mff.cuni.cz
