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: "faster algorithms for vertex partitioning problems parameterized by clique width"
  Abstract: Abstract   Many  NP -hard problems, such as  Dominating Set , are  FPT  parameterized by clique-width. For graphs of clique-width k given with a k-expression,  Dominating Set  can be solved in      4    k      n    O  (  1  )      time. However, no  FPT  algorithm is known for computing an optimal k-expression. For a graph of clique-width k, if we rely on known algorithms to compute a    (    2    3  k    −  1  )   -expression via rank-width and then solving  Dominating Set  using the    (    2    3  k    −  1  )   -expression, the above algorithm will only give a runtime of      4      2    3  k        n    O  (  1  )     . There have been results which overcome this exponential jump; the best known algorithm can solve  Dominating Set  in time      2    O  (    k    2    )      n    O  (  1  )      by avoiding constructing a k-expression Bui-Xuan et al. (2013)  [7] . We improve this to      2    O  (  k  log    k  )      n    O  (  1  )     . Indeed, we show that for a graph of clique-width k, a large class of domination and partitioning problems (LC-VSP), including  Dominating Set , can be solved in      2    O  (  k  log    k  )      n    O  (  1  )     .  Our main tool is a variant of rank-width using the rank of a 0–1 matrix over the rational field instead of the binary field.

Connected through hyperedge HE-1 (induced by source paper "node multiway cut and subset feedback vertex set on graphs of bounded mim width"):
  with members:
    - "subset feedback vertex set on graphs of bounded independent set size"
    - "rank based approach on graphs with structured neighborhood"
    - "fast exact algorithms for some connectivity problems parametrized by clique width"
    - "on the tractability of optimization problems on h graphs"
    - "polynomial time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs"
    - "a unified polynomial time algorithm for feedback vertex set on graphs of bounded mim width"
    - "exact algorithms via monotone local search"
    - "a randomized polynomial kernel for subset feedback vertex set"

Connected through hyperedge HE-2 (induced by source paper "a meta algorithm for solving connectivity and acyclicity constraints on locally checkable properties parameterized by graph width measures"):
  with members:
    - "node multiway cut and subset feedback vertex set on graphs of bounded mim width"
    - "computing the largest bond of a graph"
    - "fast exact algorithms for some connectivity problems parametrized by clique width"
    - "a unified polynomial time algorithm for feedback vertex set on graphs of bounded mim width"
    - "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms"
    - "polynomial time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim width"
    - "on distance d independent set and other problems in graphs with few minimal separators"
    - "output polynomial enumeration on graphs of bounded local linear mim width"

Connected through hyperedge HE-3 (induced by source paper "structural parameters tight bounds and approximation for k r center"):
  with members:
    - "parameterized power vertex cover"
    - "parameterized approximation algorithms for some location problems in graphs"
    - "fixed parameter approximations for k center problems in low highway dimension graphs"
    - "optimal dynamic program for r domination problems over tree decompositions"
    - "parameterized edge hamiltonicity"
    - "parameterized approximation schemes using graph widths"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-4 (induced by source paper "fast exact algorithms for some connectivity problems parametrized by clique width"):
  with members:
    - "rank based approach on graphs with structured neighborhood"

Connected through hyperedge HE-5 (induced by source paper "linear recognition of almost interval graphs"):
  with members:
    - "a faster algorithm to recognize even hole free graphs"
    - "forbidden induced subgraphs of normal helly circular arc graphs characterization and detection"
    - "chordal editing is fixed parameter tractable"
    - "a subexponential parameterized algorithm for interval completion"
    - "normal helly circular arc graphs and its subclasses"
    - "exploring subexponential parameterized complexity of completion problems"
    - "interval deletion is fixed parameter tractable"
    - "polynomial kernels for 3 leaf power graph modification problems"

Connected through hyperedge HE-6 (induced by source paper "solving hamiltonian cycle by an ept algorithm for a non sparse parameter"):
  with members:
    - "parameterized algorithms for modular width"
    - "efficient computation of representative sets with applications in parameterized and exact algorithms"
    - "solving connectivity problems parameterized by treewidth in single exponential time"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

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