Martin Böhm

According to our database, Martin Böhm authored at least 26 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Approximating TSP Variants Using a Bridge Lemma.

Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase

CoRR, 2024

Improved Online Load Balancing with Known Makespan.

Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee

Proceedings of the Approximation, 2024

2023

Submodularity Gaps for Selected Network Design and Matching Problems.

Martin Böhm, Jaroslaw Byrka, Mateusz Lewandowski, Jan Marcinkowski

CoRR, 2023

2022

Discovering and certifying lower bounds for the online bin stretching problem.

Martin Böhm, Bertrand Simon

Theor. Comput. Sci., 2022

On Hop-Constrained Steiner Trees in Tree-Like Metrics.

Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon

SIAM J. Discret. Math., 2022

Throughput scheduling with equal additive laxity.

Martin Böhm, Nicole Megow, Jens Schlöter

Oper. Res. Lett., 2022

Online Facility Location with Linear Delay.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski

Proceedings of the Approximation, 2022

2021

New results on multi-level aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý

Theor. Comput. Sci., 2021

On packet scheduling with adversarial jamming and speedup.

Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý

Ann. Oper. Res., 2021

Improved Analysis of Online Balanced Clustering.

Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

2020

Online Algorithms for Multilevel Aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý

Oper. Res., 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.

Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese

CoRR, 2020

Nested Convex Bodies are Chaseable.

Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh

Algorithmica, 2020

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.

Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Online packet scheduling with bounded delay and lookahead.

Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý

Theor. Comput. Sci., 2019

2018

Logarithmic price of buffer downscaling on line metrics.

Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý

Theor. Comput. Sci., 2018

Online Chromatic Number is PSPACE-Complete.

Martin Böhm, Pavel Veselý

Theory Comput. Syst., 2018

Colored Bin Packing: Online Algorithms and Lower Bounds.

Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý

Algorithmica, 2018

2017

Online bin stretching with three bins.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

J. Sched., 2017

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

J. Comb. Optim., 2017

A two-phase algorithm for bin stretching with stretching factor 1.5.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

J. Comb. Optim., 2017

2016

The Best Two-Phase Algorithm for Bin Stretching.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

CoRR, 2016

Lower Bounds for Online Bin Stretching with Several Bins.

Martin Böhm

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2016 co-located with 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), 2016

Online Algorithms for Multi-Level Aggregation.

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014

Online Colored Bin Packing.

Martin Böhm, Jirí Sgall, Pavel Veselý

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Better Algorithms for Online Bin Stretching.

Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014