On the public citation graph
Context-free handle-rewriting hypergraph grammars
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-18771-5openalex-snapshot
Graph-Grammars and Their Application to Computer Science
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-18771-5_69openalex-snapshot
An efficient algorithm for the solution of hierarchical networks of constraints
inferredcites →https://doi.org/10.1007/3-540-19488-6_128openalex-snapshot
Efficient algorithms on context-free graph languages
inferredcites →https://doi.org/10.1007/3-540-50728-0_34openalex-snapshot
The monadic second-order logic of graphs : Definable sets of finite graphs
inferredcites →https://doi.org/10.1007/3-540-51498-8_15openalex-snapshot
Context-free NCE graph grammars
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
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-0255(80)90038-9openalex-snapshot
On the structure of node-label-controlled graph languages
inferredcites →https://doi.org/10.1016/0022-0000(87)90012-2openalex-snapshot
Handle NLC grammars and R. E. languages
inferredcites →https://doi.org/10.1016/0022-0000(90)90002-3openalex-snapshot
Boundary graph grammars with dynamic edge relabeling
inferredcites →https://doi.org/10.1016/0022-0000(90)90012-aopenalex-snapshot
Edge-label controlled graph grammars
inferredcites →https://doi.org/10.1016/0022-0000(91)90018-zopenalex-snapshot
The string generating power of context-free hypergraph grammars
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferredcites →https://doi.org/10.1016/0304-3975(91)90174-zopenalex-snapshot
Nonterminal separation in graph grammars
inferredcites →https://doi.org/10.1016/0890-5401(89)90030-8openalex-snapshot
Linear graph grammars: Power and complexity
inferredcites →https://doi.org/10.1016/0890-5401(90)90038-jopenalex-snapshot
A comparison of boundary graph grammars and context-free hypergraph grammars
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1016/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0019-9958(86)80045-6openalex-snapshot
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
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-53904-2_106openalex-snapshot
The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_12openalex-snapshot
On tractability of Cops and Robbers game
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_5openalex-snapshot
Clique-Width of Point Configurations
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_20openalex-snapshot
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_36openalex-snapshot
Synthesis for Structure Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33362-0_7openalex-snapshot
Abstract Argumentation via Monadic Second Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_24openalex-snapshot
A SAT Approach to Clique-Width
inferred← citeshttps://doi.org/10.1007/bfb0017374openalex-snapshot
Graph grammars based on node rewriting: an introduction to NLC graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
inferred← citeshttps://doi.org/10.1007/s00224-009-9241-3openalex-snapshot
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90004-gopenalex-snapshot
Handle-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.031openalex-snapshot
The NLC-width and clique-width for powers of graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1016/j.disc.2015.11.022openalex-snapshot
Polynomial graph invariants from homomorphism numbers
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.03.001openalex-snapshot
Tree-depth and vertex-minors
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.019openalex-snapshot
Polynomial algorithms for protein similarity search for restricted mRNA structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.010openalex-snapshot
Pursuing a fast robber on a graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.039openalex-snapshot
Satisfiability of acyclic and almost acyclic CNF formulas
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80022-4openalex-snapshot
Hypergraph languages of bounded degree
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00069openalex-snapshot
Transductions of Graph Classes Admitting Product Structure
inferred← citeshttps://doi.org/10.1145/1132516.1132568openalex-snapshot
Clique-width minimization is NP-hard
inferred← citeshttps://doi.org/10.1613/jair.1.11515openalex-snapshot
The Impact of Treewidth on Grounding and Solving of Answer Set Programs
inferred← citeshttps://doi.org/10.3233/978-1-60750-619-5-219openalex-snapshot
Reasoning in Argumentation Frameworks of Bounded Clique-Width
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3408openalex-snapshot
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
inferred← citeshttps://doi.org/10.48550/arxiv.0806.4073openalex-snapshot
A comparison of two approaches for polynomial time algorithms computing basic graph parameters
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.