Peer-reviewed publications
of the members of the chair of Operations Research. See also the list of preprints.
2018 ♦ 2017 ♦ 2016 ♦ 2015 ♦ 2014 ♦ 2013 ♦ 2012 ♦ 2011 ♦ 2010 ♦ 2009
Forthcoming
- Antje Bjelde, Felix Fischer, and Max Klimm:
Impartial Selection and the Power of up to Two Choices
ACM Transactions on Economics and Computation, to appear.
2018
- Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, and Frieder Smolny:
Distance-Preserving Graph Contractions
Proceedings of the 9th Conference on Innovations in Computer Science (ITCS).
2017
- Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, and Paolo Penna (2017):
Energy-efficient delivery by heterogeneous mobile agents
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS). - Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, and Leen Stougie (2017):
Tight bounds for online TSP on the line
Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 994-1005. - Antje Bjelde, Max Klimm, and Daniel Schmand (2017):
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale
Proceedings of the 29th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 227-229. - Yann Disser, Max Klimm, Nicole Megow, and Sebastian Stiller (2017):
Packing a Knapsack of Unknown Capacity
SIAM Journal on Discrete Mathematics 31(3), pp. 1477-1497. - Martin Gairing, Tobias Harks, and Max Klimm (2017):
Complexity and Approximation of the Continuous Network Design Problem
SIAM Journal on Optimization 27(3), pp. 1554-1582.
2016
- Yann Disser, Max Klimm, and Jan Hackfeld (2016):
Undirected Graph Exploration with ⊝(log log n) Pebbles
Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 25-39. - Tobias Harks and Max Klimm (2016):
Congestion Games with Variable Demands
Mathematics of Operations Research 41(1), pp. 255-277. - Jasper de Jong, Max Klimm and Marc Uetz (2016):
Efficiency of Equilibria in Uniform Matroid Congestion Games
Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT), pp. 105-106.
2015
- Antje Bjelde, Max Klimm, and Felix Fischer (2015):
Impartial Selection and the Power of up to Two Choices
Proceedings of the 11th International Conference on Web and Internet Economics (WINE), pp. 146-158, 2015 - Yann Disser, Andreas E. Feldmann, Max Klimm, and Matus Mihalak (2015):
Improving the Hk-bound on the price of stability in undirected Shapley network design games
Theoretical Computer Science 562, pp. 557-564, 2015. - Yann Disser, Max Klimm, and Elisabeth Lübbecke (2015):
Scheduling Bidirectional Traffic on a Path
Proceedings of the 42nd Internional Colloquium on Automata, Languages and Programming (ICALP), pp. 406-418, 2015. - Felix Fischer and Max Klimm (2015):
Optimal Impartial Selection
SIAM Journal on Computing 44(5), pp. 1263-1285, 2015. - Tobias Harks, Ingo Kleinert and Rolf H. Möhring (2015):
Computing Network Tolls with Support Constraints
Networks 65(3), pp. 262-285, 2015. - Tobias Harks and Max Klimm (2015):
Bottleneck Routing with Elastic Demands
Proceedings of the 11th International Conference on Web and Internet Economics (WINE), pp. 384-397. - Tobias Harks and Max Klimm (2015):
Equilibria in a class of aggregative location games
Journal of Mathematical Economics 61, pp. 211-220. - Max Klimm and Daniel Schmand (2015):
Sharing Non-anonymous Costs of Multiple Resources Optimally
Proceedings of the 9th Internional Conference on Algorithms and Complexity (CIAC), pp. 274-287.
2014
- Yann Disser, Max Klimm, Nicole Megow, and Sebastian Stiller (2014):
Packing a Knapsack of Unknown Capacity
Proceedings of the 31st Internaional Sympium on Theoretical Aspects of Computer Science (STACS), 276-287. - Felix Fischer and Max Klimm (2014):
Optimal Impartial Selection
Proceedings of the 15th ACM Conference on Economics and Computation (EC), pp. 803-820. - Martin Gairing, Tobias Harks, and Max Klimm (2014):
Complexity and Approximation of the Continuous Network Design Problem
Proceedings of the 18th Internional Workshop on Approximation Algorithms (APPROX), pp. 226-241. - Christoph Hansknecht, Max Klimm, and Alexander Skopalik (2014):
Approximate Pure Nash Equilibria in Weighted Congestion Games
Proceedings of the 18th Intern. Workshop on Approximation Algorithms (APPROX), pp. 242-257. - Tobias Harks and Max Klimm (2014):
Multimarket Oligopolies with Restricted Market Access
Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), pp. 182-193, 2014. - Tobias Harks, Max Klimm, and Britta Peis (2014):
Resource Competition on Integral Polymatroids
Proceedings of the 10th Internetional Conference on Web and Internet Economics (WINE), pp. 189-202. - Max Klimm and Andreas Schütz (2014):
Congestion Games with Higher Demand Dimensions
Proceedings of the 10th Internetional Conference on Web and Internet Economics (WINE), pp. 453-459.
2013
- Yann Disser, Andreas E. Feldmann, Max Klimm, and Matus Mihalak (2013):
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games
Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC), pp. 158-169. - Martin Gairing and Max Klimm (2013):
Congestion Games with Player-Specific Costs Revisited
Proceedings of the 6th International Symposium on Algorithmic Game Theory (SAGT), pp. 98-109. - Tobias Harks, Max Klimm, and Rolf H. Möhring (2013):
Strong equilibria in games with the lexicographical improvement property
International Journal on Game Theory 42(2), pp. 461-482, 2013. - Tobias Harks, Martin Hoefer, Max Klimm, and Alexander Skopalik (2013):
Computing pure Nash and strong equilibria in bottleneck congestion games
Mathematical Programming 141(1-2), pp. 193-215, 2013. - Max Klimm (2013):
Competition for Resources
Selected Papers of the International Conference on Operations Research, pp. 249-254.
2012
- Tobias Harks and Max Klimm (2012):
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research 37(3), pp. 419-436, 2012. - Ewgenij Gawrilow, Max Klimm, Rolf H. Möhring and Björn Stenzel (2012):
Conflict-free vehicle routing: Load balancing and deadlock prevention
EURO Journal on transportation and logistics 1(1-2), pp. 87-111, 2012.
2011
- Kai-Simon Goetzmann, Tobias Harks, Max Klimm, and Konstantin Miller (2011):
Optimal File Distribution in Peer-to-Peer Networks
Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 210-219. - Tobias Harks and Max Klimm (2011a):
Congestion games with variable demands
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), pp. 111-120. - Tobias Harks and Max Klimm (2011b):
Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces
Proceedings of the 7th International Workshop on Internet and Network Economics (WINE), pp. 194-205. - Tobias Harks, Max Klimm and Rolf H. Möhring (2011):
Characterizing the Existence of Potential Functions in Weighted Congestion Games
Theory of Computing Systems 49(1), pp. 46-70.
2010
- Tobias Harks, Martin Hoefer, Max Klimm, and Alexander Skopalik (2010):
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Proceedings of the 18th Annual European Symposium on Algorithms (ESA), pp. 29-38. - Tobias Harks and Max Klimm (2010):
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Proceedings of the 37th International Symposium on Automata, Languages and Programming (ICALP), pp. 79-89.
2009
- Tobias Harks, Max Klimm, and Rolf H. Möhring (2009a):
Characterizing the Existence of Potential Functions in Weighted Congestion Games
Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), pp. 97-108, 2009. - Tobias Harks, Max Klimm, and Rolf H. Möhring (2009b):
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
Proceedings of the 5th International Workshop on Internet and Network Economics (WINE), pp. 463-470.