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

Optimal robust algorithms for finding a triangle and computing the unweighted girth in unit disk graphs, as well as finding a triangle in transmission graphs.