On the public citation graph
Queue Layouts of Graph Products and Powers
0 signed · 51 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.1002/(sici)1097-0118(199906)31:2<129::aid-jgt5>3.0.co;2-aopenalex-snapshot
On the linear arboricity of planar graphs
inferredcites →https://doi.org/10.1006/jagm.1999.1049openalex-snapshot
On Crossing Sets, Disjoint Sets, and Pagenumber
inferredcites →https://doi.org/10.1006/jpdc.1996.0024openalex-snapshot
Scheduling Tree-Dags Using FIFO Queues: A Control–Memory Trade-Off
inferredcites →https://doi.org/10.1007/11618058_10openalex-snapshot
Volume Requirements of 3D Upward Drawings
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/978-3-540-24595-7_19openalex-snapshot
Laying Out Iterated Line Digraphs Using Queues
inferredcites →https://doi.org/10.1007/978-3-540-39890-5_18openalex-snapshot
Tree-Partitions of k-Trees with Applications in Graph Layout
inferredcites →https://doi.org/10.1007/pl00007233openalex-snapshot
Linear Arboricity and Linear k-Arboricity of Regular Graphs
inferredcites →https://doi.org/10.1007/s373-000-8299-9openalex-snapshot
The Linear Arboricity of Series-Parallel Graphs
inferredcites →https://doi.org/10.1016/0012-365x(94)00377-uopenalex-snapshot
Coloring graph products — A survey
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50011-7openalex-snapshot
QUEUES, STACKS AND GRAPHS
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.1090/dimacs/009/02openalex-snapshot
Stack and queue layouts of directed acyclic graphs
inferredcites →https://doi.org/10.1137/0405031openalex-snapshot
Comparing Queues and Stacks As Machines for Laying Out Graphs
inferredcites →https://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferredcites →https://doi.org/10.1137/s0097539795280287openalex-snapshot
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
inferredcites →https://doi.org/10.1137/s0097539795291550openalex-snapshot
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
inferredcites →https://doi.org/10.1137/s0895480193252380openalex-snapshot
Stack and Queue Layouts of Posets
inferredcites →https://doi.org/10.1145/321694.321704openalex-snapshot
Sorting Using Networks of Queues and Stacks
inferredcites →https://doi.org/10.1145/800125.804058openalex-snapshot
Computing permutations with double-ended queues, parallel stacks and parallel queues
inferredcites →https://doi.org/10.46298/dmtcs.346openalex-snapshot
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.23023openalex-snapshot
Structural properties of graph products
inferred← citeshttps://doi.org/10.1007/978-3-319-48532-4_21openalex-snapshot
Topological Graph Layouts into a Triangular Prism
inferred← citeshttps://doi.org/10.1007/978-3-540-89550-3_14openalex-snapshot
(3,2)-Track Layout of Bipartite Graph Subdivisions
inferred← citeshttps://doi.org/10.1007/s00493-021-4585-7openalex-snapshot
Stack-Number is Not Bounded by Queue-Number
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.027openalex-snapshot
Computing square roots of trivially perfect and threshold graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.09.007openalex-snapshot
A new upper bound on the queuenumber of hypercubes
inferred← citeshttps://doi.org/10.1016/j.disc.2010.02.002openalex-snapshot
Erratum to “A new upper bound on the queuenumber of hypercubes” [Discrete Math. 310 (2010) 935–939]
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104094openalex-snapshot
Stack and queue numbers of graphs revisited
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.067openalex-snapshot
On the queue-number of the hypercube
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.05.006openalex-snapshot
An improved upper bound on the queuenumber of the hypercube
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.10.006openalex-snapshot
Upper bounds on the queuenumber of k-ary n-cubes
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.006openalex-snapshot
Layered separators in minor-closed graph classes with applications
inferred← citeshttps://doi.org/10.1080/23799927.2026.2721274openalex-snapshot
Strict queue numbers of hypercube and folded hypercube
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.5.896openalex-snapshot
Queue Layout of Bipartite Graph Subdivisions
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.9.2292openalex-snapshot
(d+1,2) -Track Layout of Bipartite Graph Subdivisions
inferred← citeshttps://doi.org/10.1109/focs.2019.00056openalex-snapshot
Planar Graphs 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/3385731openalex-snapshot
Planar Graphs Have Bounded Queue-Number
inferred← citeshttps://doi.org/10.1587/transfun.e97.a.1180openalex-snapshot
Queue Layouts of Toroidal Grids
inferred← citeshttps://doi.org/10.46298/dmtcs.434openalex-snapshot
Bounded-degree graphs have arbitrarily large queue-number
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.5817/cz.muni.eurocomb23-083openalex-snapshot
Stack and Queue Numbers of Graphs Revisited
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.