Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Böhm 0001
Person information
- affiliation: University of Wrocław, Institute of Computer Science, Poland
- affiliation: University of Bremen, Germany
- affiliation: Charles University, Computer Science Institute, Prague, Czech Republic
Other persons with the same name
- Martin Böhm 0002 — AustriaTech, Federal Agency for technological Measures Ltd., Gesellschaft des Bundes für technologiepolitische Maßnahmen GmbH, Vienna, Austria
- Martin Böhm 0003
![[0009-0000-4034-5466]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0009-0000-4034-5466")
— Martin-Luther-Universität Halle-Wittenberg, Halle, Germany (and 1 more) - Martin Böhm 0004 — Braunschweig University of Technology, Germany (and 1 more)
- Martin Böhm 0005 — Goethe-University, Department of eCommerce, Frankfurt, Germany
- Martin Böhm 0006 — Berlin Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase:
Approximating TSP Variants Using a Bridge Lemma. CoRR abs/2405.12876 (2024)- 2023
- [i15]Martin Böhm, Jaroslaw Byrka, Mateusz Lewandowski, Jan Marcinkowski:
Submodularity Gaps for Selected Network Design and Matching Problems. CoRR abs/2305.10935 (2023) - 2022
- [j14]Martin Böhm, Nicole Megow, Jens Schlöter:
Throughput scheduling with equal additive laxity. Oper. Res. Lett. 50(5): 463-469 (2022) - [j13]Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon:
On Hop-Constrained Steiner Trees in Tree-Like Metrics. SIAM J. Discret. Math. 36(2): 1249-1273 (2022) - [j12]Martin Böhm, Bertrand Simon:
Discovering and certifying lower bounds for the online bin stretching problem. Theor. Comput. Sci. 938: 1-15 (2022) - [c12]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. APPROX/RANDOM 2022: 45:1-45:17 - 2021
- [j11]Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On packet scheduling with adversarial jamming and speedup. Ann. Oper. Res. 298(1): 7-42 (2021) - [j10]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - [c11]Martin Böhm, Nicole Megow, Jens Schlöter:
Throughput Scheduling with Equal Additive Laxity. CIAC 2021: 130-143 - [c10]Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. WAOA 2021: 224-233 - [i14]Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. CoRR abs/2107.00145 (2021) - [i13]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Jan Marcinkowski:
Online Facility Location with Linear Delay. CoRR abs/2110.15155 (2021) - 2020
- [j9]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. Algorithmica 82(6): 1640-1653 (2020) - [j8]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - [c9]Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon:
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. MFCS 2020: 18:1-18:15 - [i12]Martin Böhm, Bertrand Simon:
Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem. CoRR abs/2001.01125 (2020) - [i11]Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon:
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics. CoRR abs/2003.05699 (2020) - [i10]Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese:
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR abs/2007.08415 (2020)
2010 – 2019
- 2019
- [j7]Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online packet scheduling with bounded delay and lookahead. Theor. Comput. Sci. 776: 95-113 (2019) - 2018
- [j6]Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý:
Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica 80(1): 155-184 (2018) - [j5]Martin Böhm, Pavel Veselý:
Online Chromatic Number is PSPACE-Complete. Theory Comput. Syst. 62(6): 1366-1391 (2018) - [j4]Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý:
Logarithmic price of buffer downscaling on line metrics. Theor. Comput. Sci. 707: 89-93 (2018) - [c8]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. SODA 2018: 1253-1260 - 2017
- [j3]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34(3): 810-828 (2017) - [j2]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. J. Comb. Optim. 34(3): 829 (2017) - [j1]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Online bin stretching with three bins. J. Sched. 20(6): 601-621 (2017) - [c7]Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On Packet Scheduling with Adversarial Jamming and Speedup. WAOA 2017: 190-206 - [i9]Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On Packet Scheduling with Adversarial Jamming and Speedup. CoRR abs/1705.07018 (2017) - [i8]Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. CoRR abs/1707.05527 (2017) - 2016
- [c6]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. ESA 2016: 12:1-12:17 - [c5]Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online Packet Scheduling with Bounded Delay and Lookahead. ISAAC 2016: 21:1-21:13 - [c4]Martin Böhm, Pavel Veselý:
Online Chromatic Number is PSPACE-Complete. IWOCA 2016: 16-28 - [c3]Martin Böhm:
Lower Bounds for Online Bin Stretching with Several Bins. SOFSEM (Student Research Forum Papers / Posters) 2016: 1-12 - [i7]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
The Best Two-Phase Algorithm for Bin Stretching. CoRR abs/1601.08111 (2016) - [i6]Martin Böhm, Pavel Veselý:
Online Chromatic Number is PSPACE-Complete. CoRR abs/1604.05940 (2016) - [i5]Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online Packet Scheduling with Bounded Delay and Lookahead. CoRR abs/1606.09395 (2016) - [i4]Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý:
Logarithmic price of buffer downscaling on line metrics. CoRR abs/1610.04915 (2016) - 2015
- [i3]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. CoRR abs/1507.02378 (2015) - 2014
- [c2]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Better Algorithms for Online Bin Stretching. WAOA 2014: 23-34 - [c1]Martin Böhm, Jirí Sgall, Pavel Veselý:
Online Colored Bin Packing. WAOA 2014: 35-46 - [i2]Martin Böhm, Jirí Sgall, Pavel Veselý:
Online Colored Bin Packing. CoRR abs/1404.5548 (2014) - [i1]Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý:
Better Algorithms for Online Bin Stretching. CoRR abs/1404.5569 (2014)
Coauthor Index
aka: Jiri Sgall
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-25 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
