Faculties / Central Institutes
DE / EN
The Discrete Optimization group is concerned with the development and analysis of algorithms for the solution of optimization problems on discrete structures such as graphs and matroids.
Max Klimm gave the talk Eine kurze Einführung in die Spieltheorie at the MATHINSIDE am Pi Day 2025.
Martin Knaack gave the talk Generalized Assignment and Knapsack Problems in the Random-Order Model at the 15th Day On Computational Game Theory.
The paper Improved Bounds for Single-Nomination Impartial Selection by Javier Cembrano, Felix Fischer, and Max Klimm has been accepted at Mathematics of Operations Research.
The papers Valid Cuts for the Design of Potential-based Flow Networks by Pascal Börner, Max Klimm, Annette Lutz, Marc Pfetsch, Martin Skutella, and Lea Strubberg and Generalized Assignment and Knapsack Problems in the Random-Order Model by Max Klimm and Martin Knaack have been accepted at IPCO 2025.
