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 "simultaneous pq ordering with applications to constrained embedding problems"):
  Abstract: In this paper, we define and study the new problem Simultaneous PQ-Ordering. Its input consists of a set of PQ-trees, which represent sets of circular orders of their leaves, together with a set of child-parent relations between these PQ-trees, such that the leaves of the child form a subset of the leaves of the parent. Simultaneous PQ-Ordering asks whether orders of the leaves of each of the trees can be chosen simultaneously, that is, for every child-parent relation the order chosen for the parent is an extension of the order chosen for the child. We show that Simultaneous PQ-Ordering is NP-complete in general and that it is efficiently solvable for a special subset of instances, the 2-fixed instances. We then show that several constrained embedding problems can be formulated as such 2-fixed instances. #R##N#In particular, we obtain a linear-time algorithm for Partially PQ-Constrained Planarity for biconnected graphs, a common generalization of two recently considered embedding problems, and a quadratic-time algorithm for Simultaneous Embedding with Fixed Edges for biconnected graphs with a connected intersection; formerly only the much more restricted case that the intersection is biconnected was known to be efficiently solvable. Both results can be extended to the case where the input graphs are not necessarily biconnected but have the property that each cutvertex is contained in at most two non-trivial blocks. This includes for example the case where both graphs have maximum degree 5. Moreover, we give an optimal linear-time algorithm for recognition of simultaneous interval graphs, improving upon a recent O(n^2 log n)-time algorithm due to Jampani and Lubiw and show that this can be used to also solve the problem of extending partial interval representations of graphs with n vertices and m edges in time O(n + m), improving a recent result of Klav\'ik et al.

Includes members:
  Member "simultaneous embedding edge orderings relative positions cutvertices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "atomic embeddability clustered planarity and thickenability")
  Member "disconnectivity and relative positions in simultaneous embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hierarchical partial planarity")
  Member "a kuratowski type theorem for planarity of partially embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "extending upward planar graph drawings")
  Member "simultaneous embedding of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "atomic embeddability clustered planarity and thickenability")
  Member "testing simultaneous planarity when the common graph is 2 connected":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "atomic embeddability clustered planarity and thickenability")
  Member "simultaneous interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simultaneous representation of proper and unit interval graphs")
  Member "on a tree and a path with no geometric simultaneous embedding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the quasefe problem")

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.DS(Data Structures and Algorithms)