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: "linear kernels for separating a graph into components of bounded size"
  Abstract: Abstract   The p-Size Separator problem is to check whether we can delete at most k vertices in a given graph such that each connected component of the remaining graph has at most p vertices. We prove a kernel of    O  (  p  k  )    vertices for this problem, i.e., a linear vertex kernel for each fixed    p  ≥  1   . Our proofs are based on extremal combinatorial arguments and the main result can be regarded as a generalization of the Nemhauser and Trotter's theorem for the  Vertex Cover  problem. Our techniques are possible to be used to improve kernel algorithms based on the expansion lemma or crown decompositions.

Connected through hyperedge HE-1 (induced by source paper "parameterized algorithms for generalizations of directed feedback vertex set"):
  with members:
    - "a 2 ell k kernel for ell component order connectivity"
    - "dag width and circumference of digraphs"
    - "hardness of vertex deletion and project scheduling"
    - "directed subset feedback vertex set is fixed parameter tractable"
    - "fixed parameter tractability of directed multiway cut parameterized by the size of the cutset"

Connected through hyperedge HE-2 (induced by source paper "parameterized complexity of safe set"):
  with members:
    - "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms"
    - "solving integer linear programs with a small number of global variables and constraints"
    - "partitioning a graph into small pieces with applications to path transversal"
    - "on the computational complexity of vertex integrity and component order connectivity"

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)