2 papers
cs.CG2026
On 2-Layer k-Matching-Planar Graphs
Saeed Odak, Jonathan Rollin, Torben Scheele
A graph is -matching-planar if it admits a drawing in the plane such that, for every edge , the edges crossing contain no matching of size greater than . The class of…
cs.CG2024
Geometric spanners of bounded tree-width
Kevin Buchin, Carolin Rehs, Torben Scheele
Given a point set in the Euclidean space, a geometric -spanner is a graph on such that for every pair of points, the shortest path in between those points is at…