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: "subset feedback vertex set is fixed parameter tractable"
  Abstract: The classical Feedback Vertex Set problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback Vertex Set has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field. #R##N#In this paper we consider a more general and difficult version of the problem, named Subset Feedback Vertex Set (SUBSET-FVS in short) where an instance comes additionally with a set S ? V of vertices, and we ask for a set of at most k vertices that hits all simple cycles passing through S. Because of its applications in circuit testing and genetic linkage analysis SUBSET-FVS was studied from the approximation algorithms perspective by Even et al. [SICOMP'00, SIDMA'00]. #R##N#The question whether the SUBSET-FVS problem is fixed-parameter tractable was posed independently by Kawarabayashi and Saurabh in 2009. We answer this question affirmatively. We begin by showing that this problem is fixed-parameter tractable when parametrized by |S|. Next we present an algorithm which reduces the given instance to 2^k n^O(1) instances with the size of S bounded by O(k^3), using kernelization techniques such as the 2-Expansion Lemma, Menger's theorem and Gallai's theorem. These two facts allow us to give a 2^O(k log k) n^O(1) time algorithm solving the Subset Feedback Vertex Set problem, proving that it is indeed fixed-parameter tractable.

Connected through hyperedge HE-1 (induced by source paper "the computational complexity of finding temporal paths under waiting time constraints"):
  with members:
    - "an adaptive version of brandes algorithm for betweenness centrality"
    - "efficient computation of optimal temporal walks under waiting time constraints"
    - "how fast can we reach a target vertex in stochastic temporal graphs"
    - "temporal cliques admit sparse spanners"
    - "fixed parameter algorithms for maximum profit facility location under matroid constraints"
    - "the temporal explorer who returns to the base"
    - "changing times to minimise reachability in temporal graphs"
    - "deleting edges to restrict the size of an epidemic in temporal networks"

Connected through hyperedge HE-2 (induced by source paper "subset feedback vertex set in chordal and split graphs"):
  with members:
    - "exact algorithms via monotone local search"
    - "a randomized polynomial kernel for subset feedback vertex set"
    - "half integrality lp branching and fpt algorithms"
    - "directed subset feedback vertex set is fixed parameter tractable"
    - "hitting forbidden minors approximation and kernelization"

Connected through hyperedge HE-3 (induced by source paper "fpt algorithms for generalized feedback vertex set problems"):
  with members:
    - "detecting feedback vertex sets of size k in o star 2 7 k time"
    - "improved analysis of highest degree branching for feedback vertex set"
    - "smaller parameters for vertex cover kernelization"
    - "on feedback vertex set new measure and new structures"
    - "directed subset feedback vertex set is fixed parameter tractable"

Connected through hyperedge HE-4 (induced by source paper "an improved fpt algorithm for independent feedback vertex set"):
  with members:
    - "linear time kernelization for feedback vertex set"
    - "simultaneous feedback vertex set a parameterized perspective"
    - "on feedback vertex set new measure and new structures"
    - "half integrality lp branching and fpt algorithms"
    - "faster deterministic feedback vertex set"
    - "on group feedback vertex set parameterized by the size of the cutset"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "solving connectivity problems parameterized by treewidth in single exponential time"

Connected through hyperedge HE-5 (induced by source paper "subset feedback vertex set on graphs of bounded independent set size"):
  with members:
    - "subset feedback vertex set in chordal and split 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"
    - "a note on the complexity of feedback vertex set parameterized by mim width"
    - "exact algorithms via monotone local search"
    - "a randomized polynomial kernel for subset feedback vertex set"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "solving connectivity problems parameterized by treewidth in single exponential time"

Connected through hyperedge HE-6 (induced by source paper "polynomial time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs"):
  with members:
    - "exact algorithms via monotone local search"

Connected through hyperedge HE-7 (induced by source paper "lp branching algorithms based on biased graphs"):
  with members:
    - "the complexity landscape of decompositional parameters for ilp"
    - "on problems as hard as cnf sat"
    - "an approach to parameterized resiliency problems using integer linear programming"
    - "extension complexity mso logic and treewidth"
    - "parameterized integer quadratic programming variables and coefficients"
    - "a structural approach to kernels for ilps treewidth and total unimodularity"
    - "half integrality lp branching and fpt algorithms"
    - "designing fpt algorithms for cut problems using randomized contractions"

Connected through hyperedge HE-8 (induced by source paper "a polynomial kernel for block graph deletion"):
  with members:
    - "feedback vertex set inspired kernel for chordal vertex deletion"
    - "parameterized vertex deletion problems for hereditary graph classes with a block property"
    - "approximation and kernelization for chordal vertex deletion"
    - "a faster fpt algorithm and a smaller kernel for block graph vertex deletion"
    - "a polynomial kernel for block graph vertex deletion"
    - "on feedback vertex set new measure and new structures"
    - "chordal editing is fixed parameter tractable"
    - "faster deterministic feedback vertex set"

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.DS(Data Structures and Algorithms)