photo of me

Welcome to my humble, imaginary abode!

This is the home page of Martin Böhm, currently enrolled in doctoral studies in Computer Science at Faculty of Mathematics and Physics, Charles University, Prague. My professional interests are approximation and online algorithms, namely scheduling and bin packing.

Contact

Feel free to contact me about anything:

Study materials

Teaching

2016/2017

Previously

I'm teaching since 2010! See my previous classes.

Research

(Newest to oldest; roman numerals = related conference papers.)
  1. Nikhil Bansal, Martin Böhm, Marek Eliáš, Grigorios Koumoutsos, and Seeun William Umboh. Nested Convex Bodies are Chaseable. To appear at SODA 2018. ArXiv preprint.
  2. Martin Böhm, Łukasz Jeż, Jiří Sgall, and Pavel Veselý. On Packet Scheduling with Adversarial Jamming and Speedup. To appear in Proc. of the 15th Workshop on Approximation and Online Algorithms (WAOA 2017), 2017. ArXiv preprint.
  3. Marcin Bienkowski, Martin Böhm, Łukasz Jeż, Paweł Laskoś-Grabowski, Jan Marcinkowski, Jiří Sgall, Aleksandra Spyra, Pavel Veselý. Logarithmic price of buffer downscaling on line metrics. Theoretical Computer Science, 2017. Published article, ArXiv preprint.
  4. Martin Böhm, Marek Chrobak, Łukasz Jeż, Fei Li, Jiří Sgall, and Pavel Veselý. Online Packet Scheduling with Bounded Delay and Lookahead. Submitted, 2017. ArXiv preprint.
    1. Martin Böhm, Marek Chrobak, Łukasz Jeż, Fei Li, Jiří Sgall, and Pavel Veselý. Online Packet Scheduling with Bounded Delay and Lookahead. Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016. LipiCS link.
  5. Martin Böhm, and Pavel Veselý. Online Chromatic Number is PSPACE-Complete. Theory of Computing Systems, 2017. Published article, ArXiv preprint.
    1. Martin Böhm, and Pavel Veselý. Online Chromatic Number is PSPACE-Complete. Proceedings of IWOCA 2016, LNCS vol. 9843, pp. 16-28, Springer, 2016. Springer link, arXiv preprint. Won Best Student Paper of IWOCA 2016.
  6. Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang, and Pavel Veselý. Online Algorithms for Multi-Level Aggregation. 24th Annual European Symposium on Algorithms (ESA 2016), Leibniz International Proceedings in Informatics (LIPIcs), pp. 12:1 -- 12:17, 2016. LIPIcs link, ArXiv preprint.
  7. Martin Böhm, György Dósa, Leah Epstein, Jiří Sgall, and Pavel Veselý. Colored Bin Packing: Online Algorithms and Lower Bounds. Algorithmica, Springer, 2016. ISSN 0178-4617. Published article, preprint.
    1. Martin Böhm, Jiří Sgall, and Pavel Veselý. Online Colored Bin Packing. Proceedings of WAOA 2014, LNCS, Springer, 2015. ArXiv preprint.
  8. Martin Böhm, Jiří Sgall, Rob van Stee, and Pavel Veselý. A two-phase algorithm for bin stretching with stretching factor 1.5. Journal of Combinatorial Optimization, Springer, 2017, ISSN 1382-6905. Published article, ArXiv preprint.
  9. Martin Böhm, Jiří Sgall, Rob van Stee, and Pavel Veselý. Online bin stretching with three bins. Journal of Scheduling, Springer, 2017, ISSN 1094-6136. Published article, ArXiv preprint.
    1. Martin Böhm, Jiří Sgall, Rob van Stee, and Pavel Veselý. Better Algorithms for Online Bin Stretching. Proceedings of WAOA 2014, LNCS, Springer, 2015. ArXiv preprint.
    2. Martin Böhm. Lower Bounds for Online Bin Stretching with Several Bins. Student Research Forum Papers and Posters at SOFSEM 2016, CEUR WP Vol-1548, 2016. Conference paper. Won Best Student Poster of SOFSEM 2016.