◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

I. Olszewski

3 papers hereh-index 567 citations23 works total

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

author position
  • middle author2
  • last author1

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

fields
  • cs.NI3

identity via Semantic Scholar / OpenAlex

activity
20192023
most citedTowards an efficient and exact algorithm for dynamic dedicated path protection

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

collaborators
Showing 2023Show all

1 paper · 1 filter

cs.NI2023★ 1 cited

Is dynamic dedicated path protection tractable?

Ireneusz Szcześniak, Ireneusz Olszewski, Bożena Woźna-Szcześniak

Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networ…

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