Strong Nash Equilibria in Games with the Lexicographical Improvement Property. - Tobias Harks; Max Klimm; Rolf H. Möhring (WINE, 2009)

Optimal File Distribution in Peer-to-Peer Networks. - Kai-Simon Goetzmann; Tobias Harks; Max Klimm; Konstantin Miller (ISAAC, 2011)

Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces. - Tobias Harks; Max Klimm (WINE, 2011)

Characterizing the Existence of Potential Functions in Weighted Congestion Games. - Tobias Harks; Max Klimm; Rolf H. Möhring (Theory Comput. Syst., 2011)

Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (CoRR, 2012)

Conflict-free vehicle routing. - Ewgenij Gawrilow; Max Klimm; Rolf H. Möhring; Björn Stenzel (EURO J. Transp. Logist., 2012)

On the Existence of Pure Nash Equilibria in Weighted Congestion Games. - Tobias Harks; Max Klimm (Math. Oper. Res., 2012)

Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (CIAC, 2013)

Competition for Resources. - Max Klimm (OR, 2013)

Congestion Games with Player-Specific Costs Revisited. - Martin Gairing; Max Klimm (SAGT, 2013)

Strong equilibria in games with the lexicographical improvement property. - Tobias Harks; Max Klimm; Rolf H. Möhring (Int. J. Game Theory, 2013)

Computing pure Nash and strong equilibria in bottleneck congestion games. - Tobias Harks; Martin Hoefer 001; Max Klimm; Alexander Skopalik (Math. Program., 2013)

Approximate Pure Nash Equilibria in Weighted Congestion Games. - Christoph Hansknecht; Max Klimm; Alexander Skopalik (APPROX-RANDOM, 2014)

Multimarket Oligopolies with Restricted Market Access. - Tobias Harks; Max Klimm (SAGT, 2014)

Resource Competition on Integral Polymatroids. - Tobias Harks; Max Klimm; Britta Peis (WINE, 2014)

Congestion Games with Higher Demand Dimensions. - Max Klimm; Andreas Schütz (WINE, 2014)

Linear, Exponential, but Nothing Else. - Max Klimm (Gems of Combinatorial Optimization and Graph Algorithms, 2015)

Sharing Non-anonymous Costs of Multiple Resources Optimally. - Max Klimm; Daniel Schmand (CIAC, 2015)

Scheduling Bidirectional Traffic on a Path. - Yann Disser; Max Klimm; Elisabeth Lübbecke (ICALP (1), 2015)

Computing network tolls with support constraints. - Tobias Harks; Ingo Kleinert; Max Klimm; Rolf H. Möhring (Networks, 2015)

Optimal Impartial Selection. - Felix A. Fischer; Max Klimm (SIAM J. Comput., 2015)

Improving the Hk-bound on the price of stability in undirected Shapley network design games. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (Theor. Comput. Sci., 2015)

Efficiency of Equilibria in Uniform Matroid Congestion Games. - Jasper de Jong; Max Klimm; Marc Uetz (SAGT, 2016)

Undirected Graph Exploration with ⊝(log log n) Pebbles. - Yann Disser; Jan Hackfeld; Max Klimm (SODA, 2016)

Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing. - Paul Dütting; Felix A. Fischer; Max Klimm (CoRR, 2016)

Congestion Games with Variable Demands. - Tobias Harks; Max Klimm (Math. Oper. Res., 2016)

Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. - Antje Bjelde; Max Klimm; Daniel Schmand (SPAA, 2017)

Distance-preserving graph contractions. - Karl Däubel; Yann Disser; Max Klimm; Torsten Mütze; Frieder Smolny (CoRR, 2017)

Demand-Independent Tolls. - Riccardo Colini-Baldeschi; Max Klimm; Marco Scarsini (CoRR, 2017)

Packing a Knapsack of Unknown Capacity. - Yann Disser; Max Klimm; Nicole Megow; Sebastian Stiller (SIAM J. Discret. Math., 2017)

Complexity and Approximation of the Continuous Network Design Problem. - Martin Gairing; Tobias Harks; Max Klimm (SIAM J. Optim., 2017)

Impartial Selection and the Power of Up to Two Choices. - Antje Bjelde; Felix A. Fischer; Max Klimm (ACM Trans. Economics and Comput., 2017)

Demand-Independent Optimal Tolls. - Riccardo Colini-Baldeschi; Max Klimm; Marco Scarsini (ICALP, 2018)

Online Best Reply Algorithms for Resource Allocation Problems. - Max Klimm; Daniel Schmand; Andreas Tönnis (CoRR, 2018)

Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. - Max Klimm; Philipp Warode (CoRR, 2018)

Bottleneck routing with elastic demands. - Tobias Harks; Max Klimm; Manuel Schneider (Oper. Res. Lett., 2018)

Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. - Tobias Harks; Max Klimm; Britta Peis (SIAM J. Optim., 2018)

The Online Best Reply Algorithm for Resource Allocation Problems. - Max Klimm; Daniel Schmand; Andreas Tönnis (SAGT, 2019)

Computing all Wardrop Equilibria parametrized by the Flow Demand. - Max Klimm; Philipp Warode (SODA, 2019)

Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. - Yann Disser; Jan Hackfeld; Max Klimm (J. ACM, 2019)

Greedy metric minimum online matchings with random arrivals. - Martin Gairing; Max Klimm (Oper. Res. Lett., 2019)

Distance-Preserving Graph Contractions. - Aaron Bernstein; Karl Däubel; Yann Disser; Max Klimm; Torsten Mütze; Frieder Smolny (SIAM J. Discret. Math., 2019)

Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. - Max Klimm; Philipp Warode (SODA, 2020)

