| 2026 | ESA | Strategyproof Mechanisms Without Money for 2-Exchange Systems. | Javier Cembrano, Max Klimm, Martin Knaack, Arturo Merino |
| 2025 | IPCO | Valid Cuts for the Design of Potential-Based Flow Networks. | Pascal Brner, Max Klimm, Annette Lutz, Marc E. Pfetsch, Martin Skutella, Lea Strubberg |
| 2025 | IPCO | Generalized Assignment and Knapsack Problems in the Random-Order Model. | Max Klimm, Martin Knaack |
| 2025 | WAOA | Incremental-Decremental Maximization. | Yann Disser, Max Klimm, Annette Lutz, Lea Strubberg |
| 2024 | AAAI | Information Design for Congestion Games with Unknown Demand. | Svenja M. Griesbach, Martin Hoefer, Max Klimm, Tim Koglin |
| 2024 | ESA | Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. | Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz |
| 2024 | ESA | Optimizing Throughput and Makespan of Queuing Systems by Information Design. | Svenja M. Griesbach, Max Klimm, Philipp Warode, Theresa Ziemke |
| 2023 | ESA | Improved Approximation Algorithms for the Expanding Search Problem. | Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior |
| 2023 | ICALP | Incremental Maximization via Continuization. | Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker |
| 2023 | IPCO | The Polyhedral Geometry of Truthful Auctions. | Michael Joswig, Max Klimm, Sylvain Spitz |
| 2022 | AAAI | Multi-Leader Congestion Games with an Adversary. | Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel |
| 2022 | SODA | Competitive Strategies for Symmetric Rendezvous on the Line. | Max Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran |
| 2021 | WAOA | Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. | Yann Disser, Max Klimm, David Weckbecker |
| 2020 | IPCO | Packing Under Convex Quadratic Constraints. | Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella |
| 2020 | SODA | Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. | Max Klimm, Philipp Warode |
| 2019 | SODA | Computing all Wardrop Equilibria parametrized by the Flow Demand. | Max Klimm, Philipp Warode |
| 2019 | SAGT | The Online Best Reply Algorithm for Resource Allocation Problems. | Max Klimm, Daniel Schmand, Andreas Tnnis |
| 2019 | WG | Travelling on Graphs with Small Highway Dimension. | Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Knemann |
| 2018 | ICALP | Demand-Independent Optimal Tolls. | Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini |
| 2017 | SPAA | Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. | Antje Bjelde, Max Klimm, Daniel Schmand |
| 2016 | SODA | Undirected Graph Exploration with ⊝(log log | Yann Disser, Jan Hackfeld, Max Klimm |
| 2016 | SAGT | Efficiency of Equilibria in Uniform Matroid Congestion Games. | Jasper de Jong, Max Klimm, Marc Uetz |
| 2015 | CIAC | Sharing Non-anonymous Costs of Multiple Resources Optimally. | Max Klimm, Daniel Schmand |
| 2015 | ICALP | Scheduling Bidirectional Traffic on a Path. | Yann Disser, Max Klimm, Elisabeth Lbbecke |
| 2014 | STACS | Packing a Knapsack of Unknown Capacity. | Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller |
| 2014 | SAGT | Multimarket Oligopolies with Restricted Market Access. | Tobias Harks, Max Klimm |
| 2013 | CIAC | Improving the | Yann Disser, Andreas Emil Feldmann, Max Klimm, Mats Mihalk |
| 2013 | SAGT | Congestion Games with Player-Specific Costs Revisited. | Martin Gairing, Max Klimm |
| 2011 | ISAAC | Optimal File Distribution in Peer-to-Peer Networks. | Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller |
| 2011 | TARK | Congestion games with variable demands. | Tobias Harks, Max Klimm |
| 2010 | ESA | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. | Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik |
| 2010 | ICALP | On the Existence of Pure Nash Equilibria in Weighted Congestion Games. | Tobias Harks, Max Klimm |
| 2009 | SAGT | Characterizing the Existence of Potential Functions in Weighted Congestion Games. | Tobias Harks, Max Klimm, Rolf H. Mhring |