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 have bounded queue number"):
  Abstract: We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has a vertex-partition and a layering, such that each part has a bounded number of vertices in each layer, and the quotient graph has bounded treewidth. This result generalises for graphs of bounded Euler genus. Moreover, we prove that every graph in a minor-closed class has such a layered partition if and only if the class excludes some apex graph. Building on this work and using the graph minor structure theorem, we prove that every proper minor-closed class of graphs has bounded queue-number. #R##N#Layered partitions have strong connections to other topics, including the following two examples. First, they can be interpreted in terms of strong products. We show that every planar graph is a subgraph of the strong product of a path with some graph of bounded treewidth. Similar statements hold for all proper minor-closed classes. Second, we give a simple proof of the result by DeVos et al. (2004) that graphs in a proper minor-closed class have low treewidth colourings.

Includes members:
  Member "shorter labeling schemes for planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adjacency labelling for planar graphs and beyond")
  Member "planar graphs of bounded degree have constant queue number":
    also connected through other hyperedges:
      (none)
  Member "polynomial bounds for centered colorings on proper minor closed graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space")
  Member "queue layouts of planar 3 trees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved bounds for track numbers of planar graphs")
  Member "layouts for plane graphs on constant number of tracks":
    also connected through other hyperedges:
      (none)
  Member "an annotated bibliography on 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fan crossing free graphs")
  Member "stack and queue layouts via layered separators":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "improved bounds for track numbers of planar graphs")

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.DM(Discrete Mathematics)