default search action
Pascal Lenzner
Person information
- affiliation: Hasso Plattner Institute, Potsdam, Germany
- affiliation: Humboldt University of Berlin, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j6]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau
, Daniel Schmand:
Asynchronous opinion dynamics in social networks. Distributed Comput. 37(3): 207-224 (2024) - [j5]Davide Bilò
Geometric Network Creation Games. SIAM J. Discret. Math. 38(1): 277-315 (2024) - [c41]Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells:
How to Reduce Temporal Cliques to Find Sparse Spanners. ESA 2024: 11:1-11:15 - [c40]Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio:
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. ICALP 2024: 48:1-48:18 - [c39]Simon Krogmann, Pascal Lenzner, Alexander Skopalik, Marc Uetz, Marnix C. Vos:
Equilibria in Two-Stage Facility Location with Atomic Clients. IJCAI 2024: 2842-2850 - [i36]Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells:
Towards Linear Spanners in All Temporal Cliques. CoRR abs/2402.13624 (2024) - [i35]Simon Krogmann, Pascal Lenzner, Alexander Skopalik, Marc Uetz, Marnix C. Vos:
Equilibria in Two-Stage Facility Location with Atomic Clients. CoRR abs/2403.03114 (2024) - [i34]Julian Berger, Tobias Friedrich, Pascal Lenzner, Paraskevi Machaira, Janosch Ruff:
Strategic Network Creation for Enabling Greedy Routing. CoRR abs/2403.15307 (2024) - 2023
- [j4]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
Social Distancing Network Creation. Algorithmica 85(7): 2087-2130 (2023) - [c38]Simon Krogmann
Strategic Facility Location with Clients That Minimize Total Waiting Time. AAAI 2023: 5714-5721 - [c37]Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schöllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Issac, Simon Krogmann
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. ALENEX 2023: 110-122 - [c36]Nils Bertschinger, Martin Hoefer, Simon Krogmann, Pascal Lenzner, Steffen Schuldenzucker, Lisa Wilhelmi:
Equilibria and Convergence in Fire Sale Games. AAMAS 2023: 215-223 - [c35]Ágnes Cseh, Pascal Führlich, Pascal Lenzner:
The Swiss Gambit. AAMAS 2023: 2505-2507 - [c34]Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert:
Single-Peaked Jump Schelling Games. AAMAS 2023: 2899-2901 - [c33]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types (short paper). ICTCS 2023: 328-333 - [c32]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
Temporal Network Creation Games. IJCAI 2023: 2511-2519 - [c31]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt
Schelling Games with Continuous Types. IJCAI 2023: 2520-2527 - [c30]Jonathan Gadea Harder, Simon Krogmann
Strategic Resource Selection with Homophilic Agents. IJCAI 2023: 2701-2709 - [c29]Tobias Friedrich
The Impact of Cooperation in Bilateral Network Creation. PODC 2023: 321-331 - [c28]Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert:
Single-Peaked Jump Schelling Games. SAGT 2023: 111-126 - [d2]Nils Bertschinger
Code for "Equilibria and Convergence in Fire Sale Games" (AAMAS 2023). Version 1. Zenodo, 2023 [all versions] - [d1]Nils Bertschinger
Code for "Equilibria and Convergence in Fire Sale Games" (AAMAS 2023). Version 2. Zenodo, 2023 [all versions] - [i33]Ágnes Cseh, Pascal Führlich
The Swiss Gambit. CoRR abs/2302.10595 (2023) - [i32]Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert:
Single-Peaked Jump Schelling Games. CoRR abs/2302.12107 (2023) - [i31]Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner, Alexander Skopalik:
Strategic Resource Selection with Homophilic Agents. CoRR abs/2305.00843 (2023) - [i30]Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types. CoRR abs/2305.06819 (2023) - [i29]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games. CoRR abs/2305.07494 (2023) - [i28]Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. CoRR abs/2311.02067 (2023) - 2022
- [j3]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor
Topological influence and locality in swap schelling games. Auton. Agents Multi Agent Syst. 36(2): 47 (2022) - [c27]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand:
Asynchronous Opinion Dynamics in Social Networks. AAMAS 2022: 109-117 - [c26]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
Social Distancing Network Creation. ICALP 2022: 62:1-62:21 - [c25]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. IJCAI 2022: 81-87 - [c24]Martin Bullinger, Pascal Lenzner, Anna Melnichenko:
Network Creation with Homophilic Agents. IJCAI 2022: 151-157 - [c23]Pascal Führlich, Ágnes Cseh, Pascal Lenzner:
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. EC 2022: 1101-1102 - [i27]Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand:
Asynchronous Opinion Dynamics in Social Networks. CoRR abs/2201.12923 (2022) - [i26]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
Social Distancing Network Creation. CoRR abs/2204.10423 (2022) - [i25]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games. CoRR abs/2204.12599 (2022) - [i24]Martin Bullinger, Pascal Lenzner, Anna Melnichenko:
Network Creation with Homophilic Agents. CoRR abs/2204.13757 (2022) - [i23]Nils Bertschinger, Martin Hoefer, Simon Krogmann, Pascal Lenzner, Steffen Schuldenzucker, Lisa Wilhelmi:
Equilibria and Convergence in Fire Sale Games. CoRR abs/2206.14429 (2022) - [i22]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn:
The Impact of Cooperation in Bilateral Network Creation. CoRR abs/2207.03798 (2022) - [i21]Simon Krogmann, Pascal Lenzner, Alexander Skopalik:
Strategic Facility Location with Clients that Minimize Total Waiting Time. CoRR abs/2211.14016 (2022) - 2021
- [c22]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko:
Selfish Creation of Social Networks. AAAI 2021: 5185-5193 - [c21]Simon Krogmann
Two-Stage Facility Location Games with Strategic Clients and Facilities. IJCAI 2021: 292-298 - [c20]Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker:
Efficiency and Stability in Euclidean Network Design. SPAA 2021: 232-242 - [i20]Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker:
Efficiency and Stability in Euclidean Network Design. CoRR abs/2104.11618 (2021) - [i19]Simon Krogmann, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
Two-Stage Facility Location Games with Strategic Clients and Facilities. CoRR abs/2105.01425 (2021) - [i18]Pascal Führlich, Ágnes Cseh, Pascal Lenzner:
Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments. CoRR abs/2112.10522 (2021) - 2020
- [j2]Davide Bilò, Pascal Lenzner
On the Tree Conjecture for the Network Creation Game. Theory Comput. Syst. 64(3): 422-443 (2020) - [c19]Thomas Bläsius, Maximilian Böther
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. ATMOS 2020: 10:1-10:14 - [c18]Davide Bilò
Fair Tree Connection Games with Topology-Dependent Edge Cost. FSTTCS 2020: 15:1-15:15 - [c17]Hagen Echzell
Flow-Based Network Creation Games. IJCAI 2020: 139-145 - [c16]Davide Bilò
Topological Influence and Locality in Swap Schelling Games. MFCS 2020: 15:1-15:15 - [i17]Davide Bilò, Vittorio Bilò, Pascal Lenzner, Louise Molitor:
Topological Influence and Locality in Swap Schelling Games. CoRR abs/2005.02752 (2020) - [i16]Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Flow-Based Network Creation Games. CoRR abs/2006.14964 (2020) - [i15]Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger:
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. CoRR abs/2008.10316 (2020) - [i14]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor:
Fair Tree Connection Games with Topology-Dependent Edge Cost. CoRR abs/2009.10988 (2020) - [i13]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko:
Selfish Creation of Social Networks. CoRR abs/2012.06203 (2020)
2010 – 2019
- 2019
- [c15]Matthias Feldotto, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. AAMAS 2019: 1949-1951 - [c14]Davide Bilò
Geometric Network Creation Games. SPAA 2019: 323-332 - [c13]Hagen Echzell
Convergence and Hardness of Strategic Schelling Segregation. WINE 2019: 156-170 - [i12]Matthias Feldotto, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. CoRR abs/1903.04265 (2019) - [i11]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. CoRR abs/1904.07001 (2019) - [i10]Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, David Stangl:
Convergence and Hardness of Strategic Schelling Segregation. CoRR abs/1907.07513 (2019) - 2018
- [c12]Ankit Chauhan, Pascal Lenzner, Louise Molitor:
Schelling Segregation with Strategic Agents. SAGT 2018: 137-149 - [c11]Davide Bilò
On the Tree Conjecture for the Network Creation Game. STACS 2018: 14:1-14:15 - [i9]Ankit Chauhan, Pascal Lenzner, Louise Molitor:
Schelling Segregation with Strategic Agents. CoRR abs/1806.08713 (2018) - 2017
- [c10]Ankit Chauhan, Pascal Lenzner, Anna Melnichenko, Louise Molitor:
Selfish Network Creation with Non-uniform Edge Cost. SAGT 2017: 160-172 - [c9]Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert
Efficient Best Response Computation for Strategic Network Formation Under Attack. SAGT 2017: 199-211 - [c8]Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert
Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. SPAA 2017: 321-323 - [i8]Ankit Chauhan, Pascal Lenzner, Anna Melnichenko, Louise Molitor:
Selfish Network Creation with Non-Uniform Edge Cost. CoRR abs/1706.10200 (2017) - [i7]Davide Bilò, Pascal Lenzner:
On the Tree Conjecture for the Network Creation Game. CoRR abs/1710.01782 (2017) - 2016
- [c7]Ankit Chauhan, Pascal Lenzner, Anna Melnichenko, Martin Münn:
On Selfish Creation of Robust Networks. SAGT 2016: 141-152 - [i6]Ankit Chauhan, Pascal Lenzner, Anna Melnichenko, Martin Münn:
On Selfish Creation of Robust Networks. CoRR abs/1607.02071 (2016) - [i5]Sven Ihde, Christoph Keßler, Stefan Neubert, David Schumann, Pascal Lenzner, Tobias Friedrich:
Efficient Best-Response Computation for Strategic Network Formation under Attack. CoRR abs/1610.01861 (2016) - 2015
- [c6]Andreas Cord-Landwehr, Pascal Lenzner:
Network Creation Games: Think Global - Act Local. MFCS (2) 2015: 248-260 - [i4]Andreas Cord-Landwehr, Pascal Lenzner:
Network Creation Games: Think Global - Act Local. CoRR abs/1506.02616 (2015) - 2014
- [b1]Pascal Lenzner:
On selfish network creation. Humboldt University of Berlin, 2014 - 2013
- [j1]Susanne Albers, Pascal Lenzner:
On Approximate Nash Equilibria in Network Design. Internet Math. 9(4): 384-405 (2013) - [c5]Bernd Kawald, Pascal Lenzner:
On dynamics in selfish network creation. SPAA 2013: 83-92 - 2012
- [c4]Pascal Lenzner:
Greedy Selfish Network Creation. WINE 2012: 142-155 - [i3]Pascal Lenzner:
Greedy Selfish Network Creation. CoRR abs/1210.7970 (2012) - [i2]Bernd Kawald, Pascal Lenzner:
On Dynamics in Selfish Network Creation. CoRR abs/1212.4797 (2012) - 2011
- [c3]Pascal Lenzner:
On Dynamics in Basic Network Creation Games. SAGT 2011: 254-265 - [c2]Antonios Antoniadis, Falk Hüffner
Balanced Interval Coloring. STACS 2011: 531-542 - 2010
- [c1]Susanne Albers, Pascal Lenzner:
On Approximate Nash Equilibria in Network Design. WINE 2010: 14-25 - [i1]Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza:
Balanced Interval Coloring. CoRR abs/1012.3932 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 20:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: