direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research colloquium (winter term 2014/2015)

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"), fifth floor, room 512.

The schedule will be updated during the term:
Date
Speaker
Language
Topic
14.10.
16:15
Stéphane Vialette
english
On the S-Labeling Problem [1]
23.10.
16:15
Iyad Kanj
english
Flip Distance is in FPT time O(n+ k * c^k) [2]
30.10.
16:15
Manuel Sorge
english
The Minimum Feasible Tileset Problem [3]
06.11.
16:15
Robert Bredereck
english
Network-Based Dissolution [4]
13.11.
Will not take place due to 68. Theorietag [5].
20.11.
16:15
Erik Jan van Leeuwen
english
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs [6]
27.11.
16:15
Stefan Kratsch
english
Losing Weight is Easy [7]
04.12.
16:15
Christian Komusiewicz
english
Finding Consistent Paths Across Two Networks [8]
11.12.
16:15
Nimrod Talmon
english
Multi-Player Diffusion Games on Graph Classes [9]
18.12.
Will not take place.
25.12.
Christmas Holiday
01.01.
New Year's Day
08.01.
16:15
Jiehua Chen

english
Elections with Few Voters: Candidate Control Can Be Easy [10]
15.01.
16:15
Manuel Sorge
english
Finding Highly Connected Subgraphs [11]
22.01.
16:15
René van Bevern
english
Multicover by c-intervals [12]
29.01.
16:15
Sepp Hartung
english
Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing [13]
05.02.
16:15
André Nichterlein
english
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths [14]
12.02.
16:15
Ronald de Haan
english
Fixed-Parameter Tractability with SAT Oracles [15]

* Language depends on the audience.


If you have proposals for further talks or if you want to present interesting results feel free to send an email to the organizer [16].


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

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

Zusatzinformationen / Extras