Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem. - Ernst Althaus; Markus Blumenstock; Alexej Disterhoft; Andreas Hildebrandt 001; Markus Krupp (COCOA, 2014)

Fast Algorithms for Pseudoarboricity. - Markus Blumenstock (ALENEX, 2016)

A (4/3+ε)-Approximation Algorithm for Arboricity From Pseudoforest Partitions. - Markus Blumenstock (CoRR, 2018)

A Constructive Arboricity Approximation Scheme. - Markus Blumenstock; Frank Fischer 002 (SOFSEM, 2020)

Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density - Markus Blumenstock (2020)