direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research Colloquium (Summer Term 2017)

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
20.04.2017
16:15 h
Frank Dymek
German
Verbesserung einer Greedy-Heuristik für Dominating Set: Dynamische Probleme und Turbo-Charging
04.05.2017
16:15 h
Leon Kellerhals
English
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
11.05.2017
16:15 h
Abdallah Saffidine
English
The Parameterized Complexity of Positional Games
18.05.2017
16:15 h
Piotr Skowron
English
Approximating Optimal Social Choice under Metric Preferences
01.06.2017
16:15 h
Norbert Zeh
English
Computing Maximum Agreement Forests without Cluster Partitioning is Folly
08.06.2017
16:15 h
Meike Hatze
English
The Minimum Shared Edges Problem on Grid-like Graphs
15.06.2017
16:15 h
Andrzej
Kaczmarczyk
English
On Coalitional Manipulation for Multiwinner Elections: Shortlisting
22.06.2017
16:15 h
René van Bevern
English
A fixed-parameter algorithm for a routing open shop problem: unit processing times, few machines and locations


If you have proposals for further talks or if you want to present interesting results feel free to send an email to the organizer: Andrzej Kaczmarczyk (a.kaczmarczyk@tu-berlin.de).


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

To top

Zusatzinformationen / Extras