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 "bidimensionality and kernels"):
  Abstract: Bidimensionality theory was introduced by Demaine et al. in 2005 as a tool to obtain subexponential time parameterized algorithms on H-minor-free graphs. Demaine and Hajiaghayi extended the theory to obtain polynomial time approximation schemes (PTASs) for bidimen- sional problems. In this work, we establish a third meta-algorithmic direction for bidimensionality theory by relating it to the existence of linear kernels for parameterized problems. In particular, we prove that every minor (respectively contraction) bidimensional problem that satisfies a separation property and is expressible in Countable Monadic Second Order Logic (CMSO), admits a linear kernel for classes of graphs that exclude a fixed graph (respectively an apex graph) H as a minor. Our results imply that a multitude of bidimensional problems admit linear kernels on the corresponding graph classes. For most of these problems no polynomial kernels on H-minor-free graphs were known prior to our work.

Includes members:
  Member "improved bounds for the excluded grid theorem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "theta triangle free and even hole k_4 free graphs part 1 layered wheels")
  Member "linear kernels for edge deletion problems to immersion closed graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reducing topological minor containment to the unique linkage theorem")
  Member "neighborhood complexity and kernelization for nowhere dense classes of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the parameterized complexity of reconfiguration of connected dominating sets")
  Member "kernelization and sparseness the case of dominating set":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "domination above r independence does sparseness help")
  Member "explicit linear kernels via dynamic programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary")
  Member "bidimensionality of geometric intersection graphs":
    also connected through other hyperedges:
      (none)
  Member "polynomial bounds for the grid minor theorem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hitting topological minors is fpt")
  Member "kernels for connected dominating set on graphs with excluded topological subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a general kernelization technique for domination and independence problems in sparse classes")

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)