direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research colloquium (summer term 2011)

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.

The schedule was updated during the term:
date
speaker
location
language
topic
20.04.
14:15
Thomas Köhler
FR 6510
german
On s-Zahn Problems
27.04.
16:15
René van Bevern
FR 6510
german/
english*
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
04.05.
14:15
André Nichterlein
FR 6510
german/
english*
The Effect of Homogeneity on the Complexity of Anonymizing Data
11.05.
14:15
Claudia Ermel and Olga Runge
FR 6510
german
Graph Transformations: Foundations, Applications, and Tools
18.05.
14:15
Sharon Bruckner
FR 6510
english
New Directions in Graph Clustering
25.05.
14:15
Wiebke Höhn
FR 6510
german/
english*
On Eulerian Extension Problems and their Application to Sequencing
Problems

01.06.
14:15
Falk Hüffner
FR 6510
german/
english*
Balanced interval coloring
08.06.
14:15
Manuel Sorge
FR 6510
english
From Few Components to an Eulerian Graph by Adding Arcs
15.06.
14:15
Mathias Weller
FR 6510
english
A New View on Rural Postman Based on Eulerian Extension and Matching
22.06.
14:15
reserved
FR 6510
reserved
reserved
29.06.
14:15
Danny Hermelin
FR 6510
english
Parameterized Two-Player Nash Equilibrium
06.07.
14:15
Sven Thiel
FR 6510
deutsch
Cancellation

* Language is depending 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 .

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