direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research colloquium (summer term 2012)

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 will be updated during the term:
Date
Speaker
Location
Language
Topic
12.04.
16:00
Morgan Chopin
FR 6510
english
Parameterized Complexity of the Firefighter Problem
19.04. 16:15
Robert Bredereck
FR 6510
german/english*
On Measuring Nearly Single-Peakedness
26.04. 16:15
Mathias Weller
FR 6510
german/english*
An Advanced Search Tree Algorithm For Two-Layer Planarization
03.05. 16:15
Jiehua Chen
FR 6510
german/english* 
A Characterization of Single-Crossing Preference Profiles
09.05. 11:00
Peter Rossmanith
FR 6510
german/english*
Implementing Courcelle's Theorem
10.05. 16:15
Falk Hüffner
FR 6510
german/english*
Entity Disambiguation by Partitioning Under Heterogeneity Constraints
23.05. 16:15
Wiebke Höhn
TEL 512
english
2-Union Graphs in Concurrent Setup Scheduling
07.06. 16:15
Ondřej Suchý
TEL 512
english
Parameterized Complexity of Directed Steiner Tree and  Domination Problems on Sparse Graphs
19.06. 17:00
Andreas Emil Feldmann
TEL 512
english
Obtaining Balanced Partitions of Grids using Trees
28.06. 16:15
Morgan Chopin
TEL 512
english
The Robust Set problem: Parameterized Complexity and Approximation
12.07. 16:15
André Nichterlein
TEL 512
german/english*
Parameterized Complexity of DAG Partitioning

* 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.

Zusatzinformationen / Extras