# Publications of Dr. Pascal Lenzner

The following listing contains all publications of Dr. Pascal Lenzner. Further publications of the research group can be found on the current list of publications and the complete list of publications. Individual listings are available externally on DBLP and Google Scholar or locally as PDF.

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

- years: 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Katrin Casel, Dr. Sarel Cohen, Dr. Ágnes Cseh, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Nikhil Kumar, Dr. Pascal Lenzner
- PhD students: Vanja Doskoč, Philipp Fischbeck, Maximilian Katzmann, Simon Krogmann, Gregor Lagodzinski, Anna Melnichenko, Louise Molitor, Stefan Neubert, Marcus Pappik, Francesco Quinzan, Ralf Rothenberger, Martin Schirneck, Karen Seidel, Christopher Weyand, Ziena Zeif
- theory conferences: ICALP, MFCS, SAGT, STACS, STOC, WINE

algorithm conferences: ALENEX, ESA, GD, ISAAC, SODA, SPAA, SWAT, WAW - artificial intelligence conferences: AAAI, AAMAS, ALT, COLT, ECAI, ICAPS, IJCAI, SAT

evolutionary computation conferences: CEC, EMO, EvoCOP, FOGA, GECCO, PPSN

2021 [ nach oben ]

- Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Lowski, Stefanie; Melnichenko, Anna
**Selfish Creation of Social Networks**. Conference on Artificial Intelligence (AAAI) 2021 - Krogmann, Simon; Lenzner, Pascal; Molitor, Louise; Skopalik, Alexander
**Two-Stage Facility Location Games with Strategic Clients and Facilities**. International Joint Conference on Artificial Intelligence (IJCAI) 2021 - Friedemann, Wilhelm; Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna; Peters, Jannik; Stephan, Daniel; Vaichenker, Michael
**Efficiency and Stability in Euclidean Network Design**. Symposium on Parallelism in Algorithms and Architectures (SPAA) 2021: 232–242

2020 [ nach oben ]

- Bilò, Davide; Lenzner, Pascal
**On the Tree Conjecture for the Network Creation Game**. Theory of Computing Systems 2020: 422–443 - Bläsius, Thomas; Böther, Maximilian; Fischbeck, Philipp; Friedrich, Tobias; Gries, Alina; Hüffner, Falk; Kißig, Otto; Lenzner, Pascal; Molitor, Louise; Schiller, Leon; Wells, Armin; Witheger, Simon
**A Strategic Routing Framework and Algorithms for Computing Alternative Paths**. Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 2020: 10:1–10:14 - Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna; Molitor, Louise
**Fair Tree Connection Games with Topology-Dependent Edge Cost**. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2020: 15:1–15:15 - Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna
**Flow-Based Network Creation Games**. International Joint Conference on Artificial Intelligence (IJCAI) 2020: 139–145 - Bilò, Davide; Bilò, Vittorio; Lenzner, Pascal; Molitor, Louise
**Topological Influence and Locality in Swap Schelling Games**. International Symposium on Mathematical Foundations of Computer Science (MFCS) 2020: 15:1–15:15

2019 [ nach oben ]

- Feldotto, Matthias; Lenzner, Pascal; Molitor, Louise; Skopalik, Alexander
**From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation**. Autonomous Agents and Multiagent Systems (AAMAS) 2019: 1949–1951 - Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna
**Geometric Network Creation Games**. Symposium on Parallelism in Algorithms and Architectures (SPAA) 2019: 323–332 - Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Molitor, Louise; Pappik, Marcus; Schöne, Friedrich; Sommer, Fabian; Stangl, David
**Convergence and Hardness of Strategic Schelling Segregation**. Web and Internet Economics (WINE) 2019: 156–170

2018 [ nach oben ]

- Chauhan, Ankit; Lenzner, Pascal; Molitor, Louise
**Schelling Segregation with Strategic Agents**. Symposium on Algorithmic Game Theory (SAGT) 2018 - Bilò, Davide; Lenzner, Pascal
**On the Tree Conjecture for the Network Creation Game**. Symposium on the Theoretical Aspects of Computer Science (STACS) 2018: 14:1–14:15

2017 [ nach oben ]

- Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Molitor, Louise
**Selfish Network Creation with Non-Uniform Edge Cost**. Symposium on Algorithmic Game Theory (SAGT) 2017: 160–172 - Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, David
**Efficient Best Response Computation for Strategic Network Formation under Attack**. Symposium on Algorithmic Game Theory (SAGT) 2017: 199–211 - Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, David
**Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack**. Symposium on Parallelism in Algorithms and Architectures (SPAA) 2017: 321–323

2016 [ nach oben ]

2015 [ nach oben ]

2014 [ nach oben ]

2013 [ nach oben ]

- Albers, Susanne; Lenzner, Pascal
**On Approximate Nash Equilibria in Network Design**. Internet Mathematics 2013: 384–405 - Kawald, Bernd; Lenzner, Pascal
**On dynamics in selfish network creation**. Symposium on Parallelism in Algorithms and Architectures (SPAA) 2013: 83–92

2012 [ nach oben ]

2011 [ nach oben ]

- Lenzner, Pascal
**On Dynamics in Basic Network Creation Games**. Symposium on Algorithmic Game Theory (SAGT) 2011: 254–265 - Antoniadis, Antonios; Hüffner, Falk; Lenzner, Pascal; Moldenhauer, Carsten; Souza, Alexander
**Balanced Interval Coloring**. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 531–542

2010 [ nach oben ]