Recorded Talks

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!

Talks - 2023

ConferenceTitle 
IDEALSustainable On-Street Parking Mapping with Deep Learning and Airborne ImageryLink

 

Talks - 2022

ConferenceTitle 
DocEngOptical Character Recognition Guided Image Super ResolutionLink
ITCSFixed-Parameter Sensitivity OraclesLink

 

Talks - 2021

ConferenceTitle 
ESAEfficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic GeometryLink
ESANear-Optimal Deterministic Single-Source Distance Sensitivity OraclesLink
ESABalanced Crown Decomposition for Connectivity ConstraintsLink
GAMESFlow-Based Network Creation GamesLink
GAMESTopological Influence and Locality in Swap Schelling GamesLink
GECCOEvolutionary Minimization of Traffic CongestionLink
GECCOLower Bounds from Fitness Levels Made EasyLink
IJCAITwo-Stage Facility Location Games with Strategic Clients and FacilitiesLink
MLQAutomated Parameter Tuning via Heuristic SearchLink
OREfficiency and Stability in Euclidean Network DesignLink
ORThe Impact of Geometry on Monochrome Regions in the Flip Schelling ProcessLink
SATSolving Non-Uniform Planted and Filtered Random SAT Formulas GreedilyLink

 

Talks - 2020

ConferenceTitle 
ESAThe Minimization of Random HypergraphsLink
EvoCOPThe Univariate Marginal Distribution Algorithm Copes Well With Deception and EpistasisLink
ICONIPMemetic Genetic Algorithms for Time Series Compression by Piecewise Linear ApproximationLink
IJCAIFlow-Based Network Creation GamesLink
IPECFixed Parameter Tractability of Weighted Edge Clique PartitionLink
WAOAAn Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree ProblemLink