Curriculum Vitae (pdf)
- Approximation algorithms
- Maximum flow algorithms
- Steiner trees
- Integer Linear Programming
- Similarity Estimation
M. Blumenstock and F. Fischer. A Constructive Arboricity Approximation Scheme. In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020). Lecture Notes in Computer Science, Vol. 12011, pp. 51–63. Springer, 2020. DOI: https://doi.org/10.1007/978-3-030-38919-2_5
M. Blumenstock. Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density. PhD thesis, Johannes Gutenberg University Mainz, 2020. Slightly corrected version (errata).
M. Blumenstock. Fast Algorithms for Pseudoarboricity. In Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX 2016) in Arlington, Virginia, USA, January 2016, pp. 113–126. Society for Industrial and Applied Mathematics, 2016. https://doi.org/10.1137/1.9781611974317.10
E. Althaus, M. Blumenstock, A. Disterhoft, A. Hildebrandt, and M. Krupp. Algorithms for the Maximum
Weight Connected k-Induced Subgraph Problem. In 8th International Conference on Combinatorial
Optimization and Applications (COCOA 2014), Wailea, Hawaii, USA, December 2014. Lecture Notes in Computer Science, Vol. 8881, pp. 268–282. Springer, 2014.