default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathias Hauptmann
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i9]Mathias Hauptmann, Ronja Tiling:
Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs. CoRR abs/2208.13809 (2022)
2010 – 2019
- 2016
- [i8]Mathias Hauptmann:
On Alternation and the Union Theorem. CoRR abs/1602.04781 (2016) - [i7]Mikael Gast, Mathias Hauptmann, Marek Karpinski:
Approximation Complexity of Max-Cut on Power Law Graphs. CoRR abs/1602.08369 (2016) - 2015
- [j4]Mikael Gast, Mathias Hauptmann, Marek Karpinski:
Inapproximability of dominating set on power law graphs. Theor. Comput. Sci. 562: 436-452 (2015) - [i6]Mathias Hauptmann, Marek Karpinski:
On the Approximability of Independent Set Problem on Power Law Graphs. CoRR abs/1503.02880 (2015) - [i5]Mikael Gast, Mathias Hauptmann, Marek Karpinski:
Approximability of TSP on Power Law Graphs. CoRR abs/1509.03976 (2015) - 2014
- [j3]Mikael Gast, Mathias Hauptmann:
Approximability of the vertex cover problem in power-law graphs. Theor. Comput. Sci. 516: 60-70 (2014) - 2013
- [j2]Mathias Hauptmann:
On the approximability of Dense Steiner Problems. J. Discrete Algorithms 21: 41-51 (2013) - 2012
- [j1]Mathias Hauptmann, Richard Schmied, Claus Viehmann:
Approximation complexity of Metric Dimension problem. J. Discrete Algorithms 14: 214-222 (2012) - [i4]Mikael Gast, Mathias Hauptmann:
Approximability of the Vertex Cover Problem in Power Law Graphs. CoRR abs/1204.0982 (2012) - [i3]Mikael Gast, Mathias Hauptmann:
Efficient Parallel Computation of Nearest Neighbor Interchange Distances. CoRR abs/1205.3402 (2012) - [i2]Mikael Gast, Mathias Hauptmann, Marek Karpinski:
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations. CoRR abs/1210.2698 (2012) - [i1]Mikael Gast, Mathias Hauptmann, Marek Karpinski:
Inapproximability of Dominating Set in Power Law Graphs. CoRR abs/1212.3517 (2012) - 2010
- [c3]Mathias Hauptmann, Richard Schmied, Claus Viehmann:
On Approximation Complexity of Metric Dimension Problem. IWOCA 2010: 136-139
2000 – 2009
- 2007
- [c2]Mathias Hauptmann:
On the Approximability of Dense Steiner Tree Problems. ICTCS 2007: 15-26 - [c1]Mathias Hauptmann:
The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes. ICTCS 2007: 151-162 - 2004
- [b1]Mathias Hauptmann:
Approximation Complexity of Optimization Problems : Structural Foundations and Steiner Tree Problems. University of Bonn, Germany, 2004
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
