{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:22Z","timestamp":1725487282098},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_13","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"139-149","source":"Crossref","is-referenced-by-count":5,"title":["An Algorithmic Framework for Visualizing Statecharts"],"prefix":"10.1007","author":[{"given":"R.","family":"Castell\u00f3","sequence":"first","affiliation":[]},{"given":"R.","family":"Mili","sequence":"additional","affiliation":[]},{"given":"I. G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., (4):235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.","key":"13_CR2"},{"unstructured":"G. Booch, I. Jacobson, and J. Rumbaugh. The Unified Modeling Language User Guide. Addison-Wesley, 1998.","key":"13_CR3"},{"unstructured":"R. Castell\u00f3, R. Mili, and I. G. Tollis. Automatic layout of statecharts. Technical Report UTD-04-00, University of Texas at Dallas, 2000.","key":"13_CR4"},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-63938-1_58","volume-title":"Drawing clustered graphs on an orthogonal grid","author":"P. Eades","year":"1997","unstructured":"P. Eades and Q. Feng. Drawing clustered graphs on an orthogonal grid. In G. Di Battista, editor, Graph Drawing (Proceedings GD\u201997), pages 146\u2013157. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353."},{"key":"13_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-62495-3_42","volume-title":"Straight-line drawing algorithms for hierarchical graphs and clustered graphs","author":"P. Eades","year":"1997","unstructured":"P. Eades, Q. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, Graph Drawing (Proceedings GD\u201996), pages 113\u2013128. Springer-Verlag, 1997. Lecture Notes in Computer Science 1190."},{"issue":"32","key":"13_CR7","first-page":"214","volume":"19","author":"E.R.G. Koutsofios","year":"1993","unstructured":"E.R.G., E. Koutsofios, S.C. North, and K. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(32):214\u2013230, March 1993.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"11","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"18","author":"E. R. Gansner","year":"1988","unstructured":"E. R. Gansner, S. C. North, and K. P. Vo. Dag-a program that draws directed graphs. Software Practice and Experience, 18(11):1047\u20131062, November 1988.","journal-title":"Software Practice and Experience"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(3):231\u2013274, June 1987.","journal-title":"Science of Computer Programming"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/32.54292","volume":"16","author":"D. Harel","year":"1990","unstructured":"D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. Shtull-Trauring, and M. Trakhtenbrot. Statemate: A working environment for the development of complex reactive systems. IEEE Transactions on Software Engineering, 16(4):403\u2013414, May 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"doi-asserted-by":"crossref","unstructured":"D. Harel and G. Yashchin. An algorithm for blob hierarchy layout. In Proceedings of International Conference on Advanced Visual Interfaces, AVI\u20192000, Palermo, Italy, May 1990.","key":"13_CR11","DOI":"10.1145\/345513.345240"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1559\/152304075784313304","volume":"2","author":"E. Imhof","year":"1975","unstructured":"E. Imhof. Positioning names on maps. The American Cartographer, 2(2):128\u2013144, 1975.","journal-title":"The American Cartographer"},{"key":"13_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-63938-1_60","volume-title":"An algorithm for labeling edges of hierarchical drawings","author":"K. G. Kakoulis","year":"1997","unstructured":"K. G. Kakoulis and I. G. Tollis. An algorithm for labeling edges of hierarchical drawings. In G. Di Battista, editor, Graph Drawing (Proceedings GD\u201997), pages 169\u2013180. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353."},{"key":"13_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-62495-3_52","volume-title":"On the edge label placement problem","author":"K. G. Kakoulis","year":"1997","unstructured":"K. G. Kakoulis and I. G. Tollis. On the edge label placement problem. In S. North, editor, Graph Drawing (Proceedings GD\u201996), pages 241\u2013256. Springer-Verlag, 1997. Lecture Notes in Computer Science 1190."},{"doi-asserted-by":"crossref","unstructured":"E. S. Kuh and T. Ohtsuki. Recent advances in VLSI layout. Proceedings of the IEEE, 78(2):237\u2013263, 1990.","key":"13_CR15","DOI":"10.1109\/5.52212"},{"doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, 1990.","key":"13_CR16","DOI":"10.1007\/978-3-322-92106-2_3"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/21.101131","volume":"21","author":"E. B. Messinger","year":"1991","unstructured":"E. B. Messinger, L. A. Rowe, and R. R. Henry. A divide-an-conquer algorithm for the automatic layout of large graphs. IEEE Transactions on Systems, Man, and Cybernetics, 21(1):1\u201311, February 1991.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"unstructured":"R. O\u2019Donnel, B. Waldt, and J. Bergstrand. Automatic code for embedded systems based on formal methods. Available from Telelogic over the Internet. http:\/\/www.Telelogic.se\/solution\/techpap.asp . Accessed on April 1999.","key":"13_CR18"},{"unstructured":"J. Peterson. Overcoming the crisis in real-time software development. Available from Objectime over the Internet. http:\/\/www.Objectime.on.ca\/otl\/technical\/crisis.pdf . Accessed on April 1999.","key":"13_CR19"},{"key":"13_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Which aesthetic has the greatest effect on human understanding","author":"H. Purchase","year":"1997","unstructured":"H. Purchase. Which aesthetic has the greatest effect on human understanding. In G. Di Battista, editor, Graph Drawing (Proceedings GD\u201997), pages 248\u2013261. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353."},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/spe.4380170107","volume":"17","author":"L. A. Rowe","year":"1987","unstructured":"L. A. Rowe, M. Davis, E. Messinger, and C. Meyer. A bowser for directed graphs. Software Practice and Experience, 17(1):61\u201376, January 1987.","journal-title":"Software Practice and Experience"},{"key":"13_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-63938-1_86","volume-title":"Extending the sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams","author":"J. Seeman","year":"1997","unstructured":"J. Seeman. Extending the sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams. In G. Di Battista, editor, Graph Drawing (Proceedings GD\u201997), pages 415\u2013424. Springer-Verlag, 1997. Lecture Notes in Computer Science 1353."},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","volume":"57","author":"L. Stockmeyer","year":"1983","unstructured":"L. Stockmeyer. Optimal orientations of cells in slicing floorplan designs. Information and Control, (57):91\u2013101, 1983.","journal-title":"Information and Control"},{"issue":"2","key":"13_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109\u2013125, February 1981.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"doi-asserted-by":"crossref","unstructured":"S. Wimer, I. Koren, and I. Cederbaum. Floorplans, planar graphs and layout. IEEE Transactions on Circuits and Systems, pages 267\u2013278, 1988.","key":"13_CR25","DOI":"10.1109\/31.1739"},{"issue":"2","key":"13_CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1179\/caj.1972.9.2.99","volume":"9","author":"P. Yoeli","year":"1972","unstructured":"P. Yoeli. The logic of automated map lettering. The Cartographic Journal, 9(2):99\u2013108, 1972.","journal-title":"The Cartographic Journal"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:19:24Z","timestamp":1556666364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}