direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research Colloquium (Winter Term 2018/2019)

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
27.09.2018
16:15 h
Klaus Heeger

English
Congestion-aware Steiner Trees with Small Elmore Delay
18.10.2018
16:15 h
Jiong Guo
English
Winner Determination in Committee Elections
25.10.2018
16:15 h
Dušan Knop
English
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
01.11.2018
16:15 h
Junjie Luo
English
Parameterized Dynamic Cluster Editing
08.11.2018
16:15 h
Hendrik Molter
English
Cluster Editing in Multi-Layer and Temporal Graphs
15.11.2018
16:15 h
Klaus Nehring
English
Ordinally Efficient and Reliable Social Choice: The Pluri-Borda Rule
22.11.2018
16:15 h
Anne-Marie George
English
Preference Inference Based on Lexicographic and Pareto Models
29.11.2018
16:15 h
Leon Kellerhals
English
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
05.12.2018
16:15 h
Malte Renken
English
Comparing Temporal Graphs with Time Warping
13.12.2018
16:15 h
André Nichterlein
English
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
20.12.2018
16:15 h
Till Fluschnik
English


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