Martin Böhm
Martin Böhm
Postdoctoral researcher, University of Bremen
Verified email at uni-bremen.de - Homepage
Title
Cited by
Cited by
Year
Nested convex bodies are chaseable
N Bansal, M Böhm, M Eliáš, G Koumoutsos, SW Umboh
Algorithmica, 1-14, 2019
192019
Online colored bin packing
M Böhm, J Sgall, P Veselý
International Workshop on Approximation and Online Algorithms, 35-46, 2014
182014
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
162014
Lower Bounds for Online Bin Stretching with Several Bins.
M Böhm
SOFSEM (Student Research Forum Papers/Posters), 1-12, 2016
82016
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
72017
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
62019
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
62018
Online bin stretching with three bins
M Böhm, J Sgall, R van Stee, P Veselý
Journal of Scheduling 20 (6), 601-621, 2017
52017
Online chromatic number is PSPACE-complete
M Böhm, P Veselý
Theory of Computing Systems 62 (6), 1366-1391, 2018
42018
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
32018
On packet scheduling with adversarial jamming and speedup
M Böhm, Ł Jeż, J Sgall, P Veselý
Annals of Operations Research, 1-36, 2019
22019
Online Bin Stretching: Algorithms and Computer Lower Bounds
M Böhm
Univerzita Karlova, Matematicko-fyzikální fakulta, 2018
12018
The Best Two-Phase Algorithm for Bin Stretching
M Böhm, J Sgall, R Van Stee, P Veselý
Springer, 2016
12016
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
M Böhm, F Eberle, N Megow, B Simon, L Nölke, J Schlöter, A Wiese
arXiv preprint arXiv:2007.08415, 2020
2020
Computing a Minimum-Cost -hop Steiner Tree in Tree-Like Metrics
M Böhm, R Hoeksma, N Megow, L Nölke, B Simon
arXiv preprint arXiv:2003.05699, 2020
2020
Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem
M Böhm, B Simon
arXiv preprint arXiv:2001.01125, 2020
2020
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
2020
Nekonečné matroidy
M Böhm
Univerzita Karlova, Matematicko-fyzikální fakulta, 2013
2013
Graph labeling
M Böhm
Univerzita Karlova, Matematicko-fyzikální fakulta, 2011
2011
The system can't perform the operation now. Try again later.
Articles 1–19