◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Bonsma

16 papers hereh-index 181.2k citations48 works total

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

author position
  • sole author5
  • first author10
  • middle author1

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

fields
  • cs.DS7
  • cs.DM6
  • cs.CC2
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20072015
most citedAn FPT Algorithm for Directed Spanning k-Leaf

16 citations · 52 across the 11 of their papers we have counts for

collaborators
Showing 2012 · cs.DSShow all

1 paper · 2 filters

cs.DS2012

Rerouting shortest paths in planar graphs

Paul Bonsma

A rerouting sequence is a sequence of shortest st-paths such that consecutive paths differ in one vertex. We study the the Shortest Path Rerouting Problem, which asks, given two sh…

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