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 "parameterized algorithms for graph partitioning problems"):
  Abstract: We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\subseteq V$ of size $k$, such that $\alpha_1m_1 + \alpha_2m_2$ is at most (or at least) $p$, where $\alpha_1,\alpha_2\in\mathbb{R}$ are constants defining the problem, and $m_1, m_2$ are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in $U$, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max $(k,n-k)$-Cut, Min $k$-Vertex Cover, $k$-Densest Subgraph, and $k$-Sparsest Subgraph. #R##N#Our main result is an $O^*(4^{k+o(k)}\Delta^k)$ algorithm for any problem in this class, where $\Delta \geq 1$ is the maximum degree in the input graph. This resolves an open question posed by Bonnet et al. [IPEC 2013]. We obtain faster algorithms for certain subclasses of FGPPs, parameterized by $p$, or by $(k+p)$. In particular, we give an $O^*(4^{p+o(p)})$ time algorithm for Max $(k,n-k)$-Cut, thus improving significantly the best known $O^*(p^p)$ time algorithm.

Includes members:
  Member "representative sets of product families":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hitting long directed cycles is fixed parameter tractable")
  Member "faster computation of representative families for uniform matroids with applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "np completeness of the negative k cycle problem")
  Member "representative families a unified tradeoff based approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hitting long directed cycles is fixed parameter tractable")
  Member "multi parameter complexity analysis for constrained size graph problems using greediness for parameterization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparsification and subexponential approximation")
  Member "deterministic parameterized algorithms for matching and packing problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mixing color coding related techniques")
  Member "minimum bisection is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fixed parameter tractability of counting small minimum s t cuts")
  Member "designing fpt algorithms for cut problems using randomized contractions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "grundy coloring friends half graphs bicliques")

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)