On the public citation graph

Theoretical results on at most 1-bend embeddability of graphs

https://doi.org/10.1007/bf02006154

0 signed · 17 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/bf02107624openalex-snapshot

Boolean approach to planar embeddings of a graph

inferredcites →https://doi.org/10.1016/0196-6774(86)90006-4openalex-snapshot

Single bend wiring

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-62495-3_49openalex-snapshot

A new minimum cost flow algorithm with applications to graph drawing

inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_21openalex-snapshot

Manhattan-Geodesic Embedding of Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_9openalex-snapshot

Orthogonal Graph Drawing with Flexibility Constraints

inferred← citeshttps://doi.org/10.1007/bf02086606openalex-snapshot

Drawing Planar Graphs Using the Canonical Ordering

inferred← citeshttps://doi.org/10.1007/bf02583267openalex-snapshot

On the net-embeddability of graphs

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/s00453-012-9705-8openalex-snapshot

Orthogonal Graph Drawing with Flexibility Constraints

inferred← citeshttps://doi.org/10.1016/j.asej.2014.07.008openalex-snapshot

Convergence of exponential penalty function method for multiobjective fractional programming problems

inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.04.003openalex-snapshot

Orthogeodesic point-set embedding of trees

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00272-2openalex-snapshot

Advances in the theory and practice of graph drawing

inferred← citeshttps://doi.org/10.1137/s0097539794277123openalex-snapshot

On the Computational Complexity of Upward and Rectilinear Planarity Testing

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.