Mathias Hauptmann

Ronja Tiling

CoRR, 2022

2016

On Alternation and the Union Theorem.

[BibT_eX]

[DOI]

CoRR, 2016

Approximation Complexity of Max-Cut on Power Law Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Inapproximability of dominating set on power law graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the Approximability of Independent Set Problem on Power Law Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Approximability of TSP on Power Law Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Approximability of the vertex cover problem in power-law graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

2013

On the approximability of Dense Steiner Problems.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

2012

Approximation complexity of Metric Dimension problem.

[BibT_eX]

[DOI]

Richard Schmied

Claus Viehmann

J. Discrete Algorithms, 2012

Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations

[BibT_eX]

[DOI]

CoRR, 2012

Efficient Parallel Computation of Nearest Neighbor Interchange Distances

[BibT_eX]

[DOI]

CoRR, 2012

2007

The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

On the Approximability of Dense Steiner Tree Problems.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

2004

Approximation Complexity of Optimization Problems : Structural Foundations and Steiner Tree Problems

[BibT_eX]

[DOI]