| The minimum tollbooth problem in atomic network congestion games with unsplittable flows J Nickerl Theory of Computing Systems 65 (7), 1094-1109, 2021 | 7 | 2021 |
| Pure Nash equilibria in a generalization of congestion games allowing resource failures J Nickerl, J Torán Theoretical Computer Science 963, 113933, 2023 | 6 | 2023 |
| The Potential of Restarts for ProbSAT JH Lorenz, J Nickerl International Conference on Computer Aided Systems Theory, 352-360, 2019 | 4 | 2019 |
| Congestion games: the minimum tollbooth problem and games with resource failures J Nickerl Universität Ulm, 2022 | 1 | 2022 |
| The Potential of Restarts for ProbSAT on Uniform Instances JH Lorenz, J Nickerl Universität Ulm, 2021 | 1 | 2021 |
| A probabilistic divide and conquer algorithm for the minimum tollbooth problem J Nickerl International Conference on Computational Data and Social Networks, 3-15, 2019 | 1 | 2019 |
| From Local Network Formation Game to Peer-to-Peer Protocol J Nickerl, D Mödinger, JH Lorenz 2021 International Symposium on Electrical, Electronics and Information …, 2021 | | 2021 |
| Institute of Theoretical Computer Science Teaching A für schwierige Probleme, A Spieltheorie, A zur Sequenzanalyse, ... | | |
Jacobo ToranProfessor for theoretical computer science, University of UlmBestätigte E-Mail-Adresse bei uni-ulm.de
