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 "graph planarity testing with hierarchical embedding constraints"):
  Abstract: Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees. FPQ-trees are a variant of PQ-trees that includes F-nodes in addition to P- and to Q-nodes. An F-node represents a permutation that is fixed, i.e., it cannot be reversed. Let $G$ be a graph such that every vertex of $G$ is equipped with a set of FPQ-trees encoding hierarchical embedding constraints for its incident edges. We study the problem of testing whether $G$ admits a planar embedding such that, for each vertex $v$ of $G$, the cyclic order of the edges incident to $v$ is described by at least one of the FPQ-trees associated with $v$. We prove that the problem is NP-complete even when the number of FPQ-trees associated with each vertex is bounded by a constant. If however the branchwidth of $G$ is bounded, the problem can be solved in polynomial time. Besides being interesting on its own right, the study of planarity testing with hierarchical embedding constraints can be used to address other planarity testing problems which can be modeled by associating a set of FPQ-trees to the vertices of the input graph. As a proof of concept, we apply our techniques to the study of NodeTrix planarity testing of clustered graphs. We show that NodeTrix planarity testing with fixed sides is fixed-parameter tractable when parameterized by the size of the clusters and by the tree-width of the multi-graph obtained by collapsing the clusters to single vertices.

Includes members:
  Member "a new perspective on clustered planarity as a combinatorial embedding problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "intersection link representations of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "simultaneous pq ordering with applications to constrained embedding problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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.DS(Data Structures and Algorithms)