Due to the SARS-Covid-2 outbreak, many conferences switched to online solutions in order to be held regardless of the situation. As a result, many talks were prerecorded so that the audience could watch them from home. An advantage thereof is that these talks can be rewatched later on. Here, we gather all prerecorded talks of our group members in order for you to enjoy them one more time!

To view a talk, please click on "Link". You will be redirected to the video. To see the information of the talk, either click on the conference acronym or the title of the respective talk. Please note that the talks are sorted lexicographically with respect to conference acronym and the year.

## Talks

Conference | Title | |
---|---|---|

ATMOS 2020 | A Strategic Routing Framework and Algorithms for Computing Alternative Paths
This is joined work with Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells and Simon Witheger. | Link |

ESA 2020 | The Minimization of Random Hypergraphs
In the video we highlight our recent results on the minization of maximum-entropy hypergraphs with a prescribed number of edges and expected edge size. We give tigh bounds on the expected number of minimal edges and briefly touch on the tools used in the proofs. The most important technical contribution is an improvement of the Chernoff-Hoeffding theorem on the tail of the binomial distribution. In particular, we show that for a random variable \(X \sim \mathrm{Bin}(n,p)\) and any \(0 < x < p\), it holds that \(\mathrm{P}[X \le xn] = \Theta( 2^{-\mathrm{D}(x \,{\|}\, p) n}/\sqrt{n})\), where \(\mathrm{D}\) is the Kullback-Leibler divergence from information theory. This is joined work with Thomas Bläsius and Tobias Friedrich. | Link |

EvoCOP 2020 | The Univariate Marginal Distribution Algorithm Copes Well With Deception and Epistasis
This is joined work with Benjamin Doerr. | Link |

ICONIP 2020 | Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation
This is joined work with Tobias Friedrich, Martin Krejca, Gregor Lagodzinski, and Manuel Rizzo. | Link |

IPEC 2020 | Fixed Parameter Tractability of Weighted Edge Clique Partition
This is joined work with Andreas Emil Feldmann and Ashutosh Rai. | Link |

MLQ 2021 | Automated Parameter Tuning via Heuristic Search
| Link |

VLDB 2020 | Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery
This is joined work with Johann Birnick, Tobias Friedrich, Felix Naumann, Thorsten Papenbrock, and Martin Schirneck. | Link |

WAOA 2020 | An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem
This is joined work with Stephan Held. | Link |