Approximation Complexity of Optimization Problems : Structural Foundations and Steiner Tree Problems - Mathias Hauptmann (2004)

On the Approximability of Dense Steiner Tree Problems. - Mathias Hauptmann (ICTCS, 2007)

The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes. - Mathias Hauptmann (ICTCS, 2007)

Efficient Parallel Computation of Nearest Neighbor Interchange Distances - Mikael Gast; Mathias Hauptmann (CoRR, 2012)

Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations - Mikael Gast; Mathias Hauptmann; Marek Karpinski (CoRR, 2012)

Approximation complexity of Metric Dimension problem. - Mathias Hauptmann; Richard Schmied; Claus Viehmann (J. Discrete Algorithms, 2012)

On the approximability of Dense Steiner Problems. - Mathias Hauptmann (J. Discrete Algorithms, 2013)

Approximability of the vertex cover problem in power-law graphs. - Mikael Gast; Mathias Hauptmann (Theor. Comput. Sci., 2014)

Approximability of TSP on Power Law Graphs. - Mikael Gast; Mathias Hauptmann; Marek Karpinski (CoRR, 2015)

On the Approximability of Independent Set Problem on Power Law Graphs. - Mathias Hauptmann; Marek Karpinski (CoRR, 2015)

Inapproximability of dominating set on power law graphs. - Mikael Gast; Mathias Hauptmann; Marek Karpinski (Theor. Comput. Sci., 2015)

Approximation Complexity of Max-Cut on Power Law Graphs. - Mikael Gast; Mathias Hauptmann; Marek Karpinski (CoRR, 2016)

On Alternation and the Union Theorem. - Mathias Hauptmann (CoRR, 2016)

Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs. - Mathias Hauptmann; Ronja Tiling (CoRR, 2022)