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 the conference year and conference acronym.

## Talks - 2022

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

DocEng | Optical Character Recognition Guided Image Super Resolution
This is joint work with Maximilian Schulze, Sarel Cohen, Vanja Doskoč, Raid Saabni and Tobias Friedrich. | Link |

ITCS | Fixed-Parameter Sensitivity Oracles
This is joint work with Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Gregor Lagodzinski, and Simon Wietheger. | Link |

## Talks - 2021

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

ESA | Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
This is joined work with Thomas Bläsius and Tobias Friedrich. | Link |

ESA | Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles
This is joined work with Davide Bilò, Sarel Cohen and Tobias Friedrich. | Link |

ESA | Balanced Crown Decomposition for Connectivity Constraints
This is joined work with Katrin Casel, Tobias Friedrich, Davis Issac and Aikaterini Niklanovits. | Link |

GAMES | Flow-Based Network Creation Games
This is joined work with Hagen Echzell, Tobias Friedrich and Pascal Lenzner. | Link |

GAMES | Topological Influence and Locality in Swap Schelling Games
This is joined work with Davide Bilò, Vittorio Bilò and Pascal Lenzner. | Link |

GECCO | Evolutionary Minimization of Traffic Congestion
This is joined work with Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca, Louise Molitor and Leon Schiller. | Link |

GECCO | Lower Bounds from Fitness Levels Made Easy
This is joined work with Benjamin Doerr. | Link |

ICALP | On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
This is joined work with Andreas Göbel, Katrin Casel and Tobias Friedrich. | Link |

ICALP | A Spectral Independence View on Hard Spheres via Block Dynamics
This is joined work with Tobias Friedrich, Andreas Göbel and Martin S. Krejca. | Link |

IJCAI | Two-Stage Facility Location Games with Strategic Clients and Facilities
This is joined work with Pascal Lenzner, Louise Molitor and Alexander Skopalik. | Link |

MLQ | Automated Parameter Tuning via Heuristic Search
| Link |

OR | Efficiency and Stability in Euclidean Network Design
This is joined work with Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Jannik Peters, Daniel Stephan and Michael Vaichenker. | Link |

OR | The Impact of Geometry on Monochrome Regions in the Flip Schelling Process
This is joined work with Thomas Bläsius, Tobias Friedrich and Martin S. Krejca. | Link |

SAT | Solving Non-Uniform Planted and Filtered Random SAT Formulas Greedily
This is joined work with Tobias Friedrich, Frank Neumann and Andrew M. Sutton. | Link |

## Talks - 2020

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

ATMOS | 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 | 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 | The Univariate Marginal Distribution Algorithm Copes Well With Deception and Epistasis
This is joined work with Benjamin Doerr. | Link |

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

IJCAI | Flow-Based Network Creation Games
This is joined work with Tobias Friedrich, Pascal Lenzner and Anna Melnichenko. | Link |

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

VLDB | 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 | An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem
This is joined work with Stephan Held. | Link |

## Talks - 2017

Talk | Title | |
---|---|---|

PhD Defense | Structures and Algorithms in Hyperbolic Random Graphs
| Link |