◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Bentert

15 papers hereh-index 8241 citations25 works total

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

author position
  • first author14
  • middle author1

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

fields
  • cs.DS11
  • cs.GT2
  • cs.DM1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20172025
most citedInductive k-independent graphs and c-colorable subgraphs in scheduling: A review

18 citations · 23 across the 12 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

cs.DS2022

Fair Short Paths in Vertex-Colored Graphs

Matthias Bentert, Leon Kellerhals, Rolf Niedermeier

The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally v…

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