direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research colloquium (winter term 2011/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 preliminary schedule will be updated during the term:
date
speaker
location
language
topic
27.10.
16:15
Andreas Fender
FR 6510
deutsch
Graphana - ein erweiterbares Werkzeug zur Messung struktureller Graphparameter
03.11.
16:15
Falk Hüffner
FR 6510
german/
english*
Confluent Data Reduction for Edge Clique Cover: A Bridge Between Graph Transformation and Kernelization
10.11.
16:15
Jiehua Chen
FR 6510
deutsch
Zur Algorithmischen Komplexität von Wahlproblemen
17.11.
16:15
André Nichterlein
FR 6510
german/
english*
On the Computational Complexity of Realizing Degree Sequences as Directed Acyclic Graphs
24.11.
16:15
Christian
Komusiewicz

FR 6510
german/
english*
On Parameterized Local Search for Closest String
29.11.
11:00
Stefan Kratsch
FR 6510
english
Clique cover and graph separation: New incompressibility results
01.12.
16:15
Jiehua Chen
FR 6510
german

Optimal Lobbying Revisited
08.12.
16:15
Manuel Sorge
FR 6510

german/
english*
The Parameterized Complexity of Finding mu-Cliques - Preliminary Results
16.12.
17:00
Klaus Reinhardt
FR 6510
german/
english*
Membership problems for formulas over sets of numbers and their application to Logic
05.01.
16:15
Thomas Köhler
FR 6510
german
Benutzergeführtes Anonymisieren von Daten mit Pattern Clustering: Algorithmen und Komplexität
12.01.
16:15
René van Bevern
FR 6510
german/
english*
Towards Optimal and Expressive Kernelization for d-Hitting Set
19.01.
16:15
Sharon Bruckner
FR 6510
english
Network-based Clustering under Heterogeneity Constraints
24.01.
14:00
Ondra Suchy
FR 6510

english
Feedback vertex set on graphs of low clique-width
02.02.
16:15
Tim Jungnickel
FR 6510
german
Podcasts für die Lehre: NP-Schwere und NP-Vollständigkeit
09.02.
16:15
Mathias
Weller

FR 6510
german/
english*
Scheduling and Colorful Independent Sets
16.02.
16:15
Sepp Hartung
FR 6510
german/
english*
On Structural Parameterizations of 2-Club

* Language is depending on the audience.

Entries in italics are not definitively confirmed (especially with respect to time and date) and may be rearranged.

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