2 citations · 2 across the 3 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting
Kyungjin Cho, Eunjin Oh, Sebastian Wiederrecht
We study the \textsc{-Disjoint Paths} problem on a graph embedded on a surface with bounded Euler genus. Given a graph with vertices and vertex pairs embedded on a s…
cs.CG2026
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…