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 parameterized algorithms using linear programming"
  Abstract: We investigate the parameterized complexity of Vertex Cover parameterized by the difference between the size of the optimal solution and the value of the linear programming (LP) relaxation of the problem. By carefully analyzing the change in the LP value in the branching steps, we argue that combining previously known preprocessing rules with the most straightforward branching algorithm yields an $O^*((2.618)^k)$ algorithm for the problem. Here $k$ is the excess of the vertex cover size over the LP optimum, and we write $O^*(f(k))$ for a time complexity of the form $O(f(k)n^{O(1)})$, where $f (k)$ grows exponentially with $k$. We proceed to show that a more sophisticated branching algorithm achieves a runtime of $O^*(2.3146^k)$. #R##N#Following this, using known and new reductions, we give $O^*(2.3146^k)$ algorithms for the parameterized versions of Above Guarantee Vertex Cover, Odd Cycle Transversal, Split Vertex Deletion and Almost 2-SAT, and an $O^*(1.5214^k)$ algorithm for Ko\"nig Vertex Deletion, Vertex Cover Param by OCT and Vertex Cover Param by KVD. These algorithms significantly improve the best known bounds for these problems. The most notable improvement is the new bound for Odd Cycle Transversal - this is the first algorithm which beats the dependence on $k$ of the seminal $O^*(3^k)$ algorithm of Reed, Smith and Vetta. Finally, using our algorithm, we obtain a kernel for the standard parameterization of Vertex Cover with at most $2k - c \log k$ vertices. Our kernel is simpler than previously known kernels achieving the same size bound.

Connected through hyperedge HE-1 (induced by source paper "structural parameterizations with modulator oblivion"):
  with members:
    - "polylogarithmic approximation algorithms for weighted mathcal f deletion problems"
    - "0 1 all csps half integral a path packing and linear time fpt algorithms"
    - "approximation and kernelization for chordal vertex deletion"
    - "on problems as hard as cnf sat"
    - "large induced subgraphs via triangulations and cmso"
    - "on multiway cut parameterized above lower bounds"

Connected through hyperedge HE-2 (induced by source paper "graph profiling for vertex cover targeted reductions in a branch and reduce solver"):
  with members:
    - "scalable kernelization for maximum independent sets"
    - "on the power of simple reductions for the maximum independent set problem"
    - "linear time fpt algorithms via network flow"

Connected through hyperedge HE-3 (induced by source paper "domination above r independence does sparseness help"):
  with members:
    - "neighborhood complexity and kernelization for nowhere dense classes of graphs"
    - "kernelization and sparseness the case of dominating set"
    - "testing first order properties for subclasses of sparse graphs"
    - "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables"
    - "vertex cover problem parameterized above and below tight bounds"
    - "solving max r sat above a tight lower bound"
    - "linear time algorithms for finding a dominating set of fixed size in degenerated graphs"
    - "polynomial time data reduction for dominating set"

Connected through hyperedge HE-4 (induced by source paper "on kernelization for edge dominating set under structural parameters"):
  with members:
    - "a randomized polynomial kernelization for vertex cover with a smaller parameter"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "polynomial delay algorithm for listing minimal edge dominating sets in graphs"
    - "kernelization lower bounds by cross composition"
    - "kernelization of packing problems"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "on multiway cut parameterized above lower bounds"
    - "vertex cover kernelization revisited upper and lower bounds for a refined parameter"

Connected through hyperedge HE-5 (induced by source paper "going far from degeneracy"):
  with members:
    - "faster deterministic parameterized algorithm for k path"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "a randomized algorithm for long directed cycle"
    - "polynomial kernels for lambda extendible properties parameterized above the poljak turz ik bound"
    - "narrow sieves for parameterized paths and packings"
    - "vertex cover problem parameterized above and below tight bounds"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-6 (induced by source paper "approximation algorithms for partially colorable graphs"):
  with members:
    - "a new algorithm for the robust semi random independent set problem"
    - "does robustness imply tractability a lower bound for planted clique in the semi random model"
    - "on the effect of randomness on planted 3 coloring models"
    - "combinatorial coloring of 3 colorable graphs"
    - "rounding semidefinite programming hierarchies via global correlation"
    - "approximate graph coloring by semidefinite programming"

Connected through hyperedge HE-7 (induced by source paper "cluster editing parameterized above the size of a modification disjoint p 3 packing is para np hard"):
  with members:
    - "parameterizing edge modification problems above lower bounds"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "subexponential fixed parameter tractability of cluster editing"
    - "on multiway cut parameterized above lower bounds"

Connected through hyperedge HE-8 (induced by source paper "parameterizing edge modification problems above lower bounds"):
  with members:
    - "parameterized lower bounds and dichotomy results for the np completeness of h free edge modification problems"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "towards optimal and expressive kernelization for d hitting set"
    - "subexponential parameterized algorithm for computing the cutwidth of a semi complete digraph"
    - "subexponential fixed parameter tractability of cluster editing"
    - "on multiway cut parameterized above lower bounds"
    - "on the non existence of polynomial kernels for p l free edge modification problems"
    - "faster algorithms for feedback arc set tournament kemeny rank aggregation and betweenness tournament"

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)