labeled graphs 1matrix multiplication 1parameterized complexity 1SETH lower bounds 1string matching 1walk length 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DS2026
String Matching in (Block) Graphs: A Full Classification by Walk Length
Sebastian Angrick, Ben Bals, PaweÅ Gawrychowski +3
The paper classifies the computational complexity of finding a walk with a given pattern in directed graphs whose nodes are labeled by strings, focusing on walks that traverse a bo…
cs.CG2026
Computing Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
Sebastian Angrick, Kevin Buchin, Geri Gokaj +1
To measure the shape similarity of point sets, various notions of the Hausdorff distance under translation are widely studied. In this context, for an -point set and -poi…