Similar Items: Coordinated Motion Planning is FPT on Discretized Simple Polygons
- Visibility Queries in Simple Polygons
- Touring a Sequence of Orthogonal Polygons
- FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
- Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
- Simple KNN-Based Outlier Detection Achieves Robust Clustering
- Small Independent Sets versus Small Separator in Geometric Intersection Graphs