Martin Böhm

Orcid: 0000-0003-4796-7422

Affiliations:
  • University of Wrocław, Institute of Computer Science, Poland
  • University of Bremen, Germany
  • Charles University, Computer Science Institute, Prague, Czech Republic


According to our database1, Martin Böhm authored at least 24 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Submodularity Gaps for Selected Network Design and Matching Problems.
CoRR, 2023

2022
Discovering and certifying lower bounds for the online bin stretching problem.
Theor. Comput. Sci., 2022

On Hop-Constrained Steiner Trees in Tree-Like Metrics.
SIAM J. Discret. Math., 2022

Throughput scheduling with equal additive laxity.
Oper. Res. Lett., 2022

Online Facility Location with Linear Delay.
Proceedings of the Approximation, 2022

2021
New results on multi-level aggregation.
Theor. Comput. Sci., 2021

On packet scheduling with adversarial jamming and speedup.
Ann. Oper. Res., 2021

Improved Analysis of Online Balanced Clustering.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

2020
Online Algorithms for Multilevel Aggregation.
Oper. Res., 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
CoRR, 2020

Nested Convex Bodies are Chaseable.
Algorithmica, 2020

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
Online packet scheduling with bounded delay and lookahead.
Theor. Comput. Sci., 2019

2018
Logarithmic price of buffer downscaling on line metrics.
Theor. Comput. Sci., 2018

Online Chromatic Number is PSPACE-Complete.
Theory Comput. Syst., 2018

Colored Bin Packing: Online Algorithms and Lower Bounds.
Algorithmica, 2018

2017
Online bin stretching with three bins.
J. Sched., 2017

Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim., 2017

A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim., 2017

2016
The Best Two-Phase Algorithm for Bin Stretching.
CoRR, 2016

Lower Bounds for Online Bin Stretching with Several Bins.
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.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014
Online Colored Bin Packing.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Better Algorithms for Online Bin Stretching.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014


  Loading...