On the public citation graph
Decomposition trees: Structured graph representation and efficient algorithms
0 signed · 51 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-16078-7_73openalex-snapshot
Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
inferredcites →https://doi.org/10.1007/3-540-18771-5_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferredcites →https://doi.org/10.1007/3-540-19488-6_105openalex-snapshot
Problems easy for tree-decomposable graphs extended abstract
inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1007/bfb0028809openalex-snapshot
String grammars with disconnecting
inferredcites →https://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
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/0166-218x(87)90051-5openalex-snapshot
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
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.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11917496_1openalex-snapshot
Treewidth: Characterizations, Applications, and Computations
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_128openalex-snapshot
Efficient algorithms on context-free graph languages
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_33openalex-snapshot
Graph-theoretic properties compatible with graph derivations
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_34openalex-snapshot
The monadic second-order logic of graphs : Definable sets of finite graphs
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_138openalex-snapshot
Decidable boundedness problems for hyperedge-replacement graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_6openalex-snapshot
On hyperedge replacement and BNLC graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_50openalex-snapshot
Graph theoretical methods for the design of parallel algorithms
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_70openalex-snapshot
A Greibach normal form for context-free graph grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_21openalex-snapshot
NCE Graph Grammars and Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_3openalex-snapshot
Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_1openalex-snapshot
Efficient Computations in Tree-Like Graphs
inferred← citeshttps://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferred← citeshttps://doi.org/10.1007/bf00288976openalex-snapshot
Metatheorems for decision problems on hyperedge replacement graph languages
inferred← citeshttps://doi.org/10.1007/bf00289017openalex-snapshot
The complexity of graph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bf01178504openalex-snapshot
Context-free hypergraph grammars have the same term-generating power as attribute grammars
inferred← citeshttps://doi.org/10.1007/bf01178511openalex-snapshot
Context-free graph languages of bounded degree are generated by apex graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017398openalex-snapshot
The term generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017410openalex-snapshot
Tree automata, tree decomposition and hyperedge replacement
inferred← citeshttps://doi.org/10.1007/s00224-001-1015-5openalex-snapshot
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs
inferred← citeshttps://doi.org/10.1007/s002360050087openalex-snapshot
A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions
inferred← citeshttps://doi.org/10.1007/s002360050106openalex-snapshot
Context-free graph grammars and concatenation of graphs
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90018-zopenalex-snapshot
The string generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90106-ropenalex-snapshot
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90065-2openalex-snapshot
Recognising k-connected hypergraphs in cubic time
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00272-xopenalex-snapshot
Characterization and complexity of uniformly nonprimitive labeled 2-structures
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferred← citeshttps://doi.org/10.1016/j.jvlc.2012.10.002openalex-snapshot
Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80050-9openalex-snapshot
The translation power of top-down tree-to-graph transducers
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1109/tpami.2018.2810877openalex-snapshot
Learning Hyperedge Replacement Grammars for Graph Generation
inferred← citeshttps://doi.org/10.1162/coli_a_00350openalex-snapshot
Ordered Tree Decomposition for HRG Rule Extraction
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.41.643.654openalex-snapshot
Treewidth, Pathwidth and Cospan Decompositions
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.47.725openalex-snapshot
Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO
inferred← citeshttps://doi.org/10.3115/v1/p15-1143openalex-snapshot
Graph parsing with s-graph grammars
inferred← citeshttps://doi.org/10.48550/arxiv.2108.12300openalex-snapshot
Tree Decomposition Attention for AMR-to-Text Generation
inferred← citeshttps://doi.org/10.48550/arxiv.2108.12304openalex-snapshot
Latent Tree Decomposition Parsers for AMR-to-Text Generation
inferred← citeshttps://doi.org/10.70675/61130ea1zef23z4950z81e1z91b74939ff7copenalex-snapshot
Vers la vérification de propriétés de sûreté pour des systèmes infinis communicants : décidabilité et raffinement des abstractions
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.