Hiring Secretaries over Time: The Benefit of Concurrent Employment. - Yann Disser; John Fearnley; Martin Gairing; Oliver Göbel 002; Max Klimm; Daniel Schmand; Alexander Skopalik; Andreas Tönnis (Math. Oper. Res., 2020)

Broadcasting a file in a communication network. - Kai-Simon Goetzmann; Tobias Harks; Max Klimm (J. Sched., 2020)

Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. - Yann Disser; Max Klimm; David Weckbecker (WAOA, 2021)

Travelling on Graphs with Small Highway Dimension. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Jochen Könemann (Algorithmica, 2021)

Pure Nash Equilibria in Resource Graph Games. - Tobias Harks; Max Klimm; Jannik Matuschke (J. Artif. Intell. Res., 2021)

The Space Complexity of Undirected Graph Exploration. - Yann Disser; Max Klimm (Algorithms for Big Data, 2022)

Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint. - Max Klimm; Martin Knaack (APPROX/RANDOM, 2022)

Public Signals in Network Congestion Games. - Svenja M. Griesbach; Martin Hoefer 001; Max Klimm; Tim Koglin (EC, 2022)

Competitive Strategies for Symmetric Rendezvous on the Line. - Max Klimm; Guillaume Sagnol; Martin Skutella; Khai Van Tran (SODA, 2022)

Optimal Impartial Correspondences. - Javier Cembrano; Felix A. Fischer; Max Klimm (WINE, 2022)

Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs. - Per Joachims; Max Klimm; Philipp Warode (CoRR, 2022)

Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs. - Max Klimm; Philipp Warode (Math. Oper. Res., 2022)

Packing under convex quadratic constraints. - Max Klimm; Marc E. Pfetsch; Rico Raber; Martin Skutella (Math. Program., 2022)

Correction to: Broadcasting a file in a communication network. - Kai-Simon Goetzmann; Tobias Harks; Max Klimm (J. Sched., 2022)

Generalized Permutahedra and Optimal Auctions. - Michael Joswig; Max Klimm; Sylvain Spitz (SIAM J. Appl. Algebra Geom., 2022)

Equilibria in Multiclass and Multidimensional Atomic Congestion Games. - Max Klimm; Andreas Schütz (Math. Oper. Res., 2022)

Improved Approximation Algorithms for the Expanding Search Problem. - Svenja M. Griesbach; Felix Hommelsheim; Max Klimm; Kevin Schewior (ESA, 2023)

Incremental Maximization via Continuization. - Yann Disser; Max Klimm; Kevin Schewior; David Weckbecker (ICALP, 2023)

Improved Bounds for Single-Nomination Impartial Selection. - Javier Cembrano; Felix A. Fischer; Max Klimm (EC, 2023)

Complexity of equilibria in binary public goods games on undirected graphs. - Max Klimm; Maximilian J. Stahlberg (EC, 2023)

Impartial Rank Aggregation. - Javier Cembrano; Felix A. Fischer; Max Klimm (CoRR, 2023)

Reduction of Potential-Based Flow Networks. - Max Klimm; Marc E. Pfetsch; Rico Raber; Martin Skutella (Math. Oper. Res., 2023)

On the robustness of potential-based flow networks. - Max Klimm; Marc E. Pfetsch; Rico Raber; Martin Skutella (Math. Program., 2023)

Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium. - Julia Grübel; Olivier Huber; Lukas Hümbs; Max Klimm; Martin Schmidt 003; Alexandra Schwartz (Optim. Methods Softw., 2023)

Information Design for Congestion Games with Unknown Demand. - Svenja M. Griesbach; Martin Hoefer 001; Max Klimm; Tim Koglin (AAAI, 2024)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. - Yann Disser; Svenja M. Griesbach; Max Klimm; Annette Lutz (ESA, 2024)

Optimizing Throughput and Makespan of Queuing Systems by Information Design. - Svenja M. Griesbach; Max Klimm; Philipp Warode; Theresa Ziemke (ESA, 2024)

Impartial Selection Under Combinatorial Constraints. - Javier Cembrano; Max Klimm; Arturo Merino (CoRR, 2024)

Packing a Knapsack with Items Owned by Strategic Agents. - Javier Cembrano; Max Klimm; Martin Knaack (CoRR, 2024)

Impartial selection with additive guarantees via iterated deletion. - Javier Cembrano; Felix A. Fischer; David Hannon; Max Klimm (Games Econ. Behav., 2024)

Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. - Yann Disser; Max Klimm; Annette Lutz; David Weckbecker (SIAM J. Discret. Math., 2024)

Valid Cuts for the Design of Potential-Based Flow Networks. - Pascal Börner; Max Klimm; Annette Lutz; Marc E. Pfetsch; Martin Skutella; Lea Strubberg (IPCO, 2025)

Generalized Assignment and Knapsack Problems in the Random-Order Model. - Max Klimm; Martin Knaack (IPCO, 2025)

Multi-Leader Congestion Games with an Adversary. - Tobias Harks; Mona Henle; Max Klimm; Jannik Matuschke; Anja Schedel (J. Artif. Intell. Res., 2025)

The polyhedral geometry of truthful auctions. - Michael Joswig; Max Klimm; Sylvain Spitz (Math. Program., 2025)

Carbon Pricing in Traffic Networks. - Svenja M. Griesbach; Tobias Harks; Max Klimm; Michael Markl 002; Philipp Warode (CoRR, 2025)

Incremental-Decremental Maximization. - Yann Disser; Max Klimm; Annette Lutz; Lea Strubberg (CoRR, 2025)