Springe direkt zu Inhalt

Overview Winter Semester 2020/2021

All planned Monday Lectures in Winter Term 2020/21 will take place online.

Invitation over Zoom here:


Lecture at 14:15Colloquium at 16:00
Monday, 19.10.2020  online

 Mikkel Abrahamsen (Kopenhagen):
A framework for ∃R-completeness of two-dimensional packing problems

 Tillmann Miltzow (Utrecht):
A practical algorithm with performance guarantees for the art-gallery problem

Monday, 26.10.2020  online

 Sophie Spirkl (Waterloo):
k-coloring graphs with forbidden induced subgraphs

Monday, 02.11.2020  online

 Markus Bläser (Saarbrücken):
Irreversibility of tensors of minimal border rank and barriers for fast matrix multiplication

Monday, 09.11.2020  online    
Monday, 16.11.2020  online

 Lisa Sauermann (IAS, Princeton):
On the extension complexity of low-dimensional polytopes

Monday, 23.11.2020  online    
Monday, 30.11.2020  online  Stefan Mengel (CNRS):
A Biased Introduction to Decomposable Negation Normal Forms
Monday, 07.12.2020  online  14:00 Hussein Houdrouge:
Subquadratic High-Dimensional Hierarchical Clustering

 15:00 Kemal Rose:
 16:00 Filippos Christodoulou:
Design and Analysis of Combinatorial Problems in Random Intersection Graphs

Monday, 14.12.2020  online  14:00 Matthias Himmelmann:
Generalized Principal Component Analysis for Algebraic Varieties
 15:00 Dante Luber:
Boundary Complexes for Moduli Spaces of Curves
 16:00 Jannik Peters:
Efficiency and Stability in Euclidean Network Design
Monday, 04.01.2021  online  14:00 Sampada Kolhatkar:
Bivariate chromatic polynomials of mixed graphs

 15:00 Alp Müyesser:
Rainbow factors and trees

Monday, 11.01.2021  online  Raman Sanyal (Frankfurt):
From counting lattice points to counting free segments and back
 Maria Dostert (KTH):
Exact semidefinite programming bounds for packing problems
Monday, 18.01.2021  online  Florian Frick (CMU):
New applications of the Borsuk--Ulam theorem
 Pavle Blagojević (Berlin):
Ten years in one lecture
Monday, 25.01.2021  online  14:15 Michaela Borzechowski:
One-Permutation-Discrete-Contraction is UEOPL-hard
Monday, 01.02.2021  online


Monday, 08.02.2021  online   14:15 Helena Bergold (Hagen):
Topological Drawings meet Classical Theorems of Convex Geometry
Monday, 15.02.2021  online    
Monday, 22.02.2021  online  Peter Bürgisser (Berlin):
Optimization, Complexity and Invariant Theory
 Joanna Lada (Oxford):
On colour-bias Hamilton cycles in dense graphs
Freie Universität Berlin
Technische Universität Berlin
Humboldt-Universität zu Berlin
Deutsche Forschungsgemeinschaft (DFG)