On the public citation graph
Issues in Interactive Orthogonal Graph Drawing
0 signed · 45 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-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/3-540-58950-3_384openalex-snapshot
On the computational complexity of upward and rectilinear planarity testing
inferredcites →https://doi.org/10.1007/978-3-322-92106-2openalex-snapshot
Combinatorial Algorithms for Integrated Circuit Layout
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.1016/0166-218x(94)00020-eopenalex-snapshot
Drawing graphs on rectangular grids
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.1109/31.34669openalex-snapshot
Planar grid embedding in linear time
inferredcites →https://doi.org/10.1109/case.1993.634832openalex-snapshot
An incremental approach to aesthetic graph layout
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/0216030openalex-snapshot
On Embedding a Graph in the Grid with the Minimum Number of Bends
inferredcites →https://doi.org/10.1137/s0097539792235724openalex-snapshot
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
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-36151-0_1openalex-snapshot
Sketch-Driven Orthogonal Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_33openalex-snapshot
Semi-dynamic Orthogonal Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_1openalex-snapshot
Drawing of Two-Dimensional Irregular Meshes
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_23openalex-snapshot
Refinement of Orthogonal Graph Drawings
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_5openalex-snapshot
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
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-62495-3_60openalex-snapshot
A Pairing Technique for Area-Efficient Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_61openalex-snapshot
Experimental and theoretical results in interactive orthogonal graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_4openalex-snapshot
Area-efficient static and incremental graph drawings
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_50openalex-snapshot
Incremental orthogonal graph drawing in three dimensions
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_66openalex-snapshot
A bayesian paradigm for dynamic graph layout
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_73openalex-snapshot
InteractiveGiotto: An algorithm for interactive orthogonal graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_79openalex-snapshot
GraVis — System demonstration
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_84openalex-snapshot
The three-phase method: A unified approach to orthogonal graph drawing
inferred← citeshttps://doi.org/10.1007/bfb0021819openalex-snapshot
Layout algorithms of graph-like diagrams for GRADE windows graphic editors
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/s0925-7721(97)00017-5openalex-snapshot
Algorithms for area-efficient orthogonal drawings
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.1109/12.736444openalex-snapshot
Interactive orthogonal graph drawing
inferred← citeshttps://doi.org/10.1145/242224.242247openalex-snapshot
Graph drawing and information visualization
inferred← citeshttps://doi.org/10.3390/a9020022openalex-snapshot
Modifying Orthogonal Drawings for Label Placement
inferred← citeshttps://doi.org/10.7155/jgaa.00019openalex-snapshot
Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
inferred← citeshttps://doi.org/10.7155/jgaa.00026openalex-snapshot
Techniques for the Refinement of Orthogonal Graph Drawings
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.