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 "parametrised algorithms for directed modular width"):
  Abstract: Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width, Kelly-width and many others. While these focus on measuring how close a digraph is to an oriented tree resp. a directed acyclic graph, in this paper, we investigate directed modular width as a parameter, which is closer to the concept of clique-width. We investigate applications of modular decompositions of directed graphs to a wide range of algorithmic problems and derive FPT-algorithms for several well-known digraph-specific NP-hard problems, namely minimum (weight) directed feedback vertex set, minimum (weight) directed dominating set, digraph colouring, directed Hamiltonian path/cycle, partitioning into paths, (capacitated) vertex-disjoint directed paths, and the directed subgraph homeomorphism problem. The latter yields a polynomial-time algorithm for detecting topological minors in digraphs of bounded directed modular width. Finally we illustrate that also other structural digraph parameters, such as the directed pathwidth and the cycle-rank can be computed efficiently using directed modular width as a parameter.

Includes members:
  Member "on directed feedback vertex set parameterized by treewidth":
    also connected through other hyperedges:
      (none)
  Member "an algorithmic metatheorem for directed treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "width parameterizations for knot free vertex deletion on digraphs")
  Member "the directed grid theorem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hitting long directed cycles is fixed parameter tractable")
  Member "parameterized algorithms for modular width":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "iterated type partitions")
  Member "the planar directed k vertex disjoint paths problem is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a relaxation of the directed disjoint paths problem a global congestion metric helps")
  Member "finding an induced subdivision of a digraph":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "three in a tree in near linear time")
  Member "finding topological subgraphs is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hitting topological minors is fpt")

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.DM(Discrete Mathematics)