On the public citation graph

At most single-bend embeddings of cubic graphs

0 signed · 20 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02006104openalex-snapshot
General theoretical results on rectilinear embedability of graphs
inferredcites →https://doi.org/10.1007/bfb0067364openalex-snapshot
Recent results on generalized Ramsey theory for graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90086-4openalex-snapshot
Computing an st-numbering
inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7180-4openalex-snapshot
Planar Graphs: Theory and Algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1495openalex-snapshot
Orthogonally Drawing Cubic Graphs in Parallel
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_384openalex-snapshot
On the computational complexity of upward and rectilinear planarity testing
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_33openalex-snapshot
Variants of the Segment Number of a Graph
inferred← citeshttps://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferred← citeshttps://doi.org/10.1007/bf02662005openalex-snapshot
Some combinatorial optimization problems arising from VLSI circuit design
inferred← citeshttps://doi.org/10.1007/bf02878978openalex-snapshot
Boolean approaches to graph embeddings related to VLSI
inferred← citeshttps://doi.org/10.1007/bf02948786openalex-snapshot
Orthogonal drawings of graphs for the automation of VLSI circuit design
inferred← citeshttps://doi.org/10.1007/bfb0030817openalex-snapshot
An efficient orthogonal grid drawing algorithm for cubic graphs
inferred← citeshttps://doi.org/10.1007/s10100-016-0454-7openalex-snapshot
Optimal partisan districting on planar geographies
inferred← citeshttps://doi.org/10.1007/s11036-006-4466-8openalex-snapshot
Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106210openalex-snapshot
Grid straight-line embeddings of trees with a minimum number of bends per path
inferred← citeshttps://doi.org/10.1109/71.888641openalex-snapshot
A simple parallel algorithm to draw cubic graphs
inferred← citeshttps://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
inferred← citeshttps://doi.org/10.1145/220279.220312openalex-snapshot
An experimental comparison of three graph drawing algorithms (extended abstract)
inferred← citeshttps://doi.org/10.1145/234782.234783openalex-snapshot
Cubic graphs
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.