◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Panasenko

1 paper hereh-index 00 citations3 works total

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

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • math.CO1

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

math.CO2026

Computation of Set Tolerances with Applications to the Minimum Spanning Tree Problem

Gerold Jäger, Dmitrii Panasenko

The regular set tolerance is an important term in sensitivity analysis. For combinatorial sum problems, e.g., the Traveling Salesman Problem, Shortest Path Problem and Minimum Span…

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