◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

H. Haverkort

23 papers hereh-index 201.3k citations86 works total

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

author position
  • sole author9
  • first author6
  • middle author6
  • last author2

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

fields
  • cs.CG16
  • cs.DS4
  • cs.CC1
  • math.CO1
  • math.MG1

identity via Semantic Scholar / OpenAlex

activity
20072022
most citedI/O efficient bisimulation partitioning on very large directed acyclic graphs

33 citations · 73 across the 19 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2019

Shortest-Path-Preserving Rounding

Herman Haverkort, David Kübel, Elmar Langetepe

Various applications of graphs, in particular applications related to finding shortest paths, naturally get inputs with real weights on the edges. However, for algorithmic or visua…

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