| |
| 1982 | ||
|---|---|---|
| 2 | Manfred Schnitzler: The isomorphism problem is polynomially solvable for certain graph languages. Graph-Grammars and Their Application to Computer Science 1982: 369-379 | |
| 1980 | ||
| 1 | Manfred Schnitzler: Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs. WG 1980: 137-149 | |