Better Algorithms for Online Bin Stretching. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (WAOA, 2014)

Online Colored Bin Packing. - Martin Böhm 001; Jirí Sgall; Pavel Veselý 001 (WAOA, 2014)

Online Algorithms for Multi-Level Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jiri Sgall; Kim Thang Nguyen; Pavel Veselý 001 (ESA, 2016)

Lower Bounds for Online Bin Stretching with Several Bins. - Martin Böhm 001 (SOFSEM (Student Research Forum Papers / Posters), 2016)

The Best Two-Phase Algorithm for Bin Stretching. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (CoRR, 2016)

A two-phase algorithm for bin stretching with stretching factor 1.5. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Comb. Optim., 2017)

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Comb. Optim., 2017)

Online bin stretching with three bins. - Martin Böhm 001; Jirí Sgall; Rob van Stee; Pavel Veselý 001 (J. Sched., 2017)

Colored Bin Packing: Online Algorithms and Lower Bounds. - Martin Böhm 001; György Dósa; Leah Epstein; Jirí Sgall; Pavel Veselý 001 (Algorithmica, 2018)

Online Chromatic Number is PSPACE-Complete. - Martin Böhm 001; Pavel Veselý 001 (Theory Comput. Syst., 2018)

Logarithmic price of buffer downscaling on line metrics. - Marcin Bienkowski; Martin Böhm 001; Lukasz Jez; Pawel Laskos-Grabowski; Jan Marcinkowski; Jirí Sgall; Aleksandra Spyra; Pavel Veselý 001 (Theor. Comput. Sci., 2018)

Online packet scheduling with bounded delay and lookahead. - Martin Böhm 001; Marek Chrobak; Lukasz Jez; Fei Li 001; Jirí Sgall; Pavel Veselý 001 (Theor. Comput. Sci., 2019)

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. - Martin Böhm 001; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Bertrand Simon 001 (MFCS, 2020)

Nested Convex Bodies are Chaseable. - Nikhil Bansal 001; Martin Böhm 001; Marek Eliás 001; Grigorios Koumoutsos; Seeun William Umboh (Algorithmica, 2020)

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. - Martin Böhm 001; Franziska Eberle; Nicole Megow; Lukas Nölke; Jens Schlöter; Bertrand Simon 001; Andreas Wiese (CoRR, 2020)

Online Algorithms for Multilevel Aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Oper. Res., 2020)

Improved Analysis of Online Balanced Clustering. - Marcin Bienkowski; Martin Böhm 001; Martin Koutecký; Thomas Rothvoß; Jirí Sgall; Pavel Veselý 001 (WAOA, 2021)

On packet scheduling with adversarial jamming and speedup. - Martin Böhm 001; Lukasz Jez; Jirí Sgall; Pavel Veselý 001 (Ann. Oper. Res., 2021)

New results on multi-level aggregation. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Marek Chrobak; Christoph Dürr; Lukás Folwarczný; Lukasz Jez; Jirí Sgall; Kim Thang Nguyen; Pavel Veselý 001 (Theor. Comput. Sci., 2021)

Online Facility Location with Linear Delay. - Marcin Bienkowski; Martin Böhm 001; Jaroslaw Byrka; Jan Marcinkowski (APPROX/RANDOM, 2022)

Throughput scheduling with equal additive laxity. - Martin Böhm 001; Nicole Megow; Jens Schlöter (Oper. Res. Lett., 2022)

On Hop-Constrained Steiner Trees in Tree-Like Metrics. - Martin Böhm 001; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Bertrand Simon 001 (SIAM J. Discret. Math., 2022)

Discovering and certifying lower bounds for the online bin stretching problem. - Martin Böhm 001; Bertrand Simon 001 (Theor. Comput. Sci., 2022)

Submodularity Gaps for Selected Network Design and Matching Problems. - Martin Böhm 001; Jaroslaw Byrka; Mateusz Lewandowski; Jan Marcinkowski (CoRR, 2023)

Improved Online Load Balancing with Known Makespan. - Martin Böhm 001; Matej Lieskovský; Sören Schmitt; Jirí Sgall; Rob van Stee (APPROX/RANDOM, 2024)

Approximating TSP Variants Using a Bridge Lemma. - Martin Böhm 001; Zachary Friggstad; Tobias Mömke; Joachim Spoerhase (CoRR, 2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma. - Martin Böhm 001; Zachary Friggstad; Tobias Mömke; Joachim Spoerhase (SODA, 2025)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs. - Mateusz Basiak; Marcin Bienkowski; Martin Böhm 001; Marek Chrobak; Lukasz Jez; Jirí Sgall; Agnieszka Tatarczuk (CoRR, 2025)