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: "drawing k linear metro maps"
  Abstract: Schematic metro maps in practice as well as metro map layout algorithms usually adhere to an octilinear layout style with all paths composed of horizontal, vertical, and 45$^\circ$-diagonal edges. Despite growing interest in non-octilinear metro maps, generic algorithms to draw metro maps based on a system of $k \ge 2$ equidistant slopes have not been investigated thoroughly. In this paper we present and implement an adaptation of the octilinear mixed-integer linear programming approach of Nollenburg and Wolff (2011) that can draw k-linear metro maps.

Connected through hyperedge HE-1 (induced by source paper "level planar drawings with few slopes"):
  with members:
    - "experimental analysis of the accessibility of drawings with few segments"
    - "simultaneous orthogonal planarity"
    - "beyond level planarity"
    - "outerplanar graph drawings with few slopes"
    - "simultaneous embedding of planar graphs"
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"

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)