human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "a tight erdos posa function for wheel minors"):
  with members:
    - "recent techniques and results on the erd h o s p osa property"
    - "an o log opt approximation for covering and packing minor models of theta _r"
    - "large treewidth graph decompositions and applications"
    - "polynomial bounds for the grid minor theorem"

Connected through hyperedge HE-2 (induced by source paper "vertex deletion problems on chordal graphs"):
  with members:
    - "approximation and kernelization for chordal vertex deletion"
    - "faster online matrix vector multiplication"
    - "exact algorithms via monotone local search"
    - "approximate association via dissociation"
    - "unit interval editing is fixed parameter tractable"
    - "linear recognition of almost interval graphs"
    - "chordal editing is fixed parameter tractable"
    - "large induced subgraphs via triangulations and cmso"

Connected through hyperedge HE-3 (induced by source paper "parameterized vertex deletion problems for hereditary graph classes with a block property"):
  with members:
    - "a faster fpt algorithm and a smaller kernel for block graph vertex deletion"
    - "a polynomial kernel for block graph deletion"
    - "hitting and harvesting pumpkins"
    - "on the computational complexity of vertex integrity and component order connectivity"
    - "half integrality lp branching and fpt algorithms"
    - "faster deterministic feedback vertex set"
    - "linear kernels and single exponential algorithms via protrusion decompositions"

Connected through hyperedge HE-4 (induced by source paper "linear kernels for edge deletion problems to immersion closed graph classes"):
  with members:
    - "bidimensionality and kernels"
    - "uniform kernelization complexity of hitting forbidden minors"
    - "polynomial bounds for the grid minor theorem"
    - "designing fpt algorithms for cut problems using randomized contractions"

Connected through hyperedge HE-5 (induced by source paper "linear kernels and single exponential algorithms via protrusion decompositions"):
  with members:
    - "slightly superexponential parameterized problems"
    - "bidimensionality and kernels"
    - "myhill nerode methods for hypergraphs"
    - "hitting and harvesting pumpkins"
    - "linear recognition of almost interval graphs"
    - "kernelization using structural parameters on sparse graph classes"
    - "meta kernelization with structural parameters"
    - "interval deletion is fixed parameter tractable"

Connected through hyperedge HE-6 (induced by source paper "interval deletion is fixed parameter tractable"):
  with members:
    - "on feedback vertex set new measure and new structures"
    - "chordal editing is fixed parameter tractable"
    - "an efficient branching algorithm for interval completion"
    - "d cos r is fpt via interval deletion"
    - "obtaining a planar graph by vertex deletion"

Question: Please tell me which class the center node 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)