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: "interdiction problems on planar graphs"
  Abstract: Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We introduce approximation algorithms and strong NP-completeness results for interdiction problems on planar graphs. We give a multiplicative $(1 + \epsilon)$-approximation for the maximum matching interdiction problem on weighted planar graphs. The algorithm runs in pseudo-polynomial time for each fixed $\epsilon > 0$. We also show that weighted maximum matching interdiction, budget-constrained flow improvement, directed shortest path interdiction, and minimum perfect matching interdiction are strongly NP-complete on planar graphs. To our knowledge, our budget-constrained flow improvement result is the first planar NP-completeness proof that uses a one-vertex crossing gadget.

Connected through hyperedge HE-1 (induced by source paper "a more fine grained complexity analysis of finding the most vital edges for undirected shortest paths"):
  with members:
    - "fractals for kernelization lower bounds"
    - "parameterized approximability of maximizing the spread of influence in networks"
    - "parameterized complexity of edge interdiction problems"

Connected through hyperedge HE-2 (induced by source paper "the complexity of finding small separators in temporal graphs"):
  with members:
    - "temporal vertex cover with a sliding time window"
    - "sliding window temporal graph coloring"
    - "listing all maximal k plexes in temporal graphs"
    - "cluster editing for multi layer and temporal graphs"
    - "stream graphs and link streams for the modeling of interactions over time"
    - "on the size and the approximability of minimum temporally connected subgraphs"
    - "adapting the bron kerbosch algorithm for enumerating maximal cliques in temporal graphs"
    - "survivability in time varying networks"

Connected through hyperedge HE-3 (induced by source paper "improved hardness for cut interdiction and firefighter problems"):
  with members:
    - "new integrality gap results for the firefighters problem on trees"
    - "firefighting on trees beyond integrality gaps"
    - "fractals for kernelization lower bounds"
    - "local distribution and the symmetry gap approximability of multiway partitioning problems"
    - "hardness of vertex deletion and project scheduling"

Connected through hyperedge HE-4 (induced by source paper "fractals for kernelization lower bounds"):
  with members:
    - "the parameterized complexity of the minimum shared edges problem"
    - "two page book embeddings of 4 planar graphs"
    - "kernelization lower bounds by cross composition"
    - "clique cover and graph separation new incompressibility results"

Connected through hyperedge HE-5 (induced by source paper "fractals for kernelization lower bounds with an application to length bounded cut problems"):
  with members:
    - "two page book embeddings of 4 planar graphs"
    - "kernelization lower bounds by cross composition"

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)