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.
The paper The Polyhedral Geometry of Truthful Auctions by Michael Joswig, Max Klimm, and Sylvain Spitz has been accepted at Mathematical Programming.
The paper A Tight $O(3/2 + \varepsilon)$-Approximation Algorithm for Demand Strip Packing by Franziska Eberle, Felix Hommelsheim, Malin Rau, and Stefan Walzer has been accepted at SODA 2025.
The paper Accelerating Matroid Optimization through Fast Imprecise Oracles by Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, and Jens Schlöter has been accepted at NeuRIPS 2024.
The papers Impartial Selection Under Combinatorial Constraints by Javier Cembrano, Max Klimm, and Arturo Merino and Packing a Knapsack with Items Owned by Strategic Agents by Javier Cembrano, Max Klimm, and Martin Knaack have been accepted at WINE 2024.