direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research colloquium (winter term 2015/2016)

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
08.10.2015
16:15 h
Bernhard Bliem
English
Secure Sets in Graphs and Declarative Dynamic Programming on Tree Decompositions
15.10.2015
--
--
--
22.10.2015
16:15 h
Christian Komusiewicz
English
On Graph Motif Problems Parameterized by Dual
29.10.2015
16:15 h
Manuel Sorge
English
Approximation algorithms for mixed, windy, and capacitated arc routing problems

05.11.2015
--
--
--
12.11.2015
--
--
--
19.11.2015
16:15 h
Jiehua Chen
English
On the One-Dimensional Euclidean Domain
25.11.2015
16:00 h
Andreas Emil Feldmann
English
Fixed Parameter Approximation for the k-Center Problem in Low Highway Dimension Graphs
03.12.2015
16:15 h
Till Fluschnik
English
The Parameterized Complexity of the Minimum Shared Edges Problem
10.12.2015
16:15 h
Hendrik Molter
English
Manipulation of the H-Index by Undoing Merges
17.12.2015
16:15 h
Jérôme Lang
English
Multi-Attribute Proportional Representation
07.01.2016
16:15 h
Manuel Sorge
English
On Kernelization and Approximation for the Vector Connectivity Problem
14.01.2016
16:15 h
Robert Bredereck
English
Complexity of Shift Bribery in Committee Elections
21.01.2016
16:15 h
Marcelo Garlet Millani
English
Algorithms and Complexity for Degree Anonymization in Directed Graphs
28.01.2016
16:15 h
Vincent Froese
English
Parameterizing edge modification problems above lower bounds
04.02.2016
16:15 h
Manuela Hopp
English
On Nash Equilibria in Competitive Diffusion Games on Hypercubes and Grids
11.02.2016
16:15 h
Anne-Sophie Himmel
English
Enumerating Maximal Cliques in Temporal Graphs

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


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

Zusatzinformationen / Extras