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 f deletion approximation and optimal fpt algorithms"):
  Abstract: Let F be a finite set of graphs. In the F-Deletion problem, we are given an n-vertex, m-edge graph G and an integer k as input, and asked whether at most k vertices can be deleted from G such that the resulting graph does not contain a graph from F as a minor. F-Deletion is a generic problem and by selecting different sets of forbidden minors F, one can obtain various fundamental problems such as Vertex Cover, Feedback Vertex Set or Treewidth t-Deletion. #R##N#In this paper we obtain a number of generic algorithmic results about Planar F-Deletion, when F contains at least one planar graph. The highlights of our work are #R##N#- A randomized O(nm) time constant factor approximation algorithm for the optimization version of Planar F-Deletion. #R##N#- A randomized O(2^{O(k)} n) time parameterized algorithm for Planar F-Deletion when F is connected. Here a family F is called connected if every graph in F is connected. The algorithm can be made deterministic at the cost of making the polynomial factor in the running time n\log^2 n rather than linear. #R##N#These algorithms unify, generalize, and improve over a multitude of results in the literature. Our main results have several direct applications, but also the methods we develop on the way have applicability beyond the scope of this paper. Our results -- constant factor approximation and FPT algorithms -- are stringed together by a common theme of polynomial time preprocessing.

Includes members:
  Member "on feedback vertex set new measure and new structures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hitting long directed cycles is fixed parameter tractable")
  Member "hitting and harvesting pumpkins":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal algorithms for hitting topological minors on graphs of bounded treewidth")
  Member "linear kernels on graphs excluding topological minors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight kernel bounds for problems on graphs with small degeneracy")
  Member "solving connectivity problems parameterized by treewidth in single exponential time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space")
  Member "bidimensionality and geometric graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "planar graphs have bounded queue number")
  Member "hitting forbidden minors approximation and kernelization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "structural parameterization for graph deletion problems over data streams")
  Member "a quartic kernel for pathwidth one vertex deletion":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an fpt algorithm and a polynomial kernel for linear rankwidth 1 vertex deletion")
  Member "bidimensionality and eptas":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "improved in approximability bounds for d scattered set")

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)