Markus Blumenstock

According to our database, Markus Blumenstock authored at least 5 papers between 2014 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density

Markus Blumenstock

PhD thesis, 2020

A Constructive Arboricity Approximation Scheme.

Markus Blumenstock, Frank Fischer

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2018

A (4/3+ε)-Approximation Algorithm for Arboricity From Pseudoforest Partitions.

Markus Blumenstock

CoRR, 2018

2016

Fast Algorithms for Pseudoarboricity.

Markus Blumenstock

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2014

Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem.

Ernst Althaus, Markus Blumenstock, Alexej Disterhoft, Andreas Hildebrandt, Markus Krupp

Proceedings of the Combinatorial Optimization and Applications, 2014