◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Hauptmann

4 papers hereh-index 5171 citations18 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author3

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.CC2
  • cs.DS2

identity via Semantic Scholar / OpenAlex

activity
20122016
most citedImproved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations

6 citations · 6 across the 2 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.DS2016

Approximation Complexity of Max-Cut on Power Law Graphs

Mikael Gast, Mathias Hauptmann, Marek Karpinski

In this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent β. We prove some new approximability results on that problem. In particular we show…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.