5 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.CG2026
Touring a Sequence of Orthogonal Polygons
Katrin Casel, Sándor Kisfaludi-Bak, Linda Kleist +3
We study the problem of computing a shortest tour that visits a sequence of polygons with a total number of vertices. A tour is an oriented curve such that…
cs.DS2025
Emit As You Go: Enumerating Edges of a Spanning Tree
Katrin Casel, Stefan Neubert
Classically, planning tasks are studied as a two-step process: plan creation and plan execution. In situations where plan creation is slow (for example, due to expensive informatio…
cs.DS2021★ 5 cited
Fine-Grained Complexity of Regular Path Queries
Katrin Casel, Markus L. Schmid
A regular path query (RPQ) is a regular expression q that returns all node pairs (u, v) from a graph database that are connected by an arbitrary path labelled with a word from L(q)…