My research tackles questions having roots in computational geometry as well as graph theory. My predoctoral research was mainly concerned with problems where grid graphs played an underlying structural property of importance. However, in more recent times, I got more and more interested in questions that concern configurations and arrangements of discrete objects in the plane (and are not required to rely on grid points) from a large variety of viewpoints.
Netzwerkalgorithmen: | 2021 / 2020 / 2019 / 2018 / 2017 |
Algorithmische Geometrie: | 2021 / 2020 / 2019 |
Mathematische Methoden der Algorithmik: | 2016 |
Algorithmen und Datenstrukturen: | 2018 / 2017 |
Seminar Master: | 2023 (S,W) / 2022 (S) / 2021 (S,W) / 2020 (S,W) / 2019 (S,W) / 2018 (S,W) / 2017 (S,W) / 2016 (W) |
Seminar Bachelor: | 2023 (S,W) / 2022 (S) / 2021 (S,W) / 2020 (S,W) / 2019 (S,W) / 2018 (S,W) / 2017 (S,W) / 2016 (W) |
Bachelor: | Coordinated motion planning in three-dimensional settings (ongoing) |
Bachelor: | Token swapping with precedence constraints (ongoing) |
Project: | Disperse guards optimally (ongoing) |
Bachelor: | Hamiltonian cycles in dynamic chess-akin graphs (ongoing) |
Master: | Efficient reconfiguration in the parallel sliding particle model (ongoing) |
Bachelor: | Reconfiguration of graph colorings |
Bachelor: | Coordinated reconfiguration with spatial separation |
Bachelor: | Coordinated motion planning in restricted domains |
Bachelor: | Reconfiguring tile arrangements by robots |
Master: | Guarding with priorities |
Bachelor: | Variants of the ordered path problem |
Master: | Scanning polygons with mobile guards |
Master: | Flip graphs of non-crossing configurations in the plane |
Project: | Discrete reconfiguration problems -- overview and open problems |
Bachelor: | Algorithmic methods for new variants of the traveling salesman problem |
Master: | Reinforcement learning approaches for dynamic packing with gravity constraints (canceled) |
Master: | Algorithmic methods for coordinated motion planning with multiple targets |
Bachelor: | Single step tilt assembly with multiple seeds |
Bachelor: | Computing outerplanar vertex partitions |
Master: | Theoretical and practical approaches for optimizing lawn mowing and milling |
Bachelor: | New approaches to geometric reconfiguration problems under connectivity constraints |
Master: | Manipulating three-dimensional lattice-based cellular structures by finite automata (canceled) |
Bachelor: | Geometric algorithms for special cases of connected unlabeled robot motion planning |
Bachelor: | Variations and extentions of the two guards problem |
Master: | New variants of the tilt assembly problem |
Bachelor: | Methoden für dynamisch balancierte Packprobleme (in German) |
Project: | Variants of the watchman problem |
Bachelor: | Algorithmische Ansätze für energiebeschränkte Art-Gallery-Probleme (in German) |
Bachelor: | Algorithmen für dynamisch balancierte Rekonfigurationsprobleme (in German) |
Bachelor: | New variants of the floodlight problem |
Bachelor: | Dispersive art gallery problems |
Master: | Online covering with scan and travel cost |
Bachelor: | Verteilte Algorithmen zur Objekterkennung mit Smart Pixeln (in German) |
Technische Universität Braunschweig
Universitätsplatz 2
38106 Braunschweig
Postfach: 38092 Braunschweig
Telefon: +49 (0) 531 391-0