My research tackles questions rooted in both computational geometry and graph theory. During my predoctoral studies, I focused primarily on problems where grid graphs served as a crucial structure. Recently, however, 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.
Bachelor: | Coordinated motion planning in three dimensions |
Bachelor: | On flipping trees |
Project: | Guarding practically motivated polygons with maximum dispersion |
Bachelor: | Paths and tours in dynamic chessboard-like graphs |
Master: | Efficient reconfiguration in the parallel sliding particle model |
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) |
Vacancies of TU Braunschweig
Career Service' Job Exchange
Merchandising
Term Dates
Courses
Degree Programmes
Information for Freshman
TUCard
Technische Universität Braunschweig
Universitätsplatz 2
38106 Braunschweig
P. O. Box: 38092 Braunschweig
GERMANY
Phone: +49 (0) 531 391-0