Page Content
to Navigation
Research colloquium (summer term 2013)
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.
| Date | Speaker | Language | Topic |
|---|---|---|---|
| 11.04. | Will not take place in favor of the Worker 2013 | ||
| 18.04. 16:15 | Andreas Fender | english/german* | Graphana - A tool for measuring graph parameters |
| 25.04. 16:15 | Anh Quyen Vuong | english | An LP relaxation for the Steiner Forest Problem |
| 02.05. 16:15 | André Nichterlein | english/german* | Parameterized Approximability of Maximizing the Spread of Influence in Networks |
| 09.05 | Holiday (Christi Himmelfahrt) | ||
| 14.05. 14:15 | Stefan König | english | Fixed Parameter Complexity and Approximability of Norm Maximization |
| 23.05. 16:15 | Robert Bredereck | english/german* | How to Put Through Your Agenda in Collective Binary Decisions |
| 30.05. 16:15 | Manuel Sorge | english/german* | Some Algorithmic Challenges in Arc Routing |
| 06.06. 16:15 | Will not take place. | ||
| 13.06. 16:15 | André Nichterlein | english/german* | Pattern-Guided k-Anonymity |
| 20.06. 16:15 | Kirk Pruhs | english | Optimal Energy Trade-off Schedules |
| 27.06. 16:15 | René van Bevern | english/german* | On the Parameterized Complexity of Graph Bisections |
| 03.07. 16:15 | André Nichterlein | english/german* | A Refined Complexity Analysis of Degree Anonymization in Graphs |
| 09.07. 14:15 | Sepp Hartung | english/german* | |
| 18.09. 17:00 | Piotr Faliszewski | english | The Complexity of Choosing a Parliament |
| 19.09. 16:15 | Mathias Weller | english | Work in progress regarding Certificate Dispersal |
| 25.09. 14:15 | Valentin Garnero | english | Explicit Linear Kernel via Dynamic Programming |
* 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.
Announcements of our talks will be sent by mail to our mailing list.