human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups authors who co-authored the same paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "Computing the Fréchet distance with shortcuts is NP-hard"):
  Abstract: We study the shortcut Frechet distance, a natural variant of the Frechet distance, that allows us to take shortcuts from and to any point along one of the curves. The classic Frechet distance is a bottle-neck distance measure and hence quite sensitive to outliers. The shortcut Frechet distance allows us to cut across outliers and hence produces more meaningful results when dealing with real world data. Driemel and Har-Peled recently described approximation algorithms for the restricted case where shortcuts have to start and end at input vertices. We show that, in the general case, the problem of computing the shortcut Frechet distance is NP-hard. This is the first hardness result for a variant of the Frechet distance between two polygonal curves in the plane. We also present two algorithms for the decision problem: a 3-approximation algorithm for the general case and an exact algorithm for the vertex-restricted case. Both algorithms run in O(n3 log n) time.

Includes members:
  Member "Similarity of polygonal curves in the presence of outliers":
    also connected through other hyperedges:
      (none)

Question: Please tell me which research area the co-authored paper (i.e., the source paper of the center hyperedge) belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics