Martin Böhm

48 papers A* 2A 4B 6C 2Journal 33Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Servicing Matched Client Pairs with Facilities.
CoRR
Fateme Abbasi, Martin Böhm, Jaroslaw Byrka, Matin Mohammadi, Yongho Shin
2025 A conf
A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs.
ESA
Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Lukasz Jez, Jirí Sgall, Agnieszka Tatarczuk
2025 J jnl
A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs.
CoRR
Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Lukasz Jez, Jirí Sgall, Agnieszka Tatarczuk
2025 A* conf
Approximating Traveling Salesman Problems Using a Bridge Lemma.
SODA
Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase
2024 J jnl
Approximating TSP Variants Using a Bridge Lemma.
CoRR
Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase
2024 A conf
Improved Online Load Balancing with Known Makespan.
APPROX/RANDOM
Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee
2024 J jnl
Improved online load balancing with known makespan.
CoRR
Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee
2023 J jnl
Submodularity Gaps for Selected Network Design and Matching Problems.
CoRR
Martin Böhm, Jaroslaw Byrka, Mateusz Lewandowski, Jan Marcinkowski
2022 J jnl
Discovering and certifying lower bounds for the online bin stretching problem.
Theor. Comput. Sci.
Martin Böhm, Bertrand Simon
2022 J jnl
On Hop-Constrained Steiner Trees in Tree-Like Metrics.
SIAM J. Discret. Math.
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
2022 A conf
Online Facility Location with Linear Delay.
APPROX/RANDOM
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski
2022 J jnl
Throughput scheduling with equal additive laxity.
Oper. Res. Lett.
Martin Böhm, Nicole Megow, Jens Schlöter
2021 B conf
Improved Analysis of Online Balanced Clustering.
WAOA
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
2021 J jnl
Improved Analysis of Online Balanced Clustering.
CoRR
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
2021 J jnl
New results on multi-level aggregation.
Theor. Comput. Sci.
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
2021 J jnl
On packet scheduling with adversarial jamming and speedup.
Ann. Oper. Res.
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
2021 J jnl
Online Facility Location with Linear Delay.
CoRR
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski
2021 C conf
Throughput Scheduling with Equal Additive Laxity.
CIAC
Martin Böhm, Nicole Megow, Jens Schlöter
2020 B conf
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.
MFCS
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
2020 J jnl
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics.
CoRR
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
2020 J jnl
Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem.
CoRR
Martin Böhm, Bertrand Simon
2020 J jnl
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
CoRR
Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
2020 J jnl
Nested Convex Bodies are Chaseable.
Algorithmica
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2020 J jnl
Online Algorithms for Multilevel Aggregation.
Oper. Res.
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
2019 J jnl
Online packet scheduling with bounded delay and lookahead.
Theor. Comput. Sci.
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
2018 J jnl
Colored Bin Packing: Online Algorithms and Lower Bounds.
Algorithmica
Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý
2018 J jnl
Logarithmic price of buffer downscaling on line metrics.
Theor. Comput. Sci.
Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý
2018 A* conf
Nested Convex Bodies are Chaseable.
SODA
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2018 J jnl
Online Chromatic Number is PSPACE-Complete.
Theory Comput. Syst.
Martin Böhm, Pavel Veselý
2017 J jnl
A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2017 J jnl
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2017 J jnl
Nested Convex Bodies are Chaseable.
CoRR
Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh
2017 B conf
On Packet Scheduling with Adversarial Jamming and Speedup.
WAOA
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
2017 J jnl
On Packet Scheduling with Adversarial Jamming and Speedup.
CoRR
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
2017 J jnl
Online bin stretching with three bins.
J. Sched.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2016 J jnl
Logarithmic price of buffer downscaling on line metrics.
CoRR
Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý
2016 — conf
Lower Bounds for Online Bin Stretching with Several Bins.
SOFSEM (Student Research Forum Papers / Posters)
Martin Böhm
2016 A conf
Online Algorithms for Multi-Level Aggregation.
ESA
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý
2016 C conf
Online Chromatic Number is PSPACE-Complete.
IWOCA
Martin Böhm, Pavel Veselý
2016 J jnl
Online Chromatic Number is PSPACE-Complete.
CoRR
Martin Böhm, Pavel Veselý
2016 B conf
Online Packet Scheduling with Bounded Delay and Lookahead.
ISAAC
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
2016 J jnl
Online Packet Scheduling with Bounded Delay and Lookahead.
CoRR
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
2016 J jnl
The Best Two-Phase Algorithm for Bin Stretching.
CoRR
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2015 J jnl
Online Algorithms for Multi-Level Aggregation.
CoRR
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
2014 B conf
Better Algorithms for Online Bin Stretching.
WAOA
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2014 J jnl
Better Algorithms for Online Bin Stretching.
CoRR
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2014 B conf
Online Colored Bin Packing.
WAOA
Martin Böhm, Jirí Sgall, Pavel Veselý
2014 J jnl
Online Colored Bin Packing.
CoRR
Martin Böhm, Jirí Sgall, Pavel Veselý