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 "on the mathcal np hardness of gracsim drawing and k sefe problems"):
  Abstract: We study the complexity of two problems in simultaneous graph drawing. The first problem, GRacSim Drawing, asks for finding a simultaneous geometric embedding of two graphs such that only crossings at right angles are allowed. The second problem, k-SEFE, is a restricted version of the topological simultaneous embedding with fixed edges (SEFE) problem, for two planar graphs, in which every private edge may receive at most $k$ crossings, where $k$ is a prescribed positive integer. We show that GRacSim Drawing is $\mathcal{NP}$-hard and that k-SEFE is $\mathcal{NP}$-complete. The $\mathcal{NP}$-hardness of both problems is proved using two similar reductions from 3-Partition.

Includes members:
  Member "simultaneous drawing of planar graphs with right angle crossings and few bends":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the quasefe problem")
  Member "simultaneous embeddings with few bends and crossings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "drawing partially embedded and simultaneously planar graphs")
  Member "simultaneous visibility representations of plane st graphs using l shapes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the quasefe problem")
  Member "simultaneous embedding edge orderings relative positions cutvertices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "atomic embeddability clustered planarity and thickenability")
  Member "drawing partially embedded and simultaneously planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of drawing a graph in a polygonal region")
  Member "sefe with no mapping via large induced outerplane graphs in plane graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the utility of untangling")
  Member "advancements on sefe and partitioned book embedding problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "upward book embeddings of st graphs")
  Member "simultaneous embedding of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "atomic embeddability clustered planarity and thickenability")

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)