activity
20172026
most citedDynamic Connectivity in Disk Graphs

2 citations · 2 across the 7 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.CG2024

Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs

Katharina Klost, Wolfgang Mulzer

We describe optimal robust algorithms for finding a triangle and the unweighted girth in a unit disk graph, as well as finding a triangle in a transmission graph.In the robust sett…