direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

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 [1]
11.04.2019
16:15 h
George B. Mertzios
English
How fast can we reach a target vertex in stochastic temporal graphs? [2]
18.04.2019
16:15 h
Till Fluschnik
English
On (1 + ε)-approximate data reduction for the Rural Postman Problem [3]
25.04.2019
16:15 h
Klaus Heeger
English
Structural Parameterizations of Stable Roommates with Ties [4]
02.05.2019
16:15 h
Vincent Froese
English
Averaging Time Series Under Dynamic Time Warping: Hardness and Experiments [5]
09.05.2019
16:15 h
Andrzej
Kaczmarczyk
English
On Serial Committee Elections: Complexity and Algorithms [6]
10.05.2019
16:15 h
Marieke van der Wegen
English
Recognizing hyperelliptic graphs [7]
16.05.2019
16:15 h
Matthias Bentert
English
Parameterized Complexity of Diameter [8]
20.05.2019
12:00 h
Arnaud Casteigts
English
Finding and Exploiting Structure in Highly-Dynamic Networks [9]
23.05.2019
16:15 h
Matthias Rost
English
Virtual Network Embeddings: From Theory To Practice [10]
06.06.2019
16:15 h
Dušan Knop
English
Multitype Integer Monoid Optimization and Scheduling [11]
13.06.2019
16:15 h
Arnaud Casteigts
English
Temporal Cliques Admit Sparse Spanners [12]
20.06.2019
16:15 h
Andrzej
Kaczmarczyk
English
High-Multiplicity Fair Allocation: Lenstra empowered by N-fold Integer Programming [13]
27.06.2019
16:15 h
Dušan Knop
English
Parameterized Complexity of Fair Vertex Evaluation Problems [14]
04.07.2019
16:15 h
Roman Haag
English
Feedback Sets in Temporal Graphs [15]
04.07.2019
17:00 h
Florian Sachse
English
Resource Sharing: Reducing Envy Through Social Networks [16]
11.07.2019
16:15 h
Ágnes Cseh
English
Popular Matchings in Complete Graphs [17]
20.08.2019
17:15 h
Frank Kammer
English
Temporal Graph Exploration: Two Moves per Time Step Make a Difference [18]
21.08.2019
16:00 h
Danny Hermelin
English
New lower bounds for the Bicriteria Shortest Path problem [19]
02.09.2018
14:00 h
Mervin Triphaus
English
Algorithmic Explorations Between Cliques and 2-Clubs [20]
05.09.2018
14:15 h
 Niclas Böhmer
English
Algorithmic Analysis of Hedonic Games with Diversity Preferences [21]


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 [22].

To top

------ Links: ------

Zusatzinformationen / Extras