2 citations · 3 across the 2 of their papers we have counts for
2 papers
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…
cs.DS2019★ 1 cited
The Potential of Restarts for ProbSAT
Jan-Hendrik Lorenz, Julian Nickerl
This work analyses the potential of restarts for probSAT, a quite successful algorithm for k-SAT, by estimating its runtime distributions on random 3-SAT instances that are close t…