TU Berlin

Research Group Algorithmics and Computational ComplexitySummer Term 2019

isti-logo

Page Content

to Navigation

Research Colloquium (Summer Term 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
04.04.2019
16:15 h
Maciej Kocot,
Anna Kolonko
English
Multigoal Voting Rules
11.04.2019
16:15 h
George B. Mertzios
English
How fast can we reach a target vertex in stochastic temporal graphs?
18.04.2019
16:15 h
Till Fluschnik
English
On (1 + ε)-approximate data reduction for the Rural Postman Problem
25.04.2019
16:15 h
Klaus Heeger
English
Structural Parameterizations of Stable Roommates with Ties
02.05.2019
16:15 h
Vincent Froese
English
Averaging Time Series Under Dynamic Time Warping: Hardness and Experiments
09.05.2019
16:15 h
Andrzej
Kaczmarczyk
English
On Serial Committee Elections: Complexity and Algorithms
10.05.2019
16:15 h
Marieke van der Wegen
English
Recognizing hyperelliptic graphs
16.05.2019
16:15 h
Matthias Bentert
English
Parameterized Complexity of Diameter
20.05.2019
12:00 h
Arnaud Casteigts
English
Finding and Exploiting Structure in Highly-Dynamic Networks
23.05.2019
16:15 h
Matthias Rost
English
Virtual Network Embeddings: From Theory To Practice


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

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe