circularity optimization 1geometric subdivision 1np-hardness 1planar graphs 1pseudopolynomial algorithms 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DS2026
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Jan-Henrik Haunert, Joshua Marc Könen, Heiko Röglin +1
The paper investigates how to select faces in a planar polygonal subdivision to maximize a circularity measure (Polsby‑Popper score or its generalization A/P^α), proving weak NP‑ha…
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…