BARC talk by André Nusser

Tuesday, 1 March 2022,  our new colleague André Nusser, Postdoc at BARC and newest addition to the AC section at DIKU, will give a talk on "Fine-Grained Complexity and Algorithm Engineering in Computational Geometry".

Title:
Fine-Grained Complexity and Algorithm Engineering in Computational Geometry

Abstract:
Computer science as a field aims to better understand the power and limitations of computation but also enables new results in fields that crucially rely on computation. While on first glance it seems that algorithmics in the form of algorithm design should be the central area of research in this regard, progress very much relies on complexity theory to understand the inherent hardness of certain problems, and an engineering approach, to transfer the theoretical knowledge into practical knowledge that can then be further exploited. In this spirit, we consider three central parts of algorithms research in this talk: Algorithm design, (fine-grained) complexity lower bounds, and algorithm engineering. More concretely, we consider results in these areas for various geometric similarity measures like Fréchet distance, Hausdorff distance under translation, and dynamic time warping under translation.

Bio:
Before André Nusser joined BARC in December 2021, he was a PhD student at Max Planck Institute for Informatics, Germany, supervised by Karl Bringmann. Following the recently successful usage of dynamic algorithm as subroutines in algorithms in computational geometry, he plans to further dive into this area while also following his curiosity and motivation to wherever it leads him. 
André is interested in a diverse range of topics with a focus on algorithm design, fine-grained lower bounds, and algorithm engineering in computational geometry, in particular, sequence and point set similarity measures.