On the public citation graph
A better heuristic for orthogonal graph drawings
0 signed · 73 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-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_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/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
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/0022-0000(85)90004-2openalex-snapshot
A linear algorithm for embedding planar graphs using PQ-trees
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.1109/sfcs.1992.267814openalex-snapshot
Drawing planar graphs using the lmc-ordering
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
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.1145/28395.28434openalex-snapshot
Two algorithms for maintaining order in a list
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/3-540-37623-2_10openalex-snapshot
On Improving Orthogonal Drawings: The 4M-Algorithm
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_47openalex-snapshot
Adding Constraints to an Algorithm for Orthogonal Graph Drawing
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-58950-3_355openalex-snapshot
Improved algorithms and bounds for orthogonal drawings
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-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_45openalex-snapshot
2-Visibility drawings of planar graphs
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/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-63307-3_72openalex-snapshot
Computing orthogonal drawings with the minimum number of bends
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_74openalex-snapshot
Orthogonal drawing of high degree graphs with small area and few bends
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_58openalex-snapshot
Drawing clustered graphs on an orthogonal grid
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/978-1-4615-0457-3_14openalex-snapshot
Effective Graph Visualization Via Node Grouping
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_19openalex-snapshot
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_37openalex-snapshot
Slanted Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_33openalex-snapshot
On the Orthogonal Drawing of Outerplanar 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/978-3-642-36763-2_13openalex-snapshot
Circle-Representations of Simple 4-Regular Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_14openalex-snapshot
Smooth Orthogonal Layouts
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_21openalex-snapshot
Column-Based Graph Layouts
inferred← citeshttps://doi.org/10.1007/978-3-642-58300-1_17openalex-snapshot
Graph Drawing: the Aesthetics-Complexity Trade-Off
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_28openalex-snapshot
Planar Octilinear Drawings with One Bend Per Edge
inferred← citeshttps://doi.org/10.1007/bfb0021788openalex-snapshot
New lower bounds for orthogonal graph drawings
inferred← citeshttps://doi.org/10.1007/bfb0021825openalex-snapshot
Issues in Interactive Orthogonal Graph Drawing
inferred← citeshttps://doi.org/10.1007/bfb0021828openalex-snapshot
A fast heuristic for hierarchical Manhattan layout
inferred← citeshttps://doi.org/10.1007/bfb0030817openalex-snapshot
An efficient orthogonal grid drawing algorithm for cubic graphs
inferred← citeshttps://doi.org/10.1007/bfb0054325openalex-snapshot
A linear time algorithm to recognize clustered planar graphs and its parallelization
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/s0925-7721(96)00005-3openalex-snapshot
An experimental comparison of four graph drawing algorithms
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00016-3openalex-snapshot
New results on drawing angle graphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00017-5openalex-snapshot
Algorithms for area-efficient orthogonal drawings
inferred← citeshttps://doi.org/10.1023/a:1019128411323openalex-snapshot
A new model for scheduling packet radio networks
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.6.1583openalex-snapshot
On the Orthogonal Drawing of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1101/2023.12.23.573191openalex-snapshot
Creating Aesthetically Pleasing SBGN Visualisations for Presentation and Exploration
inferred← citeshttps://doi.org/10.1109/12.736444openalex-snapshot
Interactive orthogonal graph drawing
inferred← citeshttps://doi.org/10.1109/cec.2009.28openalex-snapshot
A Simple Algorithm for Automatic Layout of BPMN Processes
inferred← citeshttps://doi.org/10.1109/iisa.2015.7388121openalex-snapshot
Sloginsky drawings of graphs
inferred← citeshttps://doi.org/10.1109/infcom.2000.832171openalex-snapshot
Max-min d-cluster formation in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1137/s0097539794262847openalex-snapshot
Spirality and Optimal Orthogonal Drawings
inferred← citeshttps://doi.org/10.1145/220279.220312openalex-snapshot
An experimental comparison of three graph drawing algorithms (extended abstract)
inferred← citeshttps://doi.org/10.1145/242224.242247openalex-snapshot
Graph drawing and information visualization
inferred← citeshttps://doi.org/10.15496/publikation-8879openalex-snapshot
On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a1openalex-snapshot
On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.388openalex-snapshot
On the tileability of polygons with colored dominoes
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4408openalex-snapshot
Embedding Graphs under Centrality Constraints for Network Visualization
inferred← citeshttps://doi.org/10.7155/jgaa.00332openalex-snapshot
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations
inferred← citeshttps://doi.org/10.7155/jgaa.00369openalex-snapshot
Planar Octilinear Drawings with One Bend Per Edge
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.