Blumenstock, M., Althaus, E., Rassau, N., et al. (2025). Sorting Colored Balls in Colored Tubes. In M. Likhachev, H. Rudová, and E. Scala (eds.), Proceedings of the International Symposium on Combinatorial Search (Vols. 18, Issue 1, pp. 11-19). The AAAI Press, Washington, DC, USA. DOI Author/Publisher URL

Blumenstock, M., and Fischer, F. (2020). A Constructive Arboricity Approximation Scheme. In A. Chatzigeorgiou, R. Dondi, H. Herodotou, et al. (eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vols. 12011, pp. 51-63). Springer, Cham. DOI Author/Publisher URL

Blumenstock, M. A. D. (2020). Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density [PhD Thesis]. DOI Author/Publisher URL

Blumenstock, M. (2016). Fast Algorithms for Pseudoarboricity. 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 113-126. DOI

Hildebrandt, A., and Krupp, M. (2014). Algorithms for the maximum weight connected k-induced subgraph problem. Combinatorial Optimization and Applications, 268-268.