Page Content
to Navigation
Research Colloquium (Summer Term 2020)
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. If you would like to receive information about upcoming talks, please join our mailing list. If you would like to give a talk yourself, feel free to send an email to m.renken@tu-berlin.de. Due to the Coronavirus situation, this semester’s talks are given online.
| Date | Speaker | Topic |
|---|---|---|
| 23.04.2020 | Niclas Boehmer (TU Berlin) | Fine-Grained View on Bribery for Group Identification |
| 30.04.2020 | Leon Kellerhals (TU Berlin) | Parameterized Complexity of Geodetic Set |
| 07.05.2020 | Thorsten Koch (Zuse Institute Berlin) | Solving Mixed Integer Programs |
| 14.05.2020 | Klaus Heeger (TU Berlin) | Multistage Graph Problems on a Global Budget |
| 28.05.2020 | Tomohiro Koana (TU Berlin) | Exploiting c-Closure in Kernelization Algorithms for Graph Problems |
| 04.06.2020 | Hendrik Molter (TU Berlin) | Algorithmic Aspects of Temporal Betweenness |
| 11.06.2020 | Till Fluschnik (TU Berlin) | Multistage Committee Election |
| 18.06.2020 | Junjie Luo (TU Berlin) | On Improving Resource Allocations by Sharing |
| 25.06.2020 | Malte Renken (TU Berlin) | Connectivity Threshold in Random Temporal Graphs |
| 09.07.2020 | Robert Bredereck (TU Berlin) | Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks |
| 16.07.2020 | Danny Hermelin (Ben Gurion University of the Negev) | Scheduling Lower Bounds via AND Subset Sum |
| 23.07.2020 | Valentin Mayer-Eichberger (TU Berlin) | SAT Programming |