3 papers
cs.DS2026
Dimension Reduction for Curves: Simplified and Generalized
Matthijs Ebbens, Jie Lu, Alexander Munteanu
We revisit random projections for reducing the dimension of high-dimensional polygonal curves. Drawing from the toolbox of randomized linear algebra, we give a considerably simplif…
cs.CG2025
Computing the second and third systoles of a combinatorial surface
Matthijs Ebbens, Francis Lazarus
Given a weighted, undirected graph cellularly embedded on a topological surface , we describe algorithms to compute the second shortest and third shortest closed walks of $G…
cs.DS2025
A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
Matthijs Ebbens, Nicole Funk, Jan Höckendorff +2
We study the -center problem in the context of individual fairness. Let be a set of points in a metric space and be the distance between and its $\lceil…