{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T14:59:30Z","timestamp":1782572370626,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1007\/bf00288976","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T17:10:14Z","timestamp":1096909814000},"page":"657-677","source":"Crossref","is-referenced-by-count":21,"title":["Metatheorems for decision problems on hyperedge replacement graph languages"],"prefix":"10.1007","volume":"26","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hans -J\ufffdrg","family":"Kreowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Claus, V., Ehrig, H., Rozenberg, G. (eds.): Graph Grammars and Their Application to Computer Science and Biology. Lect. Notes Comput. Sci. 73 (1979)","DOI":"10.1007\/BFb0025713"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-18771-5_50","volume":"291","author":"B. Courcelle","year":"1987","unstructured":"Courcelle, B.: On Context-Free Sets of Graphs and Their Monadic Second-Order Theory. Lect. Notes Comput. Sci. 291, 133?146 (1987)","journal-title":"Lect. Notes Comput. Sci."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Graph Grammars and Their Application to Computer Science, (2nd Int. Workshop). Lect. Notes Comput. Sci. 153 (1983)","DOI":"10.1007\/BFb0000123"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.): Graph Grammars and Their Application to Computer Science, (3rd Int. Workshop). Lect. Notes Comput. Sci. 291 (1987)","DOI":"10.1007\/3-540-18771-5"},{"key":"CR5","first-page":"11","volume":"344","author":"A. Habel","year":"1989","unstructured":"Habel, A.: Graph-Theoretic Properties Compatible with Graph Derivations. Proc. Graph-Theoretic Concepts in Computer Science, Lect. Notes Comput. Sci. 344, 11?29 (1989)","journal-title":"Proc. Graph-Theoretic Concepts in Computer Science, Lect. Notes Comput. Sci."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0000104","volume":"153","author":"A. Habel","year":"1983","unstructured":"Habel, A., Kreowski, H.-J.: On Context-Free Graph Languages Generated by Edge Replacement. Lect. Notes Comput. Sci. 153, 143?158 (1983)","journal-title":"Lect. Notes Comput. Sci."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(87)90050-8","volume":"51","author":"A. Habel","year":"1987","unstructured":"Habel, A., Kreowski, H.-J.: Characteristics of Graph Languages Generated by Edge Replacement, Theoret. Comp. Sci. 51, 81?115 (1987)","journal-title":"Theoret. Comp. Sci."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-18771-5_41","volume":"291","author":"A. Habel","year":"1987","unstructured":"Habel, A., Kreowski, H.-J.: May We Introduce to You: Hyperedge Replacement. Lect. Notes Comput. Sci 291, 15?26 (1987)","journal-title":"Lect. Notes Comput. Sci"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0039608","volume":"247","author":"A. Habel","year":"1987","unstructured":"Habel, A., Kreowski, H.-J.: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. Lect. Notes Comput. Sci. 247, 207?219 (1987)","journal-title":"Lect. Notes Comput. Sci."},{"key":"CR10","first-page":"55","volume":"33","author":"A. Habel","year":"1987","unstructured":"Habel, A., Kreowski, H.-J., Vogler, W.: Compatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages. EATCS Bull. 33, 55?62 (1987)","journal-title":"EATCS Bull."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-50939-9_138","volume":"351","author":"A. Habel","year":"1989","unstructured":"Habel, A., Kreowski, H.J., Vogler, W.: Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars. Proc. TAPSOFT '89. Lect. Notes Comput. Sci. 351, 275?289 (1989)","journal-title":"Proc. TAPSOFT '89. Lect. Notes Comput. Sci."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0022-0000(86)90060-7","volume":"33","author":"D. Janssens","year":"1986","unstructured":"Janssens, D., Rozenberg, G., Welzl, E.: The Bounded Degree Problem for NLC Grammars is Decidable. J. Comput. Syst. Sci. 33, 415?422 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR13","unstructured":"Kreowski, H.-J.: Rule Trees Can Help to Escape Hard Graph Problems. (unpublished manuscript)"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BFb0026094","volume":"299","author":"C. Lautemann","year":"1988","unstructured":"Lautemann, C.: Decomposition Trees: Structured Graph Representation and Efficient Algorithms. Proc. CAAP '88. Lect. Notes Comput. Sci. 299, 28?39 (1988)","journal-title":"Proc. CAAP '88. Lect. Notes Comput. Sci."},{"key":"CR15","unstructured":"Lengauer, T.: Efficient Solution of Biconnectivity Problems on Hierarchically Defined Graphs. Proc. of the WG '85, Linz: Trauner, 201?215 (1985)"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-19488-6_129","volume":"317","author":"T. Lengauer","year":"1988","unstructured":"Lengauer, T., Wanke, E.: Efficient Analysis of Graph Properties on Context-Free Graph Languages. Proc. ICALP '88. Lect. Notes Comput. Sci. 317, 379?393 (1988)","journal-title":"Proc. ICALP '88. Lect. Notes Comput. Sci."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"Rozenberg, G., Welzl, E.: Boundary NLC Graph Grammars ? Basic Definitions, Normal Forms and Complexity. Inf. Control 69, 136?167 (1986)","journal-title":"Inf. Control"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"Rozenberg, G., Welzl, E.: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages. Acta Inf. 23, 289?309 (1986)","journal-title":"Acta Inf."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0020-0190(82)90086-2","volume":"14","author":"A.O. Slisenko","year":"1982","unstructured":"Slisenko, A.O.: Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems. Inf. Proc. Lett. 14, 52?56 (1982)","journal-title":"Inf. Proc. Lett."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288976.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288976\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T08:00:18Z","timestamp":1585900818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["BF00288976"],"URL":"https:\/\/doi.org\/10.1007\/bf00288976","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}