Max Klimm

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 78

Top Venues

CoRR

WINE

SODA

Publications

Yann Disser, Max Klimm, Annette Lutz, David Weckbecker
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. SIAM J. Discret. Math. 38 (1) (2024)
Javier Cembrano, Felix A. Fischer, Max Klimm
Improved Bounds for Single-Nomination Impartial Selection. EC (2023)
Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
Incremental Maximization via Continuization. ICALP (2023)
Javier Cembrano, Felix A. Fischer, Max Klimm
Optimal Impartial Correspondences. CoRR (2023)
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
Improved Approximation Algorithms for the Expanding Search Problem. ESA (2023)
Max Klimm, Maximilian J. Stahlberg
Complexity of equilibria in binary public goods games on undirected graphs. EC (2023)
Svenja M. Griesbach, Max Klimm, Philipp Warode, Theresa Ziemke
Optimizing Throughput and Makespan of Queuing Systems by Information Design. CoRR (2023)
Svenja M. Griesbach, Martin Hoefer, Max Klimm, Tim Koglin
Information Design for Congestion Games with Unknown Demand. CoRR (2023)
Michael Joswig, Max Klimm, Sylvain Spitz
The Polyhedral Geometry of Truthful Auctions. IPCO (2023)
Javier Cembrano, Felix A. Fischer, Max Klimm
Impartial Rank Aggregation. CoRR (2023)
Julia Grübel, Olivier Huber, Lukas Hümbs, Max Klimm, Martin Schmidt, Alexandra Schwartz
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium. Optim. Methods Softw. 38 (1) (2023)
Javier Cembrano, Felix A. Fischer, Max Klimm
Improved Bounds for Single-Nomination Impartial Selection. CoRR (2023)
Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
Incremental Maximization via Continuization. CoRR (2023)
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
Improved Approximation Algorithms for the Expanding Search Problem. CoRR (2023)
Max Klimm, Maximilian J. Stahlberg
Complexity of equilibria in binary public goods games on undirected graphs. CoRR (2023)
Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella
On the robustness of potential-based flow networks. Math. Program. 197 (1) (2023)
Kai-Simon Goetzmann, Tobias Harks, Max Klimm
Correction to: Broadcasting a file in a communication network. J. Sched. 25 (2) (2022)
Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
Multi-Leader Congestion Games with an Adversary. AAAI (2022)
Javier Cembrano, Felix A. Fischer, David Hannon, Max Klimm
Impartial Selection with Additive Guarantees via Iterated Deletion. CoRR (2022)
Max Klimm, Martin Knaack
Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint. CoRR (2022)
Javier Cembrano, Felix A. Fischer, Max Klimm
Optimal Impartial Correspondences. WINE (2022)
Michael Joswig, Max Klimm, Sylvain Spitz
The Polyhedral Geometry of Truthful Auctions. CoRR (2022)
Per Joachims, Max Klimm, Philipp Warode
Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs. CoRR (2022)
Svenja M. Griesbach, Martin Hoefer, Max Klimm, Tim Koglin
Public Signals in Network Congestion Games. CoRR (2022)
Max Klimm, Philipp Warode
Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs. Math. Oper. Res. 47 (1) (2022)
Javier Cembrano, Felix A. Fischer, David Hannon, Max Klimm
Impartial Selection with Additive Guarantees via Iterated Deletion. EC (2022)
Max Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran
Competitive Strategies for Symmetric Rendezvous on the Line. SODA (2022)
Max Klimm, Andreas Schütz
Equilibria in Multiclass and Multidimensional Atomic Congestion Games. Math. Oper. Res. 47 (4) (2022)
Svenja M. Griesbach, Martin Hoefer, Max Klimm, Tim Koglin
Public Signals in Network Congestion Games. EC (2022)
Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella
Packing under convex quadratic constraints. Math. Program. 192 (1) (2022)
Michael Joswig, Max Klimm, Sylvain Spitz
Generalized Permutahedra and Optimal Auctions. SIAM J. Appl. Algebra Geom. 6 (1) (2022)
Max Klimm, Martin Knaack
Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint. APPROX/RANDOM (2022)
Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
Multi-Leader Congestion Games with an Adversary. CoRR (2021)
Michael Joswig, Max Klimm, Sylvain Spitz
Generalized permutahedra and optimal auctions. CoRR (2021)
Yann Disser, Max Klimm, David Weckbecker
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint. CoRR (2021)
Yann Disser, Max Klimm, David Weckbecker
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. WAOA (2021)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. Algorithmica 83 (5) (2021)
Tobias Harks, Max Klimm, Jannik Matuschke
Pure Nash Equilibria in Resource Graph Games. J. Artif. Intell. Res. 72 (2021)
Max Klimm, Philipp Warode
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. SODA (2020)
Kai-Simon Goetzmann, Tobias Harks, Max Klimm
Broadcasting a file in a communication network. J. Sched. 23 (2) (2020)
Tobias Harks, Max Klimm, Jannik Matuschke
Pure Nash Equilibria in Resource Graph Games. CoRR (2020)
Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella
Packing Under Convex Quadratic Constraints. IPCO (2020)
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. 45 (1) (2020)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. WG (2019)
Max Klimm, Daniel Schmand, Andreas Tönnis
The Online Best Reply Algorithm for Resource Allocation Problems. SAGT (2019)
Max Klimm, Philipp Warode
Computing all Wardrop Equilibria parametrized by the Flow Demand. SODA (2019)
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-Preserving Graph Contractions. SIAM J. Discret. Math. 33 (3) (2019)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. CoRR (2019)
Martin Gairing, Max Klimm
Greedy metric minimum online matchings with random arrivals. Oper. Res. Lett. 47 (2) (2019)
Yann Disser, Jan Hackfeld, Max Klimm
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. J. ACM 66 (6) (2019)
Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini
Demand-Independent Optimal Tolls. ICALP (2018)
Max Klimm, Daniel Schmand, Andreas Tönnis
Online Best Reply Algorithms for Resource Allocation Problems. CoRR (2018)
Max Klimm, Philipp Warode
Computing all Wardrop Equilibria parametrized by the Flow Demand. CoRR (2018)
Tobias Harks, Max Klimm, Britta Peis
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. SIAM J. Optim. 28 (3) (2018)
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-Preserving Graph Contractions. ITCS (2018)
Yann Disser, Jan Hackfeld, Max Klimm
Tight bounds for undirected graph exploration with pebbles and multiple agents. CoRR (2018)
Max Klimm, Philipp Warode
Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. CoRR (2018)
Tobias Harks, Max Klimm, Manuel Schneider
Bottleneck routing with elastic demands. Oper. Res. Lett. 46 (1) (2018)
Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-preserving graph contractions. CoRR (2017)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. 31 (3) (2017)
Antje Bjelde, Felix A. Fischer, Max Klimm
Impartial Selection and the Power of Up to Two Choices. ACM Trans. Economics and Comput. 5 (4) (2017)
Antje Bjelde, Max Klimm, Daniel Schmand
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. SPAA (2017)
Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini
Demand-Independent Tolls. CoRR (2017)
Martin Gairing, Tobias Harks, Max Klimm
Complexity and Approximation of the Continuous Network Design Problem. SIAM J. Optim. 27 (3) (2017)
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR (2016)
Yann Disser, Jan Hackfeld, Max Klimm
) Pebbles. SODA (2016)
Paul Dütting, Felix A. Fischer, Max Klimm
Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing. CoRR (2016)
Jasper de Jong, Max Klimm, Marc Uetz
Efficiency of Equilibria in Uniform Matroid Congestion Games. SAGT (2016)
Tobias Harks, Max Klimm, Britta Peis
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids. CoRR (2016)
Tobias Harks, Max Klimm
Congestion Games with Variable Demands. Math. Oper. Res. 41 (1) (2016)
Yann Disser, Max Klimm, Elisabeth Lübbecke
Scheduling Bidirectional Traffic on a Path. CoRR (2015)
Max Klimm, Daniel Schmand
Sharing Non-anonymous Costs of Multiple Resources Optimally. CIAC (2015)
Tobias Harks, Ingo Kleinert, Max Klimm, Rolf H. Möhring
Computing network tolls with support constraints. Networks 65 (3) (2015)
Felix A. Fischer, Max Klimm
Optimal Impartial Selection. SIAM J. Comput. 44 (5) (2015)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. 562 (2015)
Tobias Harks, Max Klimm, Manuel Schneider
Bottleneck Routing with Elastic Demands. WINE (2015)
Yann Disser, Max Klimm, Elisabeth Lübbecke
Scheduling Bidirectional Traffic on a Path. ICALP (1) (2015)
Antje Bjelde, Felix A. Fischer, Max Klimm
Impartial Selection and the Power of up to Two Choices. WINE (2015)
Tobias Harks, Max Klimm, Britta Peis
Resource Competition on Integral Polymatroids. WINE (2014)
Max Klimm, Andreas Schütz
Congestion Games with Higher Demand Dimensions. WINE (2014)
Max Klimm, Daniel Schmand
Sharing Non-Anonymous Costs of Multiple Resources Optimally. CoRR (2014)
Tobias Harks, Max Klimm
Multimarket Oligopolies with Restricted Market Access. SAGT (2014)
Felix A. Fischer, Max Klimm
Optimal impartial selection. EC (2014)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. STACS (2014)
Tobias Harks, Max Klimm, Britta Peis
Resource Competition on Integral Polymatroids. CoRR (2014)
Martin Gairing, Tobias Harks, Max Klimm
Complexity and Approximation of the Continuous Network Design Problem. APPROX-RANDOM (2014)
Christoph Hansknecht, Max Klimm, Alexander Skopalik
Approximate Pure Nash Equilibria in Weighted Congestion Games. APPROX-RANDOM (2014)
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
Computing pure Nash and strong equilibria in bottleneck congestion games. Math. Program. 141 (1-2) (2013)
Martin Gairing, Max Klimm
Congestion Games with Player-Specific Costs Revisited. SAGT (2013)
Felix A. Fischer, Max Klimm
Optimal Impartial Selection. CoRR (2013)
Max Klimm
Competition for Resources. OR (2013)
Tobias Harks, Max Klimm, Rolf H. Möhring
Strong equilibria in games with the lexicographical improvement property. Int. J. Game Theory 42 (2) (2013)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
-Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC (2013)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. CoRR (2013)
Martin Gairing, Tobias Harks, Max Klimm
Complexity and Approximation of the Continuous Network Design Problem. CoRR (2013)
Ewgenij Gawrilow, Max Klimm, Rolf H. Möhring, Björn Stenzel
Conflict-free vehicle routing. EURO J. Transp. Logist. 1 (1-2) (2012)
Tobias Harks, Max Klimm
On the Existence of Pure Nash Equilibria in Weighted Congestion Games. Math. Oper. Res. 37 (3) (2012)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games CoRR (2012)
Tobias Harks, Max Klimm
Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces. WINE (2011)
Tobias Harks, Max Klimm
Congestion games with variable demands. TARK (2011)

Max Klimm.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Max Klimm