Benedikt Kolbe

activity

20232026

most citedFine-Grained Complexity of Continuous Euclidean k-Center

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

On Eigenvalue Bounds for Bounded Genus Graphs and Minor-Free Graphs

Benedikt Kolbe, Jack Spalding-Jamieson

In this paper, we resolve a 30-year-old conjecture of Spielman and Teng concerning the performance of the spectral partitioning method on graphs embeddable on an orientable surface…

cs.CG2026★ 1 cited

Fine-Grained Complexity of Continuous Euclidean k-Center

Lotte Blank, Karl Bringmann, Parinya Chalermsook +4

In the (continuous) Euclidean $k$ -center problem, given $n$ points in $R^{d}$ and an integer $k$ , the goal is to find $k$ center points in $R^{d}$ that minimize the m…