Colloquium of Research Area C3 of the HCM

• 13^th Colloquium of Research Area C3
  October 2, 2026
  Lotte Blank: Fréchet distance in the imbalanced case
  Hannaneh Akrami: The EFX story: from existence to counterexamples
• 12^th Colloquium of Research Area C3
  March 5, 2026
  Antonia Ellerbrock: An efficient algorithm for minimizing ordered norms in fractional load balancing
  André Nusser: Lower bounds in computational geometry
• 11^th Colloquium of Research Area C3
  July 18, 2025
  William Cook: TSP cut separation
  Luise Puhlmann: Improved guarantees for the (asymmetric) a priori TSP
• 10^th Colloquium of Research Area C3
  February 21, 2025
  László Végh: From incremental transitive cover to strongly polynomial maximum flow
  Sharat Ibrahimbur: Stochastic minimum norm combinatorial optimization
• 9^th Colloquium of Research Area C3
  June 21, 2024
  Lisa Sauermann: Unit distances and distinct distances in typical norms
• 8^th Colloquium of Research Area C3
  January 19, 2024
  Niklas Schlomberg: Packing cycles in planar and bounded-genus graphs
  Laura Vargas Koch: Unsplittable flows in planar graphs
• 7^th Colloquium of Research Area C3
  June 30, 2023
  Thomas Kesselheim: Combinatorial optimization problems in contract theory
  Martin Nägele: Improved approximation algorithms for Prize-Collecting TSP
• 6^th Colloquium of Research Area C3
  November 25, 2022
  Vera Traub: Approximating weighted connectivity augmentation below factor 2
  Benedikt Kolbe: Isotopic tiling theory and combinatorial enumerations of embedded graphs on surfaces
• 5^th Colloquium of Research Area C3
  April 29, 2022
  Philipp Hieronymi: A strong version of Cobham's theorem
  Stefan Rabenstein: Faster goal-oriented shortest path search for bulk and incremental detailed routing
• 4^th Colloquium of Research Area C3
  August 24, 2021
  Heiko Röglin: Beyond worst-case analysis
  Stephan Held: Mathematical innovations in chip design
  Anne Driemel: Data structures for nearest neighbor searching under the Fréchet distance
  Jannis Blauth: Improving the approximation ratio for capacitated vehicle routing
  Meike Neuwohner: An improved approximation algorithm for the maximum weight independent set problem in d-claw free graphs
• 3^rd Colloquium of Research Area C3
  January 17, 2020
  Petra Mutzel: The k-dimensional Weisfeiler-Leman algorithm and its role in data analysis
  Pietro Saccardi: Continuous global routing
• 2^nd Colloquium of Research Area C3
  May 10, 2019
  Matthias Mnich: New approximation algorithms for variants of TSP
  Peter Koepke: The Naproche-SAD proof assistant
• 1^st Colloquium of Research Area C3
  January 18, 2019
  Anne Driemel: On the complexity of clustering polygonal curves
  Vera Traub: Approximation algorithms for the Path TSP

More information is available on the websites of Research Area C3 of the Hausdorff Center for Mathematics.

Research Area C3 is based on prior work in the former Research Area KL (2013–2018), which had a similar colloquium:

• 9^th Colloquium of Research Area KL
  April 20, 2018
  Thomas Kesselheim: Prophet inequalities and posted prices for stochastic combinatorial optimization
  Ulrich Brenner: Faster adder circuits for inputs with prescribed arrival times
• 8^th Colloquium of Research Area KL
  July 21, 2017
  Jens Vygen: On the integrality gap of the prize-collecting Steiner forest LP
  Andreas Tönnis: Submodular secretary problems: cardinality, matching, and linear constraints
• 7^th Colloquium of Research Area KL
  February 3, 2017
  Stefan Kratsch: Preprocessing for vertex cover: A brief introduction to kernelization
  Dirk Müller: Timing-constrained global routing
• 6^th Colloquium of Research Area KL
  April 29, 2016
  Jochen Könemann: Technology diffusion: From precedence constrained deadline scheduling to information cascades in networks
  Melanie Schmidt: Local k-median and k-means clustering
• 5^th Colloquium of Research Area KL
  June 19, 2015
  Peter Koepke: Foundations for formal mathematics
  Stephan Held: Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two
• 4^th Colloquium of Research Area KL
  October 10, 2014
  Marek Karpinski: Approximation of fragile optimization problems
  Nicolai Hähnle: Short paths in polyhedral graphs
• 3^rd Colloquium of Research Area KL
  January 31, 2014
  Stefan Hougardy: Eliminating edges in TSP instances
  Philipp Schlicht: Computations on ordinals and automatic structures
• 2^nd Colloquium of Research Area KL
  July 12, 2013
  Heiko Röglin: Smoothed analysis of the successive shortest path algorithm
  Stephan Held: Shallow light Steiner arborescences
• 1^st Colloquium of Research Area KL
  January 25, 2013
  Jens Vygen: New approximation algorithms for the traveling salesman problem
  Jens Franke: A tale of two primality tests