◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Kaufmann

28 papers hereh-index 375.1k citations253 works total

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

author position
  • first author1
  • middle author19
  • last author5

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

fields
  • cs.DS20
  • cs.CG6
  • cs.DM2
same name
  • M. Kaufmann — 1 paper, h 4
  • M. Kaufmann — 1 paper, h 4
  • M. Kaufmann — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20052022
most citedA New Approach for Boundary Recognition in Geometric Sensor Networks

84 citations · 92 across the 11 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.CG2016

The Planar Tree Packing Theorem

Markus Geyer, Michael Hoffmann, Michael Kaufmann +2

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing…

◍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.