{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:12:43Z","timestamp":1764587563796},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_395","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:55:31Z","timestamp":1330275331000},"page":"416-427","source":"Crossref","is-referenced-by-count":14,"title":["Designing graph drawings by layout graph grammars"],"prefix":"10.1007","author":[{"given":"Franz J.","family":"Brandenburg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"45_CR1","unstructured":"W. Bachl, F.J. Brandenburg, T. Hickl \u201dHierarchical Graph Design Using HiGraD\u201d Technical Report, University of Passau, MIP 9405 (1994)"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BFb0035847","volume":"294","author":"F.J. Brandenburg","year":"1988","unstructured":"F.J. Brandenburg \u201dOn polynomial time graph grammars\u201d Lecture Notes in Computer Science 294 (1988), pp. 227\u2013236","journal-title":"Lecture Notes in Computer Science"},{"key":"45_CR3","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BFb0017387","volume":"532","author":"F.J. Brandenburg","year":"1991","unstructured":"F.J. Brandenburg \u201dLayout Graph Grammars: the Placement Approach\u201d Lecture Notes in Computer Science 532 (1991), pp. 144\u2013156","journal-title":"Lecture Notes in Computer Science"},{"key":"45_CR4","unstructured":"B. Courcelle \u201dGraph rewriting: An algebraic and logic approach\u201d Handbook of Theoret. Comput. Science, Vol. B, Elsevier (1990), pp. 193\u2013242"},{"key":"45_CR5","unstructured":"B. Courcelle \u201dOn the structure of context-free sets of graphs generated by vertex replacement\u201d Research Report 91-44, Bordeaux University (1991)"},{"key":"45_CR6","unstructured":"B. Courcelle, J. Engelfriet \u201dA logical characterization of the sets of hypergraphs defines by hyperedge replacement grammars\u201d Research Report 91-41, Bordeaux University (1991)"},{"key":"45_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"P. Crescenzi, G. Di Battista, A. Piperno \u201dA note on optimal area algorithms for upward drawings of binary trees\u201d Comput. Geometry: Theory and Applications 2 (1992), pp. 187\u2013200","journal-title":"Comput. Geometry: Theory and Applications"},{"key":"45_CR8","volume-title":"Technical Report","author":"G. Battista Di","year":"1993","unstructured":"G. Di Battista, P. Eades, R. Tamassia, I. Tollis \u201dAlgorithms for Drawing Graphs: an Annotated Bibliography\u201d Technical Report, Brown University, Providence (1993)"},{"key":"45_CR9","unstructured":"P. Eades, T. Lin \u201dAlgorithmic and declarative approaches to aesthetic layout\u201d Proc. Graph Drawing '93 (1993), pp. 95\u201396"},{"key":"45_CR10","unstructured":"P. Eades, T. Lin, X. Lin \u201dMinimum Size h-v Drawings\u201d Proc. Advanced Visual Interfaces (1992) World Scientific Series in Computer Science Vol. 36, pp. 386\u2013394"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, G. Rozenberg (Eds.) \u201dGraph Grammars and their Application to Computer Science\u201d Lecture Notes in Computer Science 532 (1991)","DOI":"10.1007\/BFb0017372"},{"key":"45_CR12","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-51498-8_15","volume":"380","author":"J. Engelfriet","year":"1989","unstructured":"J. Engelfriet \u201dContext-free NCE graph grammars\u201d Lecture Notes in Computer Science 380 (1989), pp. 148\u2013161","journal-title":"Lecture Notes in Computer Science"},{"key":"45_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S1045-926X(05)80013-8","volume":"1","author":"E.J. Golin","year":"1990","unstructured":"E.J. Golin, S.P. Reiss \u201dThe Specification of Visual Language Syntax\u201d J. Visual Languages 1 (1990), pp. 141\u2013157","journal-title":"J. Visual Languages"},{"key":"45_CR14","unstructured":"T. Hickl \u201dRechtwinkeliges Layout von hierarchisch strukturierten Graphen\u201d University of Passau (1994)"},{"key":"45_CR15","unstructured":"M. Himsolt \u201dKonzeption und Implementierung von Grapheneditoren\u201d Dissertation, University of Passau (1993)"},{"key":"45_CR16","unstructured":"J.E. Hopcroft, J.D. Ullman \u201dIntroduction to Automata Theory, Languages and Computation\u201d Addison\/Wesley (1979)"},{"key":"45_CR17","unstructured":"C.L. McCreary, C.L. Combs, D.H. Gill, J.V. Warren \u201dAn automated graph drawing system using graph decomposition\u201d Proc. Graph Drawing '93 (1993), pp. 119\u2013120"},{"key":"45_CR18","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl \u201dBoundary NLC graph grammars \u2014 basic definitions, normal forms and complexity\u201d Inform. Control 69 (1986), pp. 136\u2013167","journal-title":"Inform. Control"},{"key":"45_CR19","unstructured":"R. Schuster \u201dGraph Grammatiken und Graph Einbettungen: Algorithmen und Komplexit\u00e4t\u201d Technical Report, University of Passau, MIP 8711 (1987)"},{"key":"45_CR20","unstructured":"J. D. Ullman \u201dComputational Aspects of VLSI\u201d Computer Science Press (1984)"},{"key":"45_CR21","unstructured":"G. Zin\u00dfmeister \u201dLayout of trees with attribute graph grammars\u201d Proc. Graph Drawing '93 (1993), pp. 99\u2013102"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_395.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:37Z","timestamp":1619572897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_395","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}