2 papers
cs.DS2026
Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
Jan Dreier, Clemens Kuske
Orders with low crossing number, introduced by Welzl, are a fundamental tool in range searching and computational geometry. Recently, they have found important applications in stru…
math.CO2026
On non-planar, cycle-conformal graphs
Maximilian Gorsky, Clemens Kuske
A graph is called matching covered if all of its edges are contained in some perfect matching of . Furthermore, a cycle is called conformal if has…