On the public citation graph

Layout graph grammars: The placement approach

https://doi.org/10.1007/bfb0017387
0 signed · 27 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-18771-5openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/3-540-18771-5_62openalex-snapshot
Practical applications of precedence graph grammars
inferredcites →https://doi.org/10.1007/3-540-52292-1_12openalex-snapshot
On the complexity of optimal drawings of graphs
inferredcites →https://doi.org/10.1007/bfb0035847openalex-snapshot
On polynomial time graph grammars
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0020-0190(82)90086-2openalex-snapshot
Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
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/0020-0190(89)90118-xopenalex-snapshot
Unit-length embedding of binary trees on a square grid
inferredcites →https://doi.org/10.1016/0020-0255(80)90038-9openalex-snapshot
On the structure of node-label-controlled graph languages
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(85)90016-1openalex-snapshot
NP-completeness for minimizing maximum edge length in grid embeddings
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/s0019-9958(86)80045-6openalex-snapshot
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
inferredcites →https://doi.org/10.1145/800141.804665openalex-snapshot
Optimal tree layout (Preliminary Version)

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-45104-8_30openalex-snapshot
Graph Algorithm Animation with Grrr
inferred← citeshttps://doi.org/10.1007/3-540-46037-3_13openalex-snapshot
Grammar-Based Layout for a Visual Programming Language Generation System
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_2openalex-snapshot
Syntax and semantics of hybrid database languages
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_24openalex-snapshot
Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_373openalex-snapshot
Reduction of visual complexity in dynamic graphs
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_380openalex-snapshot
CG: A graph drawing system using graph-grammar parsing
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_394openalex-snapshot
Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_395openalex-snapshot
Designing graph drawings by layout graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_104openalex-snapshot
Drawing graphs with attribute graph grammars
inferred← citeshttps://doi.org/10.1007/978-1-4615-0457-3_1openalex-snapshot
Graph Grammars for Visual Programming
inferred← citeshttps://doi.org/10.1109/3468.709599openalex-snapshot
Using graph parsing for automatic graph drawing
inferred← citeshttps://doi.org/10.1109/cmpsac.1996.544164openalex-snapshot
Hierarchical program diagram editor based on attribute graph grammar
inferred← citeshttps://doi.org/10.1109/hcc.2003.1260207openalex-snapshot
Spatial graph grammars for web information transformation
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.