Julian Nickerl

According to our database, Julian Nickerl authored at least 5 papers between 2019 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

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

Julian Nickerl

Theory Comput. Syst., 2021

Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures.

Julian Nickerl, Jacobo Torán

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

From Local Network Formation Game to Peer-to-Peer Protocol.

Julian Nickerl, David Mödinger, Jan-Hendrik Lorenz

Proceedings of the ISEEIE 2021: International Symposium on Electrical, Electronics and Information Engineering, Seoul Republic of Korea, February 19, 2021

2019

The Potential of Restarts for ProbSAT.

Jan-Hendrik Lorenz, Julian Nickerl

Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019

A Probabilistic Divide and Conquer Algorithm for the Minimum Tollbooth Problem.

Julian Nickerl

Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019