Mathias Hauptmann
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs | 2022-08-29 | Paper |
| Inapproximability of dominating set on power law graphs Theoretical Computer Science | 2014-12-02 | Paper |
| On the approximability of dense Steiner problems Journal of Discrete Algorithms | 2014-08-13 | Paper |
| Approximability of the vertex cover problem in power-law graphs Theoretical Computer Science | 2013-12-13 | Paper |
| Approximation complexity of metric dimension problem Journal of Discrete Algorithms | 2012-09-13 | Paper |
| On approximation complexity of metric dimension problem Lecture Notes in Computer Science | 2011-05-19 | Paper |
| scientific article; zbMATH DE number 5042868 (Why is no real title available?) | 2006-07-27 | Paper |
Research outcomes over time
This page was built for person: Mathias Hauptmann
