2 papers
cs.DS2026
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Jan-Henrik Haunert, Joshua Marc Könen, Heiko Röglin +1
A problem that occurs in different applications in geographical information science is to generate compact regions from areas on a map. This is important, e.g., in the context of e…
cs.DS2025
Parameterized Algorithms for Computing Pareto Sets
Joshua Könen, Heiko Röglin, Tarek Stuck
Dynamic programming over tree decompositions is a common technique in parameterized algorithms. In this paper, we study whether this technique can also be applied to compute Pareto…