Julian Nickerl

Orcid: 0000-0001-7885-3917

According to our database1, Julian Nickerl authored at least 5 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Pure Nash equilibria in a generalization of congestion games allowing resource failures.
Theor. Comput. Sci., 2023

2021
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows.
Theory Comput. Syst., 2021

From Local Network Formation Game to Peer-to-Peer Protocol.
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.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2019, 2019

A Probabilistic Divide and Conquer Algorithm for the Minimum Tollbooth Problem.
Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019


  Loading...