{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:49Z","timestamp":1725663409750},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540509394"},{"type":"electronic","value":"9783540461166"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50939-9_138","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:34:47Z","timestamp":1330202087000},"page":"275-289","source":"Crossref","is-referenced-by-count":11,"title":["Decidable boundedness problems for hyperedge-replacement graph grammars"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/3-540-19488-6_105","volume":"317","author":"S. Arnborg","year":"1988","unstructured":"S. Arnborg, J. Lagergren, D. Seese: Problems Easy for Tree-Decomposable Graphs, Proc. ICALP'88, Lect. Not. Comp. Sci. 317, 38\u201351, 1988","journal-title":"Proc. ICALP'88, Lect. Not. Comp. Sci."},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon, B. Courcelle: Graph Expressions and Graph Rewriting, Math. Systems Theory 20, 83\u2013127, 1987","journal-title":"Math. Systems Theory"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/3-540-18771-5_50","volume":"291","author":"B. Courcelle","year":"1987","unstructured":"B. Courcelle: On Context-Free Sets of Graphs and Their Monadic Monadic Second-Order Theory, Lect. Not. Comp. Sci. 291, 133\u2013146, 1987","journal-title":"Lect. Not. Comp. Sci."},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(78)90528-4","volume":"37","author":"P. D. Vigna","year":"1978","unstructured":"P. Della Vigna, C. Ghezzi: Context-Free Graph Grammars, Inf. Contr. 37, 207\u2013233, 1978","journal-title":"Inf. Contr."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"A. Habel: Graph-Theoretic Properties Compatible with Graph Derivations, to appear in: Proc. Graph-Theoretic Concepts in Computer Science 1988 (WG'88), Lect. Not. Comp. Sci., 1988","DOI":"10.1007\/3-540-50728-0_33"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0000104","volume":"153","author":"A. Habel","year":"1983","unstructured":"A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, Lect. Not. Comp. Sci. 153, 143\u2013158, 1983","journal-title":"Lect. Not. Comp. Sci."},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(87)90050-8","volume":"51","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: Characteristics of Graph Languages Generated by Edge Replacement, University of Bremen, Comp. Sci. Report No. 3\/85, also in: Theor. Comp. Sci. 51, 81\u2013115, 1987","journal-title":"Theor. Comp. Sci."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-18771-5_41","volume":"291","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: May We Introduce to You: Hyperedge Replacement, Lect. Not. Comp. Sci. 291, 15\u201326, 1987","journal-title":"Lect. Not. Comp. Sci."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0039608","volume":"247","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement, Proc. STACS'87, Lect. Not. Comp. Sci. 247, 207\u2013219, 1987","journal-title":"Proc. STACS'87, Lect. Not. Comp. Sci."},{"key":"18_CR10","first-page":"55","volume":"33","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages, to appear in Acta Informatica, short version with the title \u201cCompatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages\u201d in: Bull. EATCS 33, 55\u201362, 1987","journal-title":"Bull. EATCS"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0022-0000(86)90060-7","volume":"33","author":"D. Janssens","year":"1986","unstructured":"D. Janssens, G. Rozenberg, E. Welzl: The Bounded Degree Problem for NLC Grammars Is Decidable, Journ. Comp. Syst. Sci. 33, 415\u2013422, 1986","journal-title":"Journ. Comp. Syst. Sci."},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/BFb0025726","volume":"73","author":"H.-J. Kreowski","year":"1979","unstructured":"H.-J. Kreowski: A Pumping Lemma for Context-Free Graph Languages, Lect. Not. Comp. Sci. 73, 270\u2013283, 1979","journal-title":"Lect. Not. Comp. Sci."},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BFb0026094","volume":"299","author":"C. Lautemann","year":"1988","unstructured":"C. Lautemann: Decomposition Trees: Structured Graph Representation and Efficient Algorithms, Proc. CAAP'88, Lect. Not. Comp. Sci. 299, 28\u201339, 1988","journal-title":"Proc. CAAP'88, Lect. Not. Comp. Sci."},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-19488-6_129","volume":"317","author":"T. Lengauer","year":"1988","unstructured":"T. Lengauer, E. Wanke: Efficient Analysis of Graph Properties on Context-Free Graph Languages, Proc. ICALP'88, Lect. Not. Comp. Sci. 317, 379\u2013393, 1988","journal-title":"Proc. ICALP'88, Lect. Not. Comp. Sci."},{"key":"18_CR15","first-page":"136","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl: Boundary NLC Graph Grammars \u2014 Basic Definitions, Normal Forms, and Complexity, Inf. Contr. 69, 136\u2013167, 1986","journal-title":"Normal Forms, and Complexity, Inf. Contr."},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages, Acta Informatica 23, 289\u2013309, 1986","journal-title":"Acta Informatica"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0020-0190(82)90086-2","volume":"14","author":"A.O. Slisenko","year":"1982","unstructured":"A.O. Slisenko: Context-Free Graph Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems, Inf. Proc. Lett. 14, 52\u201356, 1982","journal-title":"Inf. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50939-9_138.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:05Z","timestamp":1605647945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50939-9_138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540509394","9783540461166"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-50939-9_138","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}