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 "planar disjoint paths in linear time"):
  Abstract: The Disjoint Paths problem asks whether a fixed number of pairs of terminals in a graph $G$ can be linked by pairwise disjoint paths. In the context of this problem, Robertson and Seymour introduced the celebrated irrelevant vertex technique that has since become standard in graph algorithms. The technique consists of detecting a vertex that is irrelevant in the sense that its removal creates an equivalent instance of the problem. That way, one may solve the problem in $O(n^2)$ steps, as the detection of an irrelevant vertex takes $O(n)$ time and at most $n$ vertices may need to be removed. In this paper we study the Planar Disjoint Paths problem where the input graph is planar. We introduce an extension of the irrelevant vertex technique where all the irrelevant vertices are removed simultaneously so that an instance of the Planar Disjoint Paths problem can be transformed in a linear number of steps to an equivalent one that has bounded treewidth. As a consequence, the Planar Disjoint Paths problem can be solved in linear time for every fixed number of terminals.

Includes members:
  Member "a lower bound on the tree width of graphs with irrelevant vertices":
    also connected through other hyperedges:
      (none)
  Member "finding topological subgraphs is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hitting topological minors is fpt")
  Member "obtaining a planar graph by vertex deletion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hitting topological minor models in planar graphs is fixed parameter tractable")

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)