A Probabilistic Divide and Conquer Algorithm for the Minimum Tollbooth Problem. - Julian Nickerl (CSoNet, 2019)

The Potential of Restarts for ProbSAT. - Jan-Hendrik Lorenz; Julian Nickerl (EUROCAST (1), 2019)

From Local Network Formation Game to Peer-to-Peer Protocol. - Julian Nickerl; David Mödinger; Jan-Hendrik Lorenz (ISEEIE, 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 (Theor. Comput. Sci., 2023)