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 "explicit linear kernels via dynamic programming"):
  Abstract: Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with the result of Bodlaender et al. [FOCS 2009] on graphs of bounded genus, then generalized by Fomin et al. [SODA 2010] to graphs excluding a fixed minor, and by Kim et al. [ICALP 2013] to graphs excluding a fixed topological minor. Typically, these results guarantee the existence of linear or polynomial kernels on sparse graph classes for problems satisfying some generic conditions but, mainly due to their generality, it is not clear how to derive from them constructive kernels with explicit constants. In this paper we make a step toward a fully constructive meta-kernelization theory on sparse graphs. Our approach is based on a more explicit protrusion replacement machinery that, instead of expressibility in CMSO logic, uses dynamic programming, which allows us to find an explicit upper bound on the size of the derived kernels. We demonstrate the usefulness of our techniques by providing the first explicit linear kernels for $r$-Dominating Set and $r$-Scattered Set on apex-minor-free graphs, and for Planar-\mathcal{F}-Deletion on graphs excluding a fixed (topological) minor in the case where all the graphs in \mathcal{F} are connected.

Includes members:
  Member "slightly superexponential parameterized problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of finding large odd induced subgraphs and odd colorings")
  Member "bidimensionality and kernels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hitting topological minors is fpt")
  Member "uniform kernelization complexity of hitting forbidden minors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a turing kernelization dichotomy for structural parameterizations of mathcal f minor free deletion")
  Member "large treewidth graph decompositions and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "polynomial bounds for the grid minor theorem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hitting topological minors is fpt")
  Member "linear kernels and single exponential algorithms via protrusion decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hitting topological minors is fpt")
  Member "bidimensionality and eptas":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved in approximability bounds for d scattered set")
  Member "cross composition a new technique for kernelization lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parameterized coloring problems on threshold graphs")

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)