Martin Böhm

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Online facility location with linear delay	2024-08-22	Paper
Throughput scheduling with equal additive laxity	2023-03-22	Paper
Discovering and certifying lower bounds for the online bin stretching problem	2022-10-24	Paper
Improved analysis of online balanced clustering	2022-10-19	Paper
Throughput scheduling with equal additive laxity	2022-10-17	Paper
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics	2022-07-18	Paper
On Hop-Constrained Steiner Trees in Tree-Like Metrics	2022-06-03	Paper
On packet scheduling with adversarial jamming and speedup	2021-05-05	Paper
New results on multi-level aggregation	2021-03-09	Paper
Online Algorithms for Multilevel Aggregation	2020-11-04	Paper
Nested convex bodies are chaseable	2020-04-14	Paper
Online packet scheduling with bounded delay and lookahead	2019-05-29	Paper
Online chromatic number is PSPACE-complete	2018-08-03	Paper
On packet scheduling with adversarial jamming and speedup	2018-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q4636503	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4607969	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4606281	2018-03-02	Paper
Colored bin packing: online algorithms and lower bounds	2018-02-28	Paper
Online bin stretching with three bins	2018-02-28	Paper
Logarithmic price of buffer downscaling on line metrics	2017-12-20	Paper
A two-phase algorithm for bin stretching with stretching factor 1.5	2017-11-16	Paper
Online chromatic number is PSPACE-complete	2016-09-29	Paper
Better Algorithms for Online Bin Stretching	2015-11-20	Paper
Online Colored Bin Packing	2015-11-20	Paper
https://portal.mardi4nfdi.de/entity/Q4394847	1998-06-11	Paper
Efficient algorithm for computing optimal control of antennas in hyperthermia	1994-11-17	Paper

Research outcomes over time

This page was built for person: Martin Böhm