Max Klimm - RankMe

133 papers A* 13A 6B 16C 2Journal 80Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Improved Approximation Algorithms for the Expanding Search Problem. SIAM J. Discret. Math. Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
2026	J	`jnl`	When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems. CoRR Max Klimm, Jannik Matuschke
2025	J	`jnl`	Carbon Pricing in Traffic Networks. CoRR Svenja M. Griesbach, Tobias Harks, Max Klimm, Michael Markl, Philipp Warode
2025	J	`jnl`	Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. SIAM J. Comput. Max Klimm, Philipp Warode
2025	B	`conf`	Generalized Assignment and Knapsack Problems in the Random-Order Model. IPCO Max Klimm, Martin Knaack
2025	J	`jnl`	Generalized Assignment and Knapsack Problems in the Random-Order Model. CoRR Max Klimm, Martin Knaack
2025	J	`jnl`	Impartial Selection with Predictions. CoRR Javier Cembrano, Felix A. Fischer, Max Klimm
2025	B	`conf`	Incremental-Decremental Maximization. WAOA Yann Disser, Max Klimm, Annette Lutz, Lea Strubberg
2025	J	`jnl`	Incremental-Decremental Maximization. CoRR Yann Disser, Max Klimm, Annette Lutz, Lea Strubberg
2025	J	`jnl`	Multi-Leader Congestion Games with an Adversary. J. Artif. Intell. Res. Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2025	J	`jnl`	The polyhedral geometry of truthful auctions. Math. Program. Michael Joswig, Max Klimm, Sylvain Spitz
2025	B	`conf`	Valid Cuts for the Design of Potential-Based Flow Networks. IPCO Pascal Börner, Max Klimm, Annette Lutz, Marc E. Pfetsch, Martin Skutella, Lea Strubberg
2025	J	`jnl`	Valid Cuts for the Design of Potential-based Flow Networks. CoRR Pascal Börner, Max Klimm, Annette Lutz, Marc E. Pfetsch, Martin Skutella, Lea Strubberg
2024	A	`conf`	Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. ESA Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz
2024	J	`jnl`	Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. CoRR Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz
2024	J	`jnl`	Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. SIAM J. Discret. Math. Yann Disser, Max Klimm, Annette Lutz, David Weckbecker
2024	J	`jnl`	Impartial Selection Under Combinatorial Constraints. CoRR Javier Cembrano, Max Klimm, Arturo Merino
2024	J	`jnl`	Impartial selection with additive guarantees via iterated deletion. Games Econ. Behav. Javier Cembrano, Felix A. Fischer, David Hannon, Max Klimm
2024	A*	`conf`	Information Design for Congestion Games with Unknown Demand. AAAI Svenja M. Griesbach, Martin Hoefer, Max Klimm, Tim Koglin
2024	A	`conf`	Optimizing Throughput and Makespan of Queuing Systems by Information Design. ESA Svenja M. Griesbach, Max Klimm, Philipp Warode, Theresa Ziemke
2024	J	`jnl`	Packing a Knapsack with Items Owned by Strategic Agents. CoRR Javier Cembrano, Max Klimm, Martin Knaack
2024	—	`ed.`	Web and Internet Economics - 19th International Conference, WINE 2023, Shanghai, China, December 4-8, 2023, Proceedings WINE Jugal Garg, Max Klimm, Yuqing Kong
2023	A*	`conf`	Complexity of equilibria in binary public goods games on undirected graphs. EC Max Klimm, Maximilian J. Stahlberg
2023	J	`jnl`	Complexity of equilibria in binary public goods games on undirected graphs. CoRR Max Klimm, Maximilian J. Stahlberg
2023	J	`jnl`	Impartial Rank Aggregation. CoRR Javier Cembrano, Felix A. Fischer, Max Klimm
2023	A	`conf`	Improved Approximation Algorithms for the Expanding Search Problem. ESA Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
2023	J	`jnl`	Improved Approximation Algorithms for the Expanding Search Problem. CoRR Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
2023	A*	`conf`	Improved Bounds for Single-Nomination Impartial Selection. EC Javier Cembrano, Felix A. Fischer, Max Klimm
2023	J	`jnl`	Improved Bounds for Single-Nomination Impartial Selection. CoRR Javier Cembrano, Felix A. Fischer, Max Klimm
2023	A*	`conf`	Incremental Maximization via Continuization. ICALP Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
2023	J	`jnl`	Incremental Maximization via Continuization. CoRR Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
2023	J	`jnl`	Information Design for Congestion Games with Unknown Demand. CoRR Svenja M. Griesbach, Martin Hoefer, Max Klimm, Tim Koglin
2023	J	`jnl`	Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium. Optim. Methods Softw. Julia Grübel, Olivier Huber, Lukas Hümbs, Max Klimm, Martin Schmidt, Alexandra Schwartz
2023	J	`jnl`	On the robustness of potential-based flow networks. Math. Program. Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella
2023	J	`jnl`	Optimal Impartial Correspondences. CoRR Javier Cembrano, Felix A. Fischer, Max Klimm
2023	J	`jnl`	Optimizing Throughput and Makespan of Queuing Systems by Information Design. CoRR Svenja M. Griesbach, Max Klimm, Philipp Warode, Theresa Ziemke
2023	J	`jnl`	Reduction of Potential-Based Flow Networks. Math. Oper. Res. Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella
2023	B	`conf`	The Polyhedral Geometry of Truthful Auctions. IPCO Michael Joswig, Max Klimm, Sylvain Spitz
2022	J	`jnl`	Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs. CoRR Per Joachims, Max Klimm, Philipp Warode
2022	A*	`conf`	Competitive Strategies for Symmetric Rendezvous on the Line. SODA Max Klimm, Guillaume Sagnol, Martin Skutella, Khai Van Tran
2022	J	`jnl`	Correction to: Broadcasting a file in a communication network. J. Sched. Kai-Simon Goetzmann, Tobias Harks, Max Klimm
2022	J	`jnl`	Equilibria in Multiclass and Multidimensional Atomic Congestion Games. Math. Oper. Res. Max Klimm, Andreas Schütz
2022	J	`jnl`	Generalized Permutahedra and Optimal Auctions. SIAM J. Appl. Algebra Geom. Michael Joswig, Max Klimm, Sylvain Spitz
2022	A*	`conf`	Impartial Selection with Additive Guarantees via Iterated Deletion. EC Javier Cembrano, Felix A. Fischer, David Hannon, Max Klimm
2022	J	`jnl`	Impartial Selection with Additive Guarantees via Iterated Deletion. CoRR Javier Cembrano, Felix A. Fischer, David Hannon, Max Klimm
2022	A	`conf`	Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint. APPROX/RANDOM Max Klimm, Martin Knaack
2022	J	`jnl`	Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint. CoRR Max Klimm, Martin Knaack
2022	A*	`conf`	Multi-Leader Congestion Games with an Adversary. AAAI Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2022	—	`conf`	Optimal Impartial Correspondences. WINE Javier Cembrano, Felix A. Fischer, Max Klimm
2022	J	`jnl`	Packing under convex quadratic constraints. Math. Program. Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella
2022	J	`jnl`	Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs. Math. Oper. Res. Max Klimm, Philipp Warode
2022	A*	`conf`	Public Signals in Network Congestion Games. EC Svenja M. Griesbach, Martin Hoefer, Max Klimm, Tim Koglin
2022	J	`jnl`	Public Signals in Network Congestion Games. CoRR Svenja M. Griesbach, Martin Hoefer, Max Klimm, Tim Koglin
2022	J	`jnl`	The Polyhedral Geometry of Truthful Auctions. CoRR Michael Joswig, Max Klimm, Sylvain Spitz
2022	—	`ch.`	The Space Complexity of Undirected Graph Exploration. Algorithms for Big Data Yann Disser, Max Klimm
2021	B	`conf`	Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. WAOA Yann Disser, Max Klimm, David Weckbecker
2021	J	`jnl`	Fractionally Subadditive Maximization under an Incremental Knapsack Constraint. CoRR Yann Disser, Max Klimm, David Weckbecker
2021	J	`jnl`	Generalized permutahedra and optimal auctions. CoRR Michael Joswig, Max Klimm, Sylvain Spitz
2021	J	`jnl`	Multi-Leader Congestion Games with an Adversary. CoRR Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2021	J	`jnl`	Pure Nash Equilibria in Resource Graph Games. J. Artif. Intell. Res. Tobias Harks, Max Klimm, Jannik Matuschke
2021	J	`jnl`	Travelling on Graphs with Small Highway Dimension. Algorithmica Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2020	B	`ed.`	Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Augsburg, Germany, September 16-18, 2020, Proceedings SAGT Tobias Harks, Max Klimm
2020	J	`jnl`	Broadcasting a file in a communication network. J. Sched. Kai-Simon Goetzmann, Tobias Harks, Max Klimm
2020	A*	`conf`	Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. SODA Max Klimm, Philipp Warode
2020	J	`jnl`	Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
2020	B	`conf`	Packing Under Convex Quadratic Constraints. IPCO Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella
2020	J	`jnl`	Pure Nash Equilibria in Resource Graph Games. CoRR Tobias Harks, Max Klimm, Jannik Matuschke
2019	A*	`conf`	Computing all Wardrop Equilibria parametrized by the Flow Demand. SODA Max Klimm, Philipp Warode
2019	J	`jnl`	Distance-Preserving Graph Contractions. SIAM J. Discret. Math. Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2019	J	`jnl`	Greedy metric minimum online matchings with random arrivals. Oper. Res. Lett. Martin Gairing, Max Klimm
2019	B	`conf`	The Online Best Reply Algorithm for Resource Allocation Problems. SAGT Max Klimm, Daniel Schmand, Andreas Tönnis
2019	J	`jnl`	Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. J. ACM Yann Disser, Jan Hackfeld, Max Klimm
2019	B	`conf`	Travelling on Graphs with Small Highway Dimension. WG Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2019	J	`jnl`	Travelling on Graphs with Small Highway Dimension. CoRR Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2018	J	`jnl`	Bottleneck routing with elastic demands. Oper. Res. Lett. Tobias Harks, Max Klimm, Manuel Schneider
2018	J	`jnl`	Computing all Wardrop Equilibria parametrized by the Flow Demand. CoRR Max Klimm, Philipp Warode
2018	A*	`conf`	Demand-Independent Optimal Tolls. ICALP Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini
2018	A	`conf`	Distance-Preserving Graph Contractions. ITCS Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2018	J	`jnl`	Online Best Reply Algorithms for Resource Allocation Problems. CoRR Max Klimm, Daniel Schmand, Andreas Tönnis
2018	J	`jnl`	Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. CoRR Max Klimm, Philipp Warode
2018	J	`jnl`	Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids. SIAM J. Optim. Tobias Harks, Max Klimm, Britta Peis
2018	J	`jnl`	Tight bounds for undirected graph exploration with pebbles and multiple agents. CoRR Yann Disser, Jan Hackfeld, Max Klimm
2017	B	`conf`	Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. SPAA Antje Bjelde, Max Klimm, Daniel Schmand
2017	J	`jnl`	Complexity and Approximation of the Continuous Network Design Problem. SIAM J. Optim. Martin Gairing, Tobias Harks, Max Klimm
2017	J	`jnl`	Demand-Independent Tolls. CoRR Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini
2017	J	`jnl`	Distance-preserving graph contractions. CoRR Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2017	J	`jnl`	Impartial Selection and the Power of Up to Two Choices. ACM Trans. Economics and Comput. Antje Bjelde, Felix A. Fischer, Max Klimm
2017	J	`jnl`	Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2016	J	`jnl`	Congestion Games with Variable Demands. Math. Oper. Res. Tobias Harks, Max Klimm
2016	B	`conf`	Efficiency of Equilibria in Uniform Matroid Congestion Games. SAGT Jasper de Jong, Max Klimm, Marc Uetz
2016	J	`jnl`	Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
2016	J	`jnl`	Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing. CoRR Paul Dütting, Felix A. Fischer, Max Klimm
2016	J	`jnl`	Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids. CoRR Tobias Harks, Max Klimm, Britta Peis
2016	A*	`conf`	Undirected Graph Exploration with ⊝(log log SODA Yann Disser, Jan Hackfeld, Max Klimm
2015	—	`conf`	Bottleneck Routing with Elastic Demands. WINE Tobias Harks, Max Klimm, Manuel Schneider
2015	J	`jnl`	Computing network tolls with support constraints. Networks Tobias Harks, Ingo Kleinert, Max Klimm, Rolf H. Möhring
2015	—	`conf`	Impartial Selection and the Power of up to Two Choices. WINE Antje Bjelde, Felix A. Fischer, Max Klimm
2015	J	`jnl`	Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2015	—	`ch.`	Linear, Exponential, but Nothing Else. Gems of Combinatorial Optimization and Graph Algorithms Max Klimm
2015	J	`jnl`	Optimal Impartial Selection. SIAM J. Comput. Felix A. Fischer, Max Klimm
2015	—	`conf`	Scheduling Bidirectional Traffic on a Path. ICALP (1) Yann Disser, Max Klimm, Elisabeth Lübbecke
2015	J	`jnl`	Scheduling Bidirectional Traffic on a Path. CoRR Yann Disser, Max Klimm, Elisabeth Lübbecke
2015	C	`conf`	Sharing Non-anonymous Costs of Multiple Resources Optimally. CIAC Max Klimm, Daniel Schmand
2014	—	`conf`	Approximate Pure Nash Equilibria in Weighted Congestion Games. APPROX-RANDOM Christoph Hansknecht, Max Klimm, Alexander Skopalik
2014	—	`conf`	Complexity and Approximation of the Continuous Network Design Problem. APPROX-RANDOM Martin Gairing, Tobias Harks, Max Klimm
2014	—	`conf`	Congestion Games with Higher Demand Dimensions. WINE Max Klimm, Andreas Schütz
2014	B	`conf`	Multimarket Oligopolies with Restricted Market Access. SAGT Tobias Harks, Max Klimm
2014	A*	`conf`	Optimal impartial selection. EC Felix A. Fischer, Max Klimm
2014	A	`conf`	Packing a Knapsack of Unknown Capacity. STACS Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2014	—	`conf`	Resource Competition on Integral Polymatroids. WINE Tobias Harks, Max Klimm, Britta Peis
2014	J	`jnl`	Resource Competition on Integral Polymatroids. CoRR Tobias Harks, Max Klimm, Britta Peis
2014	J	`jnl`	Sharing Non-Anonymous Costs of Multiple Resources Optimally. CoRR Max Klimm, Daniel Schmand
2013	—	`conf`	Competition for Resources. OR Max Klimm
2013	J	`jnl`	Complexity and Approximation of the Continuous Network Design Problem. CoRR Martin Gairing, Tobias Harks, Max Klimm
2013	J	`jnl`	Computing pure Nash and strong equilibria in bottleneck congestion games. Math. Program. Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
2013	B	`conf`	Congestion Games with Player-Specific Costs Revisited. SAGT Martin Gairing, Max Klimm
2013	C	`conf`	Improving the CIAC Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2013	J	`jnl`	Optimal Impartial Selection. CoRR Felix A. Fischer, Max Klimm
2013	J	`jnl`	Packing a Knapsack of Unknown Capacity. CoRR Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2013	J	`jnl`	Strong equilibria in games with the lexicographical improvement property. Int. J. Game Theory Tobias Harks, Max Klimm, Rolf H. Möhring
2012	J	`jnl`	Conflict-free vehicle routing. EURO J. Transp. Logist. Ewgenij Gawrilow, Max Klimm, Rolf H. Möhring, Björn Stenzel
2012	J	`jnl`	Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games CoRR Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2012	J	`jnl`	On the Existence of Pure Nash Equilibria in Weighted Congestion Games. Math. Oper. Res. Tobias Harks, Max Klimm
2011	J	`jnl`	Characterizing the Existence of Potential Functions in Weighted Congestion Games. Theory Comput. Syst. Tobias Harks, Max Klimm, Rolf H. Möhring
2011	B	`conf`	Congestion games with variable demands. TARK Tobias Harks, Max Klimm
2011	—	`conf`	Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces. WINE Tobias Harks, Max Klimm
2011	B	`conf`	Optimal File Distribution in Peer-to-Peer Networks. ISAAC Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller
2010	—	`conf`	Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. ESA (2) Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik
2010	J	`jnl`	Congestion Games with Variable Demands CoRR Tobias Harks, Max Klimm
2010	—	`conf`	On the Existence of Pure Nash Equilibria in Weighted Congestion Games. ICALP (1) Tobias Harks, Max Klimm
2009	B	`conf`	Characterizing the Existence of Potential Functions in Weighted Congestion Games. SAGT Tobias Harks, Max Klimm, Rolf H. Möhring
2009	J	`jnl`	Strong Nash Equilibria in Games with the Lexicographical Improvement Property CoRR Tobias Harks, Max Klimm, Rolf H. Möhring
2009	—	`conf`	Strong Nash Equilibria in Games with the Lexicographical Improvement Property. WINE Tobias Harks, Max Klimm, Rolf H. Möhring