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: "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.

Connected through hyperedge HE-1 (induced by source paper "a complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary"):
  with members:
    - "composing dynamic programming tree decomposition based algorithms"
    - "hitting topological minor models in planar graphs is fixed parameter tractable"
    - "slightly superexponential parameterized problems"
    - "optimal algorithms for hitting topological minors on graphs of bounded treewidth"
    - "deleting vertices to graphs of bounded genus"
    - "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms"
    - "hitting minors on bounded treewidth graphs"
    - "explicit linear kernels for packing problems"

Connected through hyperedge HE-2 (induced by source paper "optimal algorithms for hitting topological minors on graphs of bounded treewidth"):
  with members:
    - "slightly superexponential parameterized problems"
    - "deleting vertices to graphs of bounded genus"
    - "how much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs"
    - "bidimensionality and kernels"
    - "a tight lower bound for vertex planarization on graphs of bounded treewidth"
    - "hitting and harvesting pumpkins"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "solving connectivity problems parameterized by treewidth in single exponential time"

Connected through hyperedge HE-3 (induced by source paper "how much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs"):
  with members:
    - "bidimensionality and kernels"
    - "vertex cover structural parameterization revisited"
    - "meta kernelization using well structured modulators"
    - "a faster parameterized algorithm for treedepth"
    - "meta kernelization with structural parameters"
    - "kernelization lower bounds by cross composition"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "dynamic programming for graphs on surfaces"

Connected through hyperedge HE-4 (induced by source paper "explicit linear kernels for packing problems"):
  with members:
    - "bidimensionality and kernels"
    - "kernelization algorithms for packing problems allowing overlaps"
    - "scattered packings of cycles"
    - "induced packings of cycles"
    - "large treewidth graph decompositions and applications"
    - "polynomial bounds for the grid minor theorem"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "solving connectivity problems parameterized by treewidth in single exponential time"

Connected through hyperedge HE-5 (induced by source paper "bidimensionality and kernels"):
  with members:
    - "improved bounds for the excluded grid theorem"
    - "linear kernels for edge deletion problems to immersion closed graph classes"
    - "neighborhood complexity and kernelization for nowhere dense classes of graphs"
    - "kernelization and sparseness the case of dominating set"
    - "bidimensionality of geometric intersection graphs"
    - "polynomial bounds for the grid minor theorem"
    - "kernels for connected dominating set on graphs with excluded topological subgraphs"
    - "linear kernels and single exponential algorithms via protrusion decompositions"

Connected through hyperedge HE-6 (induced by source paper "lower bounds for protrusion replacement by counting equivalence classes"):
  with members:
    - "lower bounds for dynamic programming on planar graphs of bounded cutwidth"
    - "the effect of planarization on width"
    - "explicit linear kernels for packing problems"
    - "vertex cover structural parameterization revisited"
    - "kernelization using structural parameters on sparse graph classes"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "hitting forbidden minors approximation and kernelization"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-7 (induced by source paper "editing to a planar graph of given degrees"):
  with members:
    - "graph editing problems with extended regularity constraints"
    - "win win kernelization for degree sequence completion problems"
    - "editing to eulerian graphs"
    - "a linear kernel for planar red blue dominating set"
    - "editing to a connected graph of given degrees"
    - "editing to a graph of given degrees"
    - "linear kernels and single exponential algorithms via protrusion decompositions"

Connected through hyperedge HE-8 (induced by source paper "separating an r outerplanar graph into gluable pieces"):
  with members:
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "on triangulating k outerplanar graphs"

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)