On the public citation graph
A fast heuristic for hierarchical Manhattan layout
0 signed · 55 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/3-540-58950-3_370openalex-snapshot
GraphEd: A graphical platform for the implementation of graph algorithms (extended abstract and demo)
inferredcites →https://doi.org/10.1007/3-540-58950-3_371openalex-snapshot
Graph layout through the VCG tool
inferredcites →https://doi.org/10.1007/bfb0049394openalex-snapshot
A better heuristic for orthogonal graph drawings
inferredcites →https://doi.org/10.1016/0020-0190(87)90173-6openalex-snapshot
The complexity of minimizing wire lengths in VLSI layouts
inferredcites →https://doi.org/10.1016/0196-6774(82)90011-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1109/31.34669openalex-snapshot
Planar grid embedding in linear time
inferredcites →https://doi.org/10.1109/32.221135openalex-snapshot
A technique for drawing directed graphs
inferredcites →https://doi.org/10.1109/32.67575openalex-snapshot
Towards the automatic generation of software diagrams
inferredcites →https://doi.org/10.1109/tse.1986.6312901openalex-snapshot
A layout algorithm for data flow diagrams
inferredcites →https://doi.org/10.1109/tsmc.1977.4309760openalex-snapshot
Crossing Theory and Hierarchy Mapping
inferredcites →https://doi.org/10.1109/tsmc.1981.4308636openalex-snapshot
Methods for Visual Understanding of Hierarchical System Structures
inferredcites →https://doi.org/10.1137/0214027openalex-snapshot
Rectilinear Graphs and Their Embeddings
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/800061.808779openalex-snapshot
An approximation algorithm for manhattan routing
inferredcites →https://doi.org/10.5555/320176.320233openalex-snapshot
Manhattan channel routing with good theoretical and practical performance
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_34openalex-snapshot
Graph Layout for Workflow Applications with ILOG JViews
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_36openalex-snapshot
Some Modifications of Sugiyama Approach
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_31openalex-snapshot
Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editor
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_22openalex-snapshot
A Fast Layout Algorithm for k-Level Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_41openalex-snapshot
On the Parameterized Complexity of Layered Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_3openalex-snapshot
Fast and Simple Horizontal Coordinate Assignment
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_35openalex-snapshot
The ILOG JViews Graph Layout Module
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_4openalex-snapshot
Automated Visualization of Process Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_86openalex-snapshot
Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_13openalex-snapshot
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_12openalex-snapshot
Size- and Port-Aware Horizontal Node Coordinate Assignment
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_16openalex-snapshot
A Generalization of the Directed Graph Layering Problem
inferred← citeshttps://doi.org/10.1007/978-3-322-91230-5_7openalex-snapshot
Visualisierungstechniken für den Compilerbau
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_35openalex-snapshot
Layout of Directed Hypergraphs with Orthogonal Hyperedges
inferred← citeshttps://doi.org/10.1007/978-3-540-78791-4_13openalex-snapshot
Visualization of Program Dependence Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_14openalex-snapshot
Port Constraints in Hierarchical Layout of Data Flow Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_13openalex-snapshot
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-31223-6_11openalex-snapshot
Improved Layout for Data Flow Diagrams with Port Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_31openalex-snapshot
Drawing Graphs within Restricted Area
inferred← citeshttps://doi.org/10.1007/s00453-007-9151-1openalex-snapshot
On the Parameterized Complexity of Layered Graph Drawing
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00270-9openalex-snapshot
Graph layout for applications in compiler construction
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80526-2openalex-snapshot
ILOG JViews Graph Layout: a Java library for highly demanding graph-based applications
inferred← citeshttps://doi.org/10.1109/csmr.2002.995805openalex-snapshot
Using graph based representations in reengineering
inferred← citeshttps://doi.org/10.1109/tvcg.2007.1000openalex-snapshot
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3114756openalex-snapshot
STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations
inferred← citeshttps://doi.org/10.1109/vissof.2002.1019791openalex-snapshot
Aesthetics of class diagrams
inferred← citeshttps://doi.org/10.1111/cgf.13723openalex-snapshot
A stable graph layout algorithm for processes
inferred← citeshttps://doi.org/10.1145/988952.989045openalex-snapshot
Orthogonal hypergraph routing for improved visibility
inferred← citeshttps://doi.org/10.1186/s12859-019-2779-4openalex-snapshot
Metabopolis: scalable network layout for biological pathway diagrams in urban map style
inferred← citeshttps://doi.org/10.17760/d20486922openalex-snapshot
Layered graphs and their layouts, evaluations, and applications
inferred← citeshttps://doi.org/10.21941/kcss/2018/1openalex-snapshot
Sugiyama Layouts for Prescribed Drawing Areas
inferred← citeshttps://doi.org/10.48550/arxiv.1409.0499openalex-snapshot
Drawing Graphs within Restricted Area
inferred← citeshttps://doi.org/10.5120/16945-7012openalex-snapshot
Clustered Graph Hierarchical Layout Algorithm for Systems Biology Models
inferred← citeshttps://doi.org/10.7155/jgaa.00122openalex-snapshot
Orthogonal Hypergraph Drawing for Improved Visibility
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.