human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "matchings in geometric graphs"):
  Abstract: A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect if it matches all the vertices of the underling graph. A geometric matching is a matching in a geometric graph. In this thesis, we study matching problems in various geometric graphs. Among the family of geometric graphs we look at complete graphs, complete bipartite graphs, complete multipartite graphs, Delaunay graphs, Gabriel graphs, and $\Theta$-graphs. The classical matching problem is to find a matching of maximum size in a given graph. We study this problem as well as some of its variants on geometric graphs. The bottleneck matching problem is to find a maximum matching that minimizes the length of the longest edge. The plane matching problem is to find a maximum matching so that the edges in the matching are pairwise non-crossing. A geometric matching is strong with respect to a given shape $S$ if we can assign to each edge in the matching a scaled version of $S$ such that the shapes representing the edges are pairwise disjoint. The strong matching problem is to find a maximum strong matching with respect to a given shape. The matching packing problem is to pack as many edge-disjoint perfect matchings as possible into a geometric graph. We study these problems and establish lower and upper bounds on the size of different kinds of matchings in various geometric graphs. We also present algorithms for computing such matchings. Some of the presented bounds are tight, while the others need to be sharpened.

Includes members:
  Member "packing plane spanning trees and paths in complete geometric graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "packing plane spanning trees into a point set")
  Member "flip distance to a non crossing perfect matching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "flip distance to some plane configurations")
  Member "balanced partitions of 3 colored geometric sets in the plane":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "geometric systems of unbiased representatives")
  Member "packing plane perfect matchings into a point set":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "packing plane spanning trees into a point set")
  Member "10 gabriel graphs are hamiltonian":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "higher order triangular distance delaunay graphs graph theoretical properties")
  Member "higher order triangular distance delaunay graphs graph theoretical properties":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximum matchings and minimum blocking sets in θ 6 graphs")
  Member "approximating the bottleneck plane perfect matching of a point set":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "euclidean bottleneck bounded degree spanning tree ratios")
  Member "fixed orientation equilateral triangle matching of point sets":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "maximum matchings and minimum blocking sets in θ 6 graphs")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CG(Computational Geometry)