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 integer quadratic programming variables and coefficients"
  Abstract: In the Integer Quadratic Programming problem input is an n*n integer matrix Q, an m*n integer matrix A and an m-dimensional integer vector b. The task is to find a vector x in Z^n, nminimizing x^TQx, subject to Ax <= b. We give a fixed parameter tractable algorithm for Integer Quadratic Programming parameterized by n+a, assuming that an optimal solution to the input instance exists. Here a is the largest absolute value of an entry of Q and A. As an application of our main result we show that Optimal Linear Arrangement is fixed parameter tractable parameterized by the size of the smallest vertex cover of the input graph. This resolves an open problem from the recent monograph by Downey and Fellows.

Connected through hyperedge HE-1 (induced by source paper "exact crossing number parameterized by vertex cover"):
  with members:
    - "crossing minimization in perturbed drawings"
    - "approximating the rectilinear crossing number"
    - "crossing number for graphs with bounded pathwidth"
    - "adding one edge to planar graphs makes crossing number and 1 planarity hard"
    - "hardness of approximation for crossing number"
    - "an algorithm for the graph crossing number problem"
    - "computing crossing numbers in quadratic time"

Connected through hyperedge HE-2 (induced by source paper "stable marriage with groups of similar agents"):
  with members:
    - "on treewidth and stable marriage"
    - "balanced stable marriage how close is close enough"
    - "stable marriage with covering constraints a complete computational trichotomy"
    - "the complexity of approximately counting stable roommate assignments"
    - "the complexity of approximately counting stable matchings"
    - "complexity of coalition structure generation"

Connected through hyperedge HE-3 (induced by source paper "the parameterised complexity of computing the maximum modularity of a graph"):
  with members:
    - "additive approximation algorithms for modularity maximization"
    - "network clustering via maximizing modularity approximation algorithms and theoretical limits"

Connected through hyperedge HE-4 (induced by source paper "combinatorial n fold integer programming and applications"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "on integer programming and convolution"
    - "scheduling meets n fold integer programming"
    - "the complexity landscape of decompositional parameters for ilp"
    - "proximity results and faster algorithms for integer programming using the steinitz lemma"
    - "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity"
    - "voting and bribing in single exponential time"
    - "about the structure of the integer cone and its application to bin packing"

Connected through hyperedge HE-5 (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"
    - "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"
    - "faster parameterized algorithms using linear programming"

Connected through hyperedge HE-6 (induced by source paper "parameterized resiliency problems via integer linear programming"):
  with members:
    - "combinatorial n fold integer programming and applications"
    - "a multivariate approach for checking resiliency in access control"
    - "an approach to parameterized resiliency problems using integer linear programming"
    - "the online disjoint set cover problem and its applications"
    - "polynomial kernels for weighted problems"
    - "a structural approach to kernels for ilps treewidth and total unimodularity"
    - "the parameterized complexity of reasoning problems beyond np"
    - "a quasi polynomial time partition oracle for graphs with an excluded minor"

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)