On the public citation graph
On the Queue-Number of Graphs with Bounded Tree-Width
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-36206-1_31openalex-snapshot
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
inferredcites →https://doi.org/10.1007/3-540-63938-1_49openalex-snapshot
Three-dimensional grid drawings of graphs
inferredcites →https://doi.org/10.1007/s11083-006-9028-yopenalex-snapshot
Upward Three-Dimensional Grid Drawings of Graphs
inferredcites →https://doi.org/10.1016/0022-0000(89)90032-9openalex-snapshot
Embedding planar graphs in four pages
inferredcites →https://doi.org/10.1016/0095-8956(79)90021-2openalex-snapshot
The book thickness of a graph
inferredcites →https://doi.org/10.1016/j.comgeo.2004.11.003openalex-snapshot
Computing straight-line 3D grid drawings of graphs in linear volume
inferredcites →https://doi.org/10.1016/s0166-218x(00)00178-5openalex-snapshot
The pagenumber of k-trees is O(k)
inferredcites →https://doi.org/10.1137/0405031openalex-snapshot
Comparing Queues and Stacks As Machines for Laying Out Graphs
inferredcites →https://doi.org/10.1137/130908051openalex-snapshot
On the Queue Number of Planar Graphs
inferredcites →https://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferredcites →https://doi.org/10.46298/dmtcs.346openalex-snapshot
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
inferredcites →https://doi.org/10.7155/jgaa.00075openalex-snapshot
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
inferredcites →https://doi.org/10.7155/jgaa.00079openalex-snapshot
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_15openalex-snapshot
Queue Layouts of Planar 3-Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_12openalex-snapshot
On Mixed Linear Layouts of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_3openalex-snapshot
The Local Queue Number of Graphs with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_4openalex-snapshot
Parameterized Algorithms for Queue Layouts
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_5openalex-snapshot
Lazy Queue Layouts of Posets
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_17openalex-snapshot
On the Queue-Number of Partial Orders
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_20openalex-snapshot
On the Queue Number of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_29openalex-snapshot
Linear Layouts of Bipartite Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_1openalex-snapshot
Graph Product Structure Theory with Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_13openalex-snapshot
The Peculiarities of Extending Queue Layouts
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_17openalex-snapshot
Mixed Linear Layouts of Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01037-4openalex-snapshot
An Improved Upper Bound on the Queue Number of Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01067-yopenalex-snapshot
Lazy Queue Layouts of Posets
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.056openalex-snapshot
Queue layouts on folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.024openalex-snapshot
An improved upper bound on the queue number of the folded hypercube
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.036openalex-snapshot
The mixed page number of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.019openalex-snapshot
On mixed linear layouts of series-parallel graphs
inferred← citeshttps://doi.org/10.1080/23799927.2026.2721274openalex-snapshot
Strict queue numbers of hypercube and folded hypercube
inferred← citeshttps://doi.org/10.1109/focs.2019.00056openalex-snapshot
Planar Graphs have Bounded Queue-Number
inferred← citeshttps://doi.org/10.1137/19m125340xopenalex-snapshot
Planar Graphs of Bounded Degree Have Bounded Queue Number
inferred← citeshttps://doi.org/10.1137/22m1540296openalex-snapshot
Shallow Minors, Graph Products, and Beyond-Planar Graphs
inferred← citeshttps://doi.org/10.1145/3313276.3316324openalex-snapshot
Planar graphs of bounded degree have bounded queue number
inferred← citeshttps://doi.org/10.1145/3385731openalex-snapshot
Planar Graphs Have Bounded Queue-Number
inferred← citeshttps://doi.org/10.1145/3519941.3535076openalex-snapshot
Code generation criteria for buffered exposed datapath architectures from dataflow graphs
inferred← citeshttps://doi.org/10.20381/ruor-24581openalex-snapshot
Stack Number, Track Number, and Layered Pathwidth
inferred← citeshttps://doi.org/10.2139/ssrn.4123728openalex-snapshot
On Mixed Linear Layouts of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1811.00816openalex-snapshot
Planar Graphs of Bounded Degree have Constant Queue Number
inferred← citeshttps://doi.org/10.48550/arxiv.1901.05594openalex-snapshot
Queue Layouts of Graphs with Bounded Degree and Bounded Genus
inferred← citeshttps://doi.org/10.48550/arxiv.2007.15102openalex-snapshot
Book Embeddings of Graph Products
inferred← citeshttps://doi.org/10.48550/arxiv.2103.04670openalex-snapshot
Queue layouts and nonrepetitive colouring of planar graphs and powers of trees
inferred← citeshttps://doi.org/10.7155/jgaa.00597openalex-snapshot
Parameterized Algorithms for Queue Layouts
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.