human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time"
  Abstract: A new hierarchical clustering method for point sets is presented, called diameter clustering, whose clusters belong to most other natural clusterings. For each cluster it holds that its diameter is small compared to the distance to a nearest point outside the cluster. Given a Euclidean minimum spanning tree of the input point set, it is shown that the diameter clustering can be computed in linear time. In addition we derive a nice property of this hierarchy which makes it particularly useful as a building block. It is shown in this paper that it can be employed to obtain a good approximation for the known single linkage clustering in roughly linear time. Other examples of its usefulness include computing the greedy triangulation, the complete linkage hierarchy, and a data structure for faster range queries.

Connected through hyperedge HE-1 (induced by source paper "The First Subquadratic Algorithm for Complete Linkage Clustering"):
  with members:
    (none)

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics