Research Institute for Discrete Mathematics
Colloquium of Research Area C3
Home page of the institute

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 goaloriented shortest path search for bulk and incremental detailed routing

4^{th} Colloquium of Research Area C3
August 24, 2021
Heiko RÃ¶glin Beyond worstcase analysis
Stephan Held: Mathematical innovations in chip design
Anne Driemel: Data structures for nearest neighbor searching undet 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 dclaw free graphs

3^{rd} Colloquium of Research Area C3
January 17, 2020
Petra Mutzel: The kdimensional WeisfeilerLeman 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 NaprocheSAD 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 (20132018), 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 prizecollecting 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: Timingconstrained 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 kmedian and kmeans 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 fanout 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