Mathias Hauptmann

17 papers C 1Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs.
CoRR
Mathias Hauptmann, Ronja Tiling
2016 J jnl
Approximation Complexity of Max-Cut on Power Law Graphs.
CoRR
Mikael Gast, Mathias Hauptmann, Marek Karpinski
2016 J jnl
On Alternation and the Union Theorem.
CoRR
Mathias Hauptmann
2015 J jnl
Approximability of TSP on Power Law Graphs.
CoRR
Mikael Gast, Mathias Hauptmann, Marek Karpinski
2015 J jnl
Inapproximability of dominating set on power law graphs.
Theor. Comput. Sci.
Mikael Gast, Mathias Hauptmann, Marek Karpinski
2015 J jnl
On the Approximability of Independent Set Problem on Power Law Graphs.
CoRR
Mathias Hauptmann, Marek Karpinski
2014 J jnl
Approximability of the vertex cover problem in power-law graphs.
Theor. Comput. Sci.
Mikael Gast, Mathias Hauptmann
2013 J jnl
On the approximability of Dense Steiner Problems.
J. Discrete Algorithms
Mathias Hauptmann
2012 J jnl
Approximability of the Vertex Cover Problem in Power Law Graphs
CoRR
Mikael Gast, Mathias Hauptmann
2012 J jnl
Approximation complexity of Metric Dimension problem.
J. Discrete Algorithms
Mathias Hauptmann, Richard Schmied, Claus Viehmann
2012 J jnl
Efficient Parallel Computation of Nearest Neighbor Interchange Distances
CoRR
Mikael Gast, Mathias Hauptmann
2012 J jnl
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations
CoRR
Mikael Gast, Mathias Hauptmann, Marek Karpinski
2012 J jnl
Inapproximability of Dominating Set in Power Law Graphs
CoRR
Mikael Gast, Mathias Hauptmann, Marek Karpinski
2010 C conf
On Approximation Complexity of Metric Dimension Problem.
IWOCA
Mathias Hauptmann, Richard Schmied, Claus Viehmann
2007 — conf
On the Approximability of Dense Steiner Tree Problems.
ICTCS
Mathias Hauptmann
2007 — conf
The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes.
ICTCS
Mathias Hauptmann
2004 — —
Approximation Complexity of Optimization Problems : Structural Foundations and Steiner Tree Problems
Mathias Hauptmann