◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Julian Nickerl

2 papers hereh-index 210 citations6 works total

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

author position
  • sole author1
  • last author1

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

fields
  • cs.DS1
  • cs.GT1

identity via Semantic Scholar / OpenAlex

most citedThe Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows

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

collaborators
Showing cs.GTShow all

1 paper · 1 filter

cs.GT2019★ 2 cited

The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows

Julian Nickerl

This work analyzes the minimum tollbooth problem in atomic network congestion games with unsplittable flows. The goal is to place tolls on edges, such that there exists a pure Nash…

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