( en | de | ru )

 

Disambiguation of "Böhm, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
Throughput scheduling with equal additive laxity.

, , and . Oper. Res. Lett., 50 (5): 463-469 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Martin Böhm

Martin Böhm

Martin Böhm

Martin Böhm

Martin Böhm

 

Other publications of authors with the same name

Concept of a TSN to Real-Time Wireless Gateway in the Context of 5G URLLC., , and . WINCOM, page 1-6. IEEE, (2020)Throughput scheduling with equal additive laxity., , and . Oper. Res. Lett., 50 (5): 463-469 (2022)Throughput Scheduling with Equal Additive Laxity., , and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 130-143. Springer, (2021)Control Plane Mechanisms for Multi-Domain Time-Sensitive Networking.. Braunschweig University of Technology, Germany, (2023)Discovering and certifying lower bounds for the online bin stretching problem., and . Theor. Comput. Sci., (2022)Online Algorithms for Multilevel Aggregation., , , , , , , , , and . Oper. Res., 68 (1): 214-232 (2020)Multi-Domain Time-Sensitive Networks - An East-Westbound Protocol for Dynamic TSN-Stream Configuration Across Domains., , and . ETFA, page 1363-1366. IEEE, (2019)Online Algorithms for Multi-Level Aggregation., , , , , , , , , and . ESA, volume 57 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Online Facility Location with Linear Delay., , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 45:1-45:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)An Algorithmic Approach to Establish a Lower Bound for the Size of Semiring Neural Networks., and . ESANN, (2021)