The following pages link to Martin Böhm (Q726095):
Displaying 25 items.
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- Efficient algorithm for computing optimal control of antennas in hyperthermia (Q1312220) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- Logarithmic price of buffer downscaling on line metrics (Q1685970) (← links)
- Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
- Online bin stretching with three bins (Q1702659) (← links)
- Nested convex bodies are chaseable (Q1987239) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- Improved analysis of online balanced clustering (Q2085752) (← links)
- Discovering and certifying lower bounds for the online bin stretching problem (Q2089680) (← links)
- Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
- Better Algorithms for Online Bin Stretching (Q3453280) (← links)
- Online Colored Bin Packing (Q3453281) (← links)
- (Q4394847) (← links)
- (Q4606281) (← links)
- (Q4607969) (← links)
- (Q4636503) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5896878) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5915656) (← links)
- Throughput scheduling with equal additive laxity (Q5918523) (← links)
- Throughput scheduling with equal additive laxity (Q5925675) (← links)
- Online facility location with linear delay (Q6591899) (← links)
