direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research Colloquium (Winter Term 2019/2020)

The research colloquium "Algorithmik und Komplexitätstheorie" provides talks of external guests, members of the research staff, Ph.D. students, and advanced students (theses) about recent results and research topics in theoretical computer science and related areas. The core areas are algorithmics and computational complexity theory.

Location: The colloquium is held at Ernst-Reuter Platz 7 ("TU Hochhaus"), 5th floor, room 512.

The schedule will be updated during the term:
Date
Speaker
Language
Topic
24.10.2019
16:15 h
Mathias Weller
English
Treewidth and Scanwidth in Phylogenetics 

31.10.2019
16:15 h
Hendrik Molter
English
Computing Maximum Matchings in Temporal Graphs
07.11.2019
16:15 h
Lei Bi
English
Hybrid Guess and the Nearest Plane Algorithm in Projection Lattice Attack Against Binary LWE
14.11.2019
16:15 h
Klaus Heeger
English
Stable Marriage with Ties and Restricted Edges
21.11.2019
16:15 h
André Nichterlein
English
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments


If you have proposals for further talks or if you want to present interesting results feel free to send an email to the organizer: Anne-Sophie Himmel (anne-sophie.himmel 'at' tu-berlin.de).


Announcements of our talks will be sent by mail to our mailing list.

To top

Zusatzinformationen / Extras