direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Research colloquium (winter term 2013/2014)

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
02.10. 16:15
Stefan Fafianie
english
Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions [1]

31.10.
16:15
Stefan Kratsch
english
On Polynomial Kernels for Integer Linear Programs:
Covering, Packing and Feasibility [2]
07.11.
16:15
Florent Foucaud
english
The Complexity of Signed Graph Homomorphisms [3]

14.11.
16:15
Laurent Bulteau
english
Graph-based Approach for Optimally Linearizing a Partial Order
into a Permutation [4]
21.11.
16:15
Nimrod Talmon
english
Selection in the Presence of Memory Faults [5]
27.11.
10:15
Stéphane Vialette
english
On Recognizing Words That Are Squares for the Shuffle Product [6]
11:15
Bart Jansen
english
On Sparsification for Computing Treewidth [7]
28.11.
16:15
Michael Abseher, Bernhard Bliem
english
Declarative Problem Solving on Tree Decompositions [8]
05.12.
16:15
Manuel Sorge
english
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem [9]
12.12.
16:15
André Nichterlein
english
The Complexity of Finding a Large Subgraph Under Anonymity Constraints [10]
19.12.
Will not take place in favor of ISAAC [11]
26.12.
2. Weihnachtsfeiertag
02.01.
Will not take place.
09.01.
16:15
Vincent Froese
english
Kernelization for Degree Sequence Completion Problems Using f-Factors [12]
16.01.
16:15
Jiehua Chen
english
Prices Matter for the Parameterized Complexity of Shift Bribery [13]
23.01.
Annabell Berger
english
Efficient (Uniform) Sampling of Combinatorial Structures [14]
30.01
Kolja Stahl
german
Algorithm Engineering für das Auffinden dichter Teilgraphen in dünnen Graphen [15]
06.02.
12:00
Fabian Spieß
german
PaHiDe - Parameter Hierarchie Derivation [16]
16:15
Piotr Faliszewski
english
Recommendations Through Multirepresentation [17]
13.02.
Will not take place.

* 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 organizer [18].


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

------ Links: ------

Zusatzinformationen / Extras