Mittagsseminar (by J. Lengler, K. Bringmann, B. Gärtner, M. Hoffmann, R. Kyng, D.Steurer, V. Traub)

Talks in 2026

February 26, in OAT S15, Patrick Schnider: Separoids and generalizations of outerplanarity [details]

March 03, in OAT S15, Matthias Mnich (Technische Universität Hamburg): Improved algorithms for the ARRIVAL problem [details]
March 05, in CAB G52, Niko Hastrich: Structural Parameterization of Steiner Tree Packing [details]
March 10, in OAT S15, Sebastian Haslebacher: A Levelset Algorithm for 3D-Tarski [details]
March 17, in OAT S15, Anita Dürr: Tight ETH Lower Bound for k-Bin Packing [details]
March 19, in OAT S15, Mirza Redzic (Karlsruhe Institute of Technology): Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection [details]
March 24, in OAT S15, Paul Paschmanns: The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing [details]

April 14, in OAT S15, Yanna Kraakman (University of Twente): Sampling random hypergraphs with fixed degrees [details]
Wednesday, April 15, in OAT S15, Karol Węgrzycki (MPI): Fine-grained Complexity of Integer Programming with Few Constraints [details]
April 21, in OAT S15, Johannes Lengler: Expander Subgraphs in Geometric Inhomogenous Random Graphs [details]
April 28, in OAT S15, Philip Klein (Brown University): Approximating TSP in weighted planar graphs: What is the runtime's dependence on epsilon? [details]
April 30, in OAT S15, Alexander Souza (Algomia, UZH): A Flow-Based Solver for Large-Scale Combinatorial Optimization [details]

May 05, in OAT S15, Yanheng Wang: Dynamic and Streaming Algorithms for Union Volume Estimation [details]
May 12, in OAT S15, Manuel Wiedmer: Hesse's Redemption: Efficient Convex Polynomial Programming [details]

Automatic MiSe System Software Version 1.4803M | admin login