Mathias Hauptmann

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 6

Top Topics

Preferential Attachment

Real World Graphs

Approximation Schemes

Top Venues

Theor. Comput. Sci.

J. Discrete Algorithms

Publications

Mathias Hauptmann, Ronja Tiling
Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs. CoRR (2022)
Mikael Gast, Mathias Hauptmann, Marek Karpinski
Approximation Complexity of Max-Cut on Power Law Graphs. CoRR (2016)
Mathias Hauptmann
On Alternation and the Union Theorem. CoRR (2016)
Mikael Gast, Mathias Hauptmann, Marek Karpinski
Inapproximability of dominating set on power law graphs. Theor. Comput. Sci. 562 (2015)
Mathias Hauptmann, Marek Karpinski
On the Approximability of Independent Set Problem on Power Law Graphs. CoRR (2015)
Mikael Gast, Mathias Hauptmann, Marek Karpinski
Approximability of TSP on Power Law Graphs. CoRR (2015)
Mikael Gast, Mathias Hauptmann
Approximability of the vertex cover problem in power-law graphs. Theor. Comput. Sci. 516 (2014)
Mathias Hauptmann
On the approximability of Dense Steiner Problems. J. Discrete Algorithms 21 (2013)
Mikael Gast, Mathias Hauptmann
Efficient Parallel Computation of Nearest Neighbor Interchange Distances CoRR (2012)
Mikael Gast, Mathias Hauptmann, Marek Karpinski
Inapproximability of Dominating Set in Power Law Graphs CoRR (2012)
Mathias Hauptmann, Richard Schmied, Claus Viehmann
Approximation complexity of Metric Dimension problem. J. Discrete Algorithms 14 (2012)
Mikael Gast, Mathias Hauptmann
Approximability of the Vertex Cover Problem in Power Law Graphs CoRR (2012)
Mikael Gast, Mathias Hauptmann, Marek Karpinski
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations CoRR (2012)
Mathias Hauptmann, Richard Schmied, Claus Viehmann
On Approximation Complexity of Metric Dimension Problem. IWOCA (2010)
Mathias Hauptmann
On the Approximability of Dense Steiner Tree Problems. ICTCS (2007)
Mathias Hauptmann
The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes. ICTCS (2007)