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 "iterated type partitions"):
  Abstract: This paper deals with the complexity of some natural graph problems when parametrized by {measures that are restrictions of} clique-width, such as modular-width and neighborhood diversity. The main contribution of this paper is to introduce a novel parameter, called iterated type partition, that can be computed in polynomial time and nicely places between modular-width and neighborhood diversity. We prove that the Equitable Coloring problem is W[1]-hard when parametrized by the iterated type partition. This result extends to modular-width, answering an open question about the possibility to have FPT algorithms for Equitable Coloring when parametrized by modular-width. Moreover, we show that the Equitable Coloring problem is instead FTP when parameterized by neighborhood diversity. Furthermore, we present simple and fast FPT algorithms parameterized by iterated type partition that provide optimal solutions for several graph problems; in particular, this paper presents algorithms for the Dominating Set, the Vertex Coloring and the Vertex Cover problems. While the above problems are already known to be FPT with respect to modular-width, the novel algorithms are both simpler and more efficient: For the Dominating set and Vertex Cover problems, our algorithms output an optimal set in time $O(2^t+poly(n))$, while for the Vertex Coloring problem, our algorithm outputs an optimal set in time $O(t^{2.5t+o(t)}\log n+poly(n))$, where $n$ and $t$ are the size and the iterated type partition of the input graph, respectively.

Includes members:
  Member "parameterized complexity of equitable coloring":
    also connected through other hyperedges:
      (none)
  Member "fully polynomial fpt algorithms for some classes of bounded clique width graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "b coloring parameterized by clique width")
  Member "target set selection in dense graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "solving target set selection with bounded thresholds faster than 2 n")
  Member "evangelism in social networks algorithms and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "time bounded influence diffusion with incentives")
  Member "partitioning graphs into induced subgraphs":
    also connected through other hyperedges:
      (none)
  Member "parameterized algorithms for modular width":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "independent set reconfiguration parameterized by modular width")
  Member "using neighborhood diversity to solve hard problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on adaptive algorithms for maximum matching")

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.CC(Computational Complexity)