◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Kasperski

6 papers hereh-index 231.6k citations134 works total

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

author position
  • first author2
  • middle author4

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

fields
  • cs.DS4
  • cs.CC1
  • math.OC1

identity via Semantic Scholar / OpenAlex

activity
20242026
most citedComputational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse

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

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2026★ 1 cited

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse

Marcel Jackiewicz, Adam Kasperski, Paweł Zieliński

In this paper the recoverable robust shortest path problem is investigated. Discrete budgeted interval uncertainty representation is used to model uncertain second-stage arc costs.…

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