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: "the parameterized complexity of some geometric problems in unbounded dimension"
  Abstract: We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d:#R##N##R##N#i) Given n points in ? d , compute their minimum enclosing cylinder.#R##N##R##N#ii) Given two n-point sets in ? d , decide whether they can be separated by two hyperplanes.#R##N##R##N#iii) Given a system of n linear inequalities with d variables, find a maximum size feasible subsystem.#R##N##R##N#We show that (the decision versions of) all these problems are W[1]-hard when parameterized by the dimension d. Our reductions also give a n ?(d)-time lower bound (under the Exponential Time Hypothesis).

Connected through hyperedge HE-1 (induced by source paper "robust fitting in computer vision easy or hard"):
  with members:
    - "deterministic consensus maximization with biconvex programming"
    - "maximum consensus parameter estimation by reweighted ell_1 methods"
    - "globally optimal inlier set maximisation for simultaneous camera pose and feature correspondence"

Connected through hyperedge HE-2 (induced by source paper "the limited blessing of low dimensionality when 1 1 d is the best possible exponent for d dimensional geometric problems"):
  with members:
    - "constraint solving via fractional edge covers"
    - "fixed parameter tractability and lower bounds for stabbing problems"
    - "hypertree decompositions and tractable queries"

Connected through hyperedge HE-3 (induced by source paper "fixed parameter complexity and approximability of norm maximization"):
  with members:
    - "fixed parameter tractability and lower bounds for stabbing problems"

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.CG(Computational Geometry)