direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research Colloquium (Winter Term 2016/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.10.2016
16:15 h
---
---
Preliminary Meeting
27.10.2016
16:15 h
Till Fluschnik
English
Finding Secluded Places of Special Interest in Graphs
04.11.2016
16:15 h
Robert Bredereck
English
Teams in Online Scheduling Polls: Game-Theoretic Aspects
10.11.2016
---
---
---
16.11.2016
16:15 h
Paul Walger
German
Heuristiken für das Entfernen von verbotenen Teilgraphen
24.11.2016
16:15 h
Markus Brill
English
Representation in Approval-Based Committee Elections
01.12.2016
16:15 h
Martin Aleksandrov
English
Online Fair Division
08.12.2016
16:15 h
Matthias Bentert
English
Parametrised Algorithms for Finding Triangles in Graphs - Detection, Counting and Enumeration
15.12.2016
16:15 h
Viatcheslav Korenwein
English
Fine-Grained Algorithm Design for Matching
05.01.2017
16:15 h
Philipp Zschoche
English
Randomised enumeration of small witnesses using a decision oracle
06.01.2017
15:15 h
Dominik Peters
English
Efficient Preference Aggregation with Structured Preferences
12.01.2017
16:15 h
Hendrik Molter
English
Assessing the Computational Complexity of Multi-Layer Subgraph Detection
19.01.2017
16:15 h
Maximilian Katzmann
English
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem
26.01.2017
16:15 h
Armin Danziger
English
Block Crossings in Storyline Visualizations
02.02.2017
16:15 h
Anne-Sophie Himmel
English
Approximability of Minimum Temporally Connected Subgraphs
09.02.2017
16:15 h
Dieaa Al Aied
English
Fast Dynamic Graph Algorithms for Parameterized Problems
15.02.2017
12:15 h
Friedhelm Meyer auf der Heide
English
Algorithmic Foundations of Swarm Robotics
16.02.2017
16:15 h
Piotr Skowron
English
FPT Approximation Schemes for Maximizing Submodular Functions
17.03.2017
12:00 h
Kitty Meeks
English
The interactive sum choice number of graphs
20.03.2017
14:00 h
Dusan Knop
English
From Lenstra to n-fold IP (there and back again)
28.03.2017
14:00 h
Martin Lackner
English
The varied landscape of consistent approval-based multi-winner rules

* 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