Direkt zum InhaltDirekt zur SucheDirekt zur Navigation
▼ Zielgruppen ▼

Humboldt-Universität zu Berlin -

Prof. Dr. Max Klimm

I am a tenure-track Assistant professor in Operations Research at the School of Business and Economics at Humboldt-Universität zu Berlin.

Before joing HU Berlin, I was leader of the junior research group "Optimization under Uncertainty" at TU Berlin. I received my Ph.D. in mathematics from TU Berlin under the supervision of Tobias Harks and Rolf H. Möhring.

Click here to see my full CV.


Research interests

  • algorithmic game theory
  • efficient algorithms
  • operations research
  • mechanism design


Recent activities



Improving and Understanding Traffic with Unknown Demands

funded by ECMath

06|2017 - 12|2018

Competitive Exploration of Large Networks

funded by DFG

06|2014 - 12|2017

Network and Mechanism Design for Metropolitan Infrastructures

funded by ECMath

06|2014 - 05|2017

LogiScale: Big Data in Logistics

funded by European Regional Development Fund (ERDF)

02|2016 - 01|2019

  Optimization under informational and strategic uncertainty

  funded by Einstein Foundation Berlin

  12|2015 - 08|2016

Some recent publications

  • Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale
    with Antje Bjelde and Daniel Schmand
    Proc. 29th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), to appear, 2017.
  • Complexity and Approximation of the Continuous Network Design Problem
    with Martin Gairing and Tobias Harks
    SIAM Journal on Optimization, to appear.
  • Packing a Knapsack of Unknown Capacity
    with Yann DisserNicole Megow and Sebastian Stiller
    SIAM Journal on Discrete Mathematics, to appear.
  • Impartial Selection and the Power of up to Two Choices
    with Antje Bjelde and Felix Fischer
    ACM Transactions on Economics and Computation, to appear.
  • Congestion Games with Variable Demands
    with Tobias Harks
    Mathematics of Operations Research 41(1), pp. 255-277, 2016.
  • Undirected Graph Exploration with ⊝(log log n) Pebbles
    with Yann Disser and Jan Hackfeld
    Proc. 27th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 25-39, 2016.
  • Optimal Impartial Selection
    with Felix Fischer
    SIAM Journal on Computing 44(5), pp. 1263-1285, 2015.

Clck here for a complete list of publications.