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 "efficient and adaptive parameterized algorithms on modular decompositions"):
  Abstract: We study the influence of a graph parameter called modular-width on the time complexity for optimally solving well-known polynomial problems such as Maximum Matching, Triangle Counting, and Maximum $s$-$t$ Vertex-Capacitated Flow. The modular-width of a graph depends on its (unique) modular decomposition tree, and can be computed in linear time $O(n+m)$ for graphs with $n$ vertices and $m$ edges. Modular decompositions are an important tool for graph algorithms, e.g., for linear-time recognition of certain graph classes. Throughout, we obtain efficient parameterized algorithms of running times $O(f(mw)n+m)$, $O(n+f(mw)m)$ , or $O(f(mw)+n+m)$ for graphs of modular-width $mw$. Our algorithm for Maximum Matching, running in time $O(mw^2\log mw \cdot n+m)$, is both faster and simpler than the recent $O(mw^4n+m)$ time algorithm of Coudert et al. (SODA 2018). For several other problems, e.g., Triangle Counting and Maximum $b$-Matching, we give adaptive algorithms, meaning that their running times match the best unparameterized algorithms for worst-case modular-width of $mw=\Theta(n)$ and they outperform them already for $mw=o(n)$, until reaching linear time for $mw=O(1)$.

Includes members:
  Member "parameterized aspects of triangle enumeration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on adaptive algorithms for maximum matching")
  Member "fully polynomial fpt algorithms for some classes of bounded clique width graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "iterated type partitions")
  Member "on the power of tree depth for fully polynomial fpt algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on adaptive algorithms for maximum matching")
  Member "when can graph hyperbolicity be computed in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast approximation and exact computation of negative curvature parameters of graphs")
  Member "the power of data reduction for matching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fully polynomial fpt algorithms for some classes of bounded clique width graphs")
  Member "data structures for weighted matching and extensions to b matching and f factors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a scaling algorithm for weighted f factors in general graphs")
  Member "quadratic conditional lower bounds for string problems and dynamic time warping":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "polynomial fixed parameter algorithms a case study for longest path on interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "computing maximum matchings in temporal graphs")

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)