Inhalt des Dokuments
Research Colloquium (Winter Term 2020/2021)
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, usually at meet.akt.tu-berlin.de/b/mal-jkm-myf.
Date | Speaker | Topic |
---|---|---|
03.11.2020 16:00 | Nimrod Talmon (Ben-Gurion University of the Negev) | Participatory Budgeting with Project Groups |
10.11.2020 16:00 | Hendrik Molter (TU Berlin) | Equitable Scheduling on a Single Machine |
17.11.2020 16:00 | Tomohiro Koana (TU Berlin) | Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs |
24.11.2020 16:00 | René van Bevern (Novosibirsk State University) | The Hierarchical Chinese Postman Problem |
01.12.2020 16:00 | Niclas Boehmer (TU Berlin) | A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas |
08.12.2020 16:00 | Jason Schoeters (University of Bordeaux) | A Traveling Salesperson Problem with Racetrack-like acceleration constraints |
15.12.2020 16:00 | Malte Renken (TU Berlin) | Connectivity thresholds in random temporal graphs |
22.12.2020 16:00 | Niels Grüttemeier (Philipps-Universität Marburg) | Bayesian Network Structure Learning |
05.01.2021 16:00 | Christian Komusiewicz (Philipps-Universität Marburg) | Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration |
12.01.2021 16:00 | Philipp Zschoche (TU Berlin) | A Faster Parameterized Algorithm for Temporal Matching |
19.01.2021 16:00 | Aleksander Figiel (TU Berlin) | Finding Four-Node Subgraphs in Triangle Time by Virginia Williams, Joshua Wang, Ryan Williams, and Huacheng Yu. |
19.01.2021 17:00 | Jacob Fahlenkamp (TU Berlin) | Hamiltonicity Below Dirac’s Condition by Bart Jansen, László Kozma, and Jesper Nederlof. |
26.01.2021 16:00 | Manuel Sorge (TU Vienna) | Optimal Discretization is Fixed-Parameter Tractable |
02.02.2021 16:00 | Till Fluschnik (TU Berlin) | A Multistage View on 2-Satisfiability |
09.02.2021 16:00 | Klaus Heeger (TU Berlin) | Multidimensional Stable Roommates with Master List |
16.02.2021 16:00 | Andrzej Kaczmarczyk (TU Berlin) | tba |
23.02.2021 16:00 | Leon Kellerhals (TU Berlin) | Approximating Sparse Quadratic Programs |