human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "planar graphs of bounded degree have constant queue number"):
  Abstract: A queue layout of a graph consists of a linear order of its vertices and a partition of its edges into queues, so that no two independent edges of the same queue are nested. The queue number of a graph is the minimum number of queues required by any of its queue layouts. A long-standing conjecture by Heath, Leighton and Rosenberg states that the queue number of planar graphs is constant. This conjecture has been partially settled in the positive for several subfamilies of planar graphs (most of which have bounded treewidth). In this paper, we make a further important step towards settling this conjecture. We prove that planar graphs of bounded degree (which may have unbounded treewidth) have constant queue number. #R##N#A notable implication of this result is that every planar graph of bounded degree admits a three-dimensional straight-line grid drawing in linear volume. Further implications are that every planar graph of bounded degree has constant track number, and that every k-planar graph (i.e., every graph that can be drawn in the plane with at most k crossings per edge) of bounded degree has constant queue number.

Includes members:
  Member "planar graphs have bounded queue number":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adjacency labelling for planar graphs and beyond")
  Member "queue layouts of planar 3 trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "planar graphs have bounded queue number")
  Member "mixed linear layouts of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mixed linear layouts complexity heuristics and experiments")
  Member "stack and queue layouts via layered separators":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "book embeddings of nonplanar graphs with small faces in few pages")
  Member "on the queue number of graphs with bounded tree width":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "planar graphs have bounded queue number")
  Member "graph layouts via layered separators":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "planar graphs have bounded queue number")
  Member "layout of graphs with bounded tree width":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "planar graphs have bounded queue number")

Question: Please tell me which class the source paper 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)