B. M. Jansen

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2026

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs

Mark de Berg, Bart M. P. Jansen, Jeroen S. K. Lamme

We study SINGLE-SOURCE SHORTEST PATH (SSSP) on unweighted intersection graphs whose node set corresponds to a set of $n$ constant-complexity objects in the plane. We prove SSSP can…

cs.CG2025

Star-Based Separators for Intersection Graphs of $c$ -Colored Pseudo-Segments

M. de Berg, B. M. P. Jansen, J. S. K. Lamme

The Planar Separator Theorem, which states that any planar graph $G$ has a separator consisting of $O (n)$ nodes whose removal partitions $G$ into compone…

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs

Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments

Star-Based Separators for Intersection Graphs of $c$ -Colored Pseudo-Segments