On the public citation graph
General theoretical results on rectilinear embedability of graphs
0 signed · 29 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/bf02107624openalex-snapshot
Boolean approach to planar embeddings of a graph
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-58950-3_357openalex-snapshot
Grid layouts of block diagrams — bounding the number of bends in each connection (extended abstract)
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/3-540-63307-3_72openalex-snapshot
Computing orthogonal drawings with the minimum number of bends
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_27openalex-snapshot
Drawing Planar Graphs of Bounded Degree with Few Slopes
inferred← citeshttps://doi.org/10.1007/bf02006154openalex-snapshot
Theoretical results on at most 1-bend 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/bf02662066openalex-snapshot
At most single-bend embeddings of cubic graphs
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/s13675-020-00124-xopenalex-snapshot
A robust p-Center problem under pressure to locate shelters in wildfire context
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50022-xopenalex-snapshot
Graph Drawing**Work supported in part by the National Science Foundation under grant CCR-9732327, and by the U.S. Army Research Office under grant DAAH04-96-1-0013.
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.046openalex-snapshot
On some coloring problems in grids
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.004openalex-snapshot
Graphs of edge-intersecting and non-splitting paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.02.012openalex-snapshot
A graph theoretical approach to the firebreak locating problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00177-9openalex-snapshot
Single bend wiring on surfaces
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00373-1openalex-snapshot
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00076-0openalex-snapshot
A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
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.1016/s0925-7721(97)00026-6openalex-snapshot
A better heuristic for orthogonal graph drawings
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00219-7openalex-snapshot
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
inferred← citeshttps://doi.org/10.1137/100815001openalex-snapshot
Drawing Planar Graphs of Bounded Degree with Few Slopes
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.1163/156856792x00100openalex-snapshot
1-oxo-2,2,6,6-tetramethyl-4-chloropiperidinium perchlorate. A new facile oxidant for phenol coupling
inferred← citeshttps://doi.org/10.46298/dmtcs.606openalex-snapshot
A note on the NP-hardness of two matching problems in induced subgrids
inferred← citeshttps://doi.org/10.48550/arxiv.1009.4641openalex-snapshot
Decomposition of Geometric Set Systems and Graphs
inferred← citeshttps://doi.org/10.70675/d936de2azcf6bz4886zac3dzb512bad198c6openalex-snapshot
New robust and probabilistic models for shelter location in forest fire context
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.