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 "hitting topological minors is fpt"):
  Abstract: In the Topological Minor Deletion (TM-Deletion) problem input consists of an undirected graph $G$, a family of undirected graphs ${\cal F}$ and an integer $k$. The task is to determine whether $G$ contains a set of vertices $S$ of size at most $k$, such that the graph $G\setminus S$ obtained from $G$ by removing the vertices of $S$, contains no graph from ${\cal F}$ as a topological minor. We give an algorithm for TM-Deletionwith running time $f(h^\star,k)\cdot |V(G)|^{4}$. Here $h^\star$ is the maximum size of a graph in ${\cal F}$ and $f$ is a computable function of $h^\star$ and $k$. This is the first fixed parameter tractable algorithm (FPT) for the problem. In fact, even for the restricted case of planar inputs the first FPT algorithm was found only recently by Golovach et al. [SODA 2020]. For this case we improve upon the algorithm of Golovach et al. [SODA 2020] by designing an FPT algorithm with explicit dependence on $k$ and $h^\star$.

Includes members:
  Member "hitting topological minor models in planar graphs is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reducing topological minor containment to the unique linkage theorem")
  Member "improved analysis of highest degree branching for feedback vertex set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reducing topological minor containment to the unique linkage theorem")
  Member "losing treewidth by separating subsets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reducing topological minor containment to the unique linkage theorem")
  Member "a 2 approximation algorithm for feedback vertex set in tournaments":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reducing topological minor containment to the unique linkage theorem")
  Member "polylogarithmic approximation for minimum planarization almost":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reducing topological minor containment to the unique linkage theorem")
  Member "exact algorithms for maximum independent set":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reducing topological minor containment to the unique linkage theorem")
  Member "bidimensionality and kernels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a general kernelization technique for domination and independence problems in sparse classes")
  Member "exact algorithms via monotone local search":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reducing topological minor containment to the unique linkage theorem")

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)