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: "parameterized complexity of secluded connectivity problems"
  Abstract: The Secluded Path problem models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure, which is the total weight of vertices in its closed neighborhood. In order to minimize the risk of intercepting the information, we are interested in selecting a secluded path, i.e. a path with a small exposure. Similarly, the Secluded Steiner Tree problem is to find a tree in a graph connecting a given set of terminals such that the exposure of the tree is minimized. The problems were introduced by Chechik et al. in [ESA 2013]. Among other results, Chechik et al. have shown that Secluded Path is fixed-parameter tractable (FPT) on unweighted graphs being parameterized by the maximum vertex degree of the graph and that Secluded Steiner Tree is FPT parameterized by the treewidth of the graph. In this work, we obtain the following results about parameterized complexity of secluded connectivity problems. #R##N#We give FPT-algorithms deciding if a graph G with a given cost function contains a secluded path and a secluded Steiner tree of exposure at most k with the cost at most C. #R##N#We initiate the study of "above guarantee" parameterizations for secluded problems, where the lower bound is given by the size of a Steiner tree. #R##N#We investigate Secluded Steiner Tree from kernelization perspective and provide several lower and upper bounds when parameters are the treewidth, the size of a vertex cover, maximum vertex degree and the solution size. Finally, we refine the algorithmic result of Chechik et al. by improving the exponential dependence from the treewidth of the input graph.

Connected through hyperedge HE-1 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem"):
  with members:
    - "on the computational complexity of length and neighborhood constrained path problems"
    - "the parameterized complexity of finding secluded solutions to some classical optimization problems on graphs"
    - "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments"
    - "finding connected secluded subgraphs"
    - "polynomial kernels for weighted problems"
    - "route planning in transportation networks"
    - "parameterized complexity of the k arc chinese postman problem"
    - "parameterized complexity of k chinese postman problem"

Connected through hyperedge HE-2 (induced by source paper "enumerating isolated cliques in temporal networks"):
  with members:
    - "community discovery in dynamic networks a survey"
    - "listing all maximal k plexes in temporal graphs"
    - "the parameterized complexity of finding secluded solutions to some classical optimization problems on graphs"
    - "enumerating maximal cliques in link streams with durations"
    - "stream graphs and link streams for the modeling of interactions over time"
    - "adapting the bron kerbosch algorithm for enumerating maximal cliques in temporal graphs"
    - "an introduction to temporal graphs an algorithmic perspective"
    - "computing maximal cliques in link streams"

Connected through hyperedge HE-3 (induced by source paper "geometric secluded paths and planar satisfiability"):
  with members:
    - "on the computational complexity of length and neighborhood constrained path problems"
    - "an efficient algorithm for computing high quality paths amid polygonal obstacles"
    - "on the complexity of minimum link path problems"
    - "quickest visibility queries in polygonal domains"
    - "planar 3 sat with a clause variable cycle"
    - "a polynomial time algorithm for finding an approximate shortest path amid weighted regions"
    - "a note on the unsolvability of the weighted region shortest path problem"
    - "minimum link paths revisited"

Connected through hyperedge HE-4 (induced by source paper "the parameterized complexity of finding secluded solutions to some classical optimization problems on graphs"):
  with members:
    - "finding secluded places of special interest in graphs"
    - "a shortcut to sun flowers kernels in logarithmic space or linear time"
    - "towards optimal and expressive kernelization for d hitting set"
    - "on the parameterized complexity of cutting a few vertices from a graph"
    - "secluded connectivity problems"
    - "approximation and tidying a problem kernel for s plex cluster vertex deletion"
    - "finding small separators in linear time via treewidth reduction"

Connected through hyperedge HE-5 (induced by source paper "on the computational complexity of length and neighborhood constrained path problems"):
  with members:
    - "hardness results and approximation algorithms for the minimum dominating tree problem"
    - "the parameterized complexity of finding secluded solutions to some classical optimization problems on graphs"
    - "finding connected secluded subgraphs"
    - "kernelization lower bounds by cross composition"
    - "secluded connectivity problems"

Connected through hyperedge HE-6 (induced by source paper "finding secluded places of special interest in graphs"):
  with members:
    - "towards optimal and expressive kernelization for d hitting set"
    - "on the parameterized complexity of cutting a few vertices from a graph"
    - "secluded connectivity problems"
    - "approximation and tidying a problem kernel for s plex cluster vertex deletion"
    - "finding small separators in linear time via treewidth reduction"

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)