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: "bidimensionality and geometric graphs"
  Abstract: In this paper we use several of the key ideas from Bidimensionality to give a new generic approach to design EPTASs and subexponential time parameterized algorithms for problems on classes of graphs which are not minor closed, but instead exhibit a geometric structure. In particular we present EPTASs and subexponential time parameterized algorithms for Feedback Vertex Set, Vertex Cover, Connected Vertex Cover, Diamond Hitting Set, on map graphs and unit disk graphs, and for Cycle Packing and Minimum-Vertex Feedback Edge Set on unit disk graphs. Our results are based on the recent decomposition theorems proved by Fomin et al [SODA 2011], and our algorithms work directly on the input graph. Thus it is not necessary to compute the geometric representations of the input graph. To the best of our knowledge, these results are previously unknown, with the exception of the EPTAS and a subexponential time parameterized algorithm on unit disk graphs for Vertex Cover, which were obtained by Marx [ESA 2005] and Alber and Fiala [J. Algorithms 2004], respectively. #R##N#We proceed to show that our approach can not be extended in its full generality to more general classes of geometric graphs, such as intersection graphs of unit balls in R^d, d >= 3. Specifically we prove that Feedback Vertex Set on unit-ball graphs in R^3 neither admits PTASs unless P=NP, nor subexponential time algorithms unless the Exponential Time Hypothesis fails. Additionally, we show that the decomposition theorems which our approach is based on fail for disk graphs and that therefore any extension of our results to disk graphs would require new algorithmic ideas. On the other hand, we prove that our EPTASs and subexponential time algorithms for Vertex Cover and Connected Vertex Cover carry over both to disk graphs and to unit-ball graphs in R^d for every fixed d.

Connected through hyperedge HE-1 (induced by source paper "planar graphs have bounded queue number"):
  with members:
    - "shorter labeling schemes for planar graphs"
    - "planar graphs of bounded degree have constant queue number"
    - "polynomial bounds for centered colorings on proper minor closed graph classes"
    - "queue layouts of planar 3 trees"
    - "layouts for plane graphs on constant number of tracks"
    - "an annotated bibliography on 1 planarity"
    - "stack and queue layouts via layered separators"
    - "on the queue number of graphs with bounded tree width"

Connected through hyperedge HE-2 (induced by source paper "map graphs having witnesses of large girth"):
  with members:
    - "recognizing optimal 1 planar graphs in linear time"
    - "hardness and structural results for half squares of restricted tree convex bipartite graphs"
    - "nic planar graphs"

Connected through hyperedge HE-3 (induced by source paper "decomposition of map graphs with applications"):
  with members:
    - "optimal algorithms for hitting topological minors on graphs of bounded treewidth"
    - "finding hitting and packing cycles in subexponential time on unit disk graphs"
    - "solving connectivity problems parameterized by treewidth in single exponential time"

Connected through hyperedge HE-4 (induced by source paper "a framework for eth tight algorithms and lower bounds in geometric intersection graphs"):
  with members:
    - "the dominating set problem in geometric intersection graphs"
    - "finding hitting and packing cycles in subexponential time on unit disk graphs"
    - "the limited blessing of low dimensionality when 1 1 d is the best possible exponent for d dimensional geometric problems"
    - "approximation algorithms for polynomial expansion and low density graphs"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"

Connected through hyperedge HE-5 (induced by source paper "hardness and structural results for half squares of restricted tree convex bipartite graphs"):
  with members:
    - "on the complete width and edge clique cover problems"
    - "on 4 map graphs and 1 planar graphs and their recognition problem"

Connected through hyperedge HE-6 (induced by source paper "optimality program in segment and string graphs"):
  with members:
    - "planar graphs as l intersection or l contact graphs"
    - "finding hitting and packing cycles in subexponential time on unit disk graphs"
    - "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms"
    - "approximation schemes for independent set and sparse subsets of polygons"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "intersection graphs of segments and exists mathbb r"
    - "quasi polynomial time approximation scheme for sparse subsets of polygons"
    - "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices"

Connected through hyperedge HE-7 (induced by source paper "finding hitting and packing cycles in subexponential time on unit disk graphs"):
  with members:
    - "subexponential parameterized algorithms for planar and apex minor free graphs via low treewidth pattern covering"
    - "bidimensionality and kernels"
    - "approximation algorithms for polynomial expansion and low density graphs"
    - "mixing color coding related techniques"
    - "narrow sieves for parameterized paths and packings"
    - "bidimensionality and eptas"
    - "minimum clique partition in unit disk graphs"
    - "improved approximation algorithms for geometric set cover"

Connected through hyperedge HE-8 (induced by source paper "polylogarithmic approximation algorithms for weighted mathcal f deletion problems"):
  with members:
    - "feedback vertex set inspired kernel for chordal vertex deletion"
    - "approximation and kernelization for chordal vertex deletion"
    - "bidimensionality and kernels"
    - "lp based robust algorithms for noisy minor free and bounded treewidth graphs"
    - "hitting forbidden minors approximation and kernelization"
    - "bidimensionality and eptas"
    - "hitting diamonds and growing cacti"

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)