Fixed-Parameters Computational Geometry III
A recent trend in algorithms research is the study of so-called fixed- parameter tractability (FPT) of computational problems.
So far, research on FPT has mainly focused on graph problems. However, there are also many geometric problems that may profit from studying them in the FPT framework. Hence, there is a great potential for collaboration between researchers from the areas of FPT and computational geometry. Thus the goal of the workshop is to bring together researchers from these two areas, to learn about the techniques that have been developed and the problems being studied in the other area, with the goal of fostering collaborations.
This is a follow-up on our successful previous Lorentz workshops in 2016 and 2018 (also sponsored by Networks), which already led to several papers. In the new workshop the scope will be extended to include fine-grained complexity, a topic that has received considerable attention over the past few years.
Mark de Berg (TU Eindhoven)
Hans Bodlaender (Utrecht University)
Karl Bringmann (MMPI)
Christian Knauer (Unversität Bayreuth)