On the public citation graph
New lower bounds for orthogonal graph drawings
0 signed · 37 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/net.3230140202openalex-snapshot
On minimal‐node‐cost planar embeddings
inferredcites →https://doi.org/10.1007/3-540-53832-1_38openalex-snapshot
The VLSI layout problem in various embedding models
inferredcites →https://doi.org/10.1007/3-540-58950-3_384openalex-snapshot
On the computational complexity of upward and rectilinear planarity testing
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1007/bfb0049394openalex-snapshot
A better heuristic for orthogonal graph drawings
inferredcites →https://doi.org/10.1016/0020-0190(91)90059-qopenalex-snapshot
Lower bounds for planar orthogonal drawings of graphs
inferredcites →https://doi.org/10.1109/31.34669openalex-snapshot
Planar grid embedding in linear time
inferredcites →https://doi.org/10.1109/sfcs.1981.22openalex-snapshot
New lower bound techniques for VLSI
inferredcites →https://doi.org/10.1109/sfcs.1992.267814openalex-snapshot
Drawing planar graphs using the lmc-ordering
inferredcites →https://doi.org/10.1109/tc.1981.6312176openalex-snapshot
Universality considerations in VLSI circuits
inferredcites →https://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
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-46648-7_2openalex-snapshot
Turn-Regularity and Planar Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_11openalex-snapshot
Dynamic Grid Embedding with Few Bends and Changes
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_143openalex-snapshot
Optimal orthogonal drawings of triconnected plane graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_44openalex-snapshot
Two algorithms for three dimensional orthogonal graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_60openalex-snapshot
A Pairing Technique for Area-Efficient Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_51openalex-snapshot
On three-dimensional layout of interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_55openalex-snapshot
Interactive orthogonal graph drawing: Algorithms and bounds
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_57openalex-snapshot
Algorithms and area bounds for nonplanar orthogonal drawings
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_58openalex-snapshot
Drawing clustered graphs on an orthogonal grid
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_27openalex-snapshot
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_12openalex-snapshot
On the Total Number of Bends for Planar Octilinear Drawings
inferred← citeshttps://doi.org/10.1007/s00454-010-9310-zopenalex-snapshot
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00454-023-00593-yopenalex-snapshot
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing
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/s0020-0190(97)00207-xopenalex-snapshot
Relating bends and size in orthogonal graph drawings
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00172-4openalex-snapshot
Three-dimensional orthogonal graph drawing algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00287-xopenalex-snapshot
Optimal three-dimensional layout of interconnection networks
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00017-5openalex-snapshot
Algorithms for area-efficient orthogonal drawings
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/s0925-7721(98)00003-0openalex-snapshot
Rectangular grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00054-1openalex-snapshot
Turn-regularity and optimal area drawings of orthogonal representations
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)42733-9openalex-snapshot
A GA Based Approach to Routing Problem: A Case Study of Constraints Graph Drawing Problem
inferred← citeshttps://doi.org/10.1299/jamdsm.2020jamdsm0069openalex-snapshot
The computational complexity of the gear placement problem
inferred← citeshttps://doi.org/10.48550/arxiv.1512.04866openalex-snapshot
On the Total Number of Bends for Planar Octilinear Drawings
inferred← citeshttps://doi.org/10.7155/jgaa.00016openalex-snapshot
Drawing Clustered Graphs on an Orthogonal Grid
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.