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: "interval deletion is fixed parameter tractable"
  Abstract: We study the minimum \emph{interval deletion} problem, which asks for the removal of a set of at most $k$ vertices to make a graph of $n$ vertices into an interval graph. We present a parameterized algorithm of runtime $10^k \cdot n^{O(1)}$ for this problem, that is, we show the problem is fixed-parameter tractable.

Connected through hyperedge HE-1 (induced by source paper "hitting topological minors is fpt"):
  with members:
    - "hitting topological minor models in planar graphs is fixed parameter tractable"
    - "improved analysis of highest degree branching for feedback vertex set"
    - "losing treewidth by separating subsets"
    - "a 2 approximation algorithm for feedback vertex set in tournaments"
    - "polylogarithmic approximation for minimum planarization almost"
    - "exact algorithms for maximum independent set"
    - "bidimensionality and kernels"
    - "exact algorithms via monotone local search"

Connected through hyperedge HE-2 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs"):
  with members:
    - "a complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary"
    - "feedback vertex set inspired kernel for chordal vertex deletion"
    - "approximation and kernelization for chordal vertex deletion"
    - "polynomial kernels for weighted problems"
    - "linear recognition of almost interval graphs"
    - "large induced subgraphs via triangulations and cmso"
    - "data reduction for graph coloring problems"
    - "kernelization lower bounds by cross composition"

Connected through hyperedge HE-3 (induced by source paper "structural parameterization for graph deletion problems over data streams"):
  with members:
    - "on the streaming complexity of fundamental geometric problems"
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "faster deterministic feedback vertex set"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "preprocessing subgraph and minor problems when does a small vertex cover help"
    - "hitting forbidden minors approximation and kernelization"

Connected through hyperedge HE-4 (induced by source paper "feedback vertex set inspired kernel for chordal vertex deletion"):
  with members:
    - "polylogarithmic approximation algorithms for weighted mathcal f deletion problems"
    - "turing kernelization for finding long paths and cycles in restricted graph classes"
    - "approximation and kernelization for chordal vertex deletion"
    - "bidimensionality and kernels"
    - "unit interval vertex deletion fewer vertices are relevant"
    - "uniform kernelization complexity of hitting forbidden minors"
    - "linear recognition of almost interval graphs"
    - "chordal editing is fixed parameter tractable"

Connected through hyperedge HE-5 (induced by source paper "vertex deletion problems on chordal graphs"):
  with members:
    - "approximation and kernelization for chordal vertex deletion"
    - "faster online matrix vector multiplication"
    - "exact algorithms via monotone local search"
    - "approximate association via dissociation"
    - "unit interval editing is fixed parameter tractable"
    - "linear recognition of almost interval graphs"
    - "chordal editing is fixed parameter tractable"
    - "large induced subgraphs via triangulations and cmso"

Connected through hyperedge HE-6 (induced by source paper "an fpt algorithm and a polynomial kernel for linear rankwidth 1 vertex deletion"):
  with members:
    - "further kernelization of proper interval vertex deletion new observations and refined analysis"
    - "a single exponential fixed parameter algorithm for distance hereditary vertex deletion"
    - "constructive algorithm for path width of matroids"
    - "unit interval editing is fixed parameter tractable"
    - "a note on graphs of linear rank width 1"
    - "a polynomial kernel for proper interval vertex deletion"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "a quartic kernel for pathwidth one vertex deletion"

Connected through hyperedge HE-7 (induced by source paper "simultaneous feedback vertex set a parameterized perspective"):
  with members:
    - "a note on finding dual feedback vertex set"
    - "tight running time lower bounds for vertex deletion problems"
    - "faster deterministic feedback vertex set"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "faster parameterized algorithms using linear programming"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "solving connectivity problems parameterized by treewidth in single exponential time"
    - "obtaining a planar graph by vertex deletion"

Connected through hyperedge HE-8 (induced by source paper "linear recognition of almost interval graphs"):
  with members:
    - "a faster algorithm to recognize even hole free graphs"
    - "faster algorithms for vertex partitioning problems parameterized by clique width"
    - "forbidden induced subgraphs of normal helly circular arc graphs characterization and detection"
    - "chordal editing is fixed parameter tractable"
    - "a subexponential parameterized algorithm for interval completion"
    - "normal helly circular arc graphs and its subclasses"
    - "exploring subexponential parameterized complexity of completion problems"
    - "polynomial kernels for 3 leaf power graph modification problems"

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)