◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sean Kafer

7 papers hereh-index 591 citations9 works total

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

author position
  • first author1
  • middle author5
  • last author1

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

fields
  • math.OC4
  • cs.DM1
  • cs.DS1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20142025
most citedOn the Simplex method for 0/1 polytopes

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

collaborators
Showing 2024Show all

1 paper · 1 filter

math.OC2024

On the Hardness of Short and Sign-Compatible Circuit Walks

Steffen Borgwardt, Weston Grewe, Sean Kafer +2

The circuits of a polyhedron are a superset of its edge directions. Circuit walks, a sequence of steps along circuits, generalize edge walks and are "short" if they have few steps…

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