On the public citation graph
An efficient orthogonal grid drawing algorithm for 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.
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-57155-8_244openalex-snapshot
Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-58950-3_355openalex-snapshot
Improved algorithms and bounds for orthogonal drawings
inferredcites →https://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferredcites →https://doi.org/10.1007/bf02662066openalex-snapshot
At most single-bend embeddings of cubic graphs
inferredcites →https://doi.org/10.1007/bfb0049394openalex-snapshot
A better heuristic for orthogonal graph drawings
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
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/978-3-540-39611-6_21openalex-snapshot
Range Assignment for High Connectivity in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_6openalex-snapshot
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle
inferred← citeshttps://doi.org/10.1007/s00454-018-0019-8openalex-snapshot
( $$\delta ,{\varepsilon }$$ δ , ε )-Ball Approximation of a Shape: Definition and Complexity
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/s0925-7721(01)00006-2openalex-snapshot
The DFS-heuristic for orthogonal graph drawing☆☆Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference…
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00017-5openalex-snapshot
Algorithms for area-efficient orthogonal drawings
inferred← citeshttps://doi.org/10.1109/71.888641openalex-snapshot
A simple parallel algorithm to draw cubic graphs
inferred← citeshttps://doi.org/10.22215/etd/2011-09706openalex-snapshot
Connectivity of wireless sensor networks using directional antennae
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12144openalex-snapshot
Multi-robot motion planning of k-colored discs is PSPACE-hard
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.