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: "deleting vertices to graphs of bounded genus"
  Abstract: We show that a problem of deleting a minimum number of vertices from a graph to obtain a graph embeddable on a surface of a given Euler genus is solvable in time $2^{C_g \cdot k^2 \log k} n^{O(1)}$, where $k$ is the size of the deletion set, $C_g$ is a constant depending on the Euler genus $g$ of the target surface, and $n$ is the size of the input graph. On the way to this result, we develop an algorithm solving the problem in question in time $2^{O((t+g) \log (t+g))} n$, given a tree decomposition of the input graph of width $t$. The results generalize previous algorithms for the surface being a sphere by Marx and Schlotter [Algorithmica 2012], Kawarabayashi [FOCS 2009], and Jansen, Lokshtanov, and Saurabh [SODA 2014].

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"
    - "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"
    - "bidimensionality and kernels"

Connected through hyperedge HE-2 (induced by source paper "subexponential time algorithms for finding large induced sparse subgraphs"):
  with members:
    - "polynomial time algorithm for maximum weight independent set on p_6 free graphs"
    - "exact algorithms via monotone local search"
    - "tight running time lower bounds for vertex deletion problems"
    - "hitting forbidden subgraphs in graphs of bounded treewidth"
    - "large induced subgraphs via triangulations and cmso"
    - "largest chordal and interval subgraphs faster than 2 n"
    - "finding a maximum induced degenerate subgraph faster than 2 n"
    - "problems parameterized by treewidth tractable in single exponential time a logical approach"

Connected through hyperedge HE-3 (induced by source paper "fine grained complexity of graph homomorphism problem for bounded treewidth graphs"):
  with members:
    - "tight lower bounds on graph embedding problems"
    - "problems parameterized by treewidth tractable in single exponential time a logical approach"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-4 (induced by source paper "optimal algorithms for hitting topological minors on graphs of bounded treewidth"):
  with members:
    - "slightly superexponential parameterized problems"
    - "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"
    - "explicit linear kernels via dynamic programming"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "solving connectivity problems parameterized by treewidth in single exponential time"

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)