{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:00:27Z","timestamp":1740096027885,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312229"},{"type":"electronic","value":"9783642312236"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31223-6_11","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T11:59:20Z","timestamp":1340020760000},"page":"65-79","source":"Crossref","is-referenced-by-count":5,"title":["Improved Layout for Data Flow Diagrams with Port Constraints"],"prefix":"10.1007","author":[{"given":"Lars Kristian","family":"Klauske","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph Daniel","family":"Schulze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miro","family":"Sp\u00f6nemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"von Hanxleden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-36151-0_13","volume-title":"Graph Drawing","author":"W. Barth","year":"2002","unstructured":"Barth, W., J\u00fcnger, M., Mutzel, P.: Simple and Efficient Bilayer Cross Counting. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 130\u2013141. Springer, Heidelberg (2002), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/3-540-36151-0_13"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Broy, M.: Challenges in automotive software engineering. In: ICSE 2006: Proceedings of the 28th International Conference on Software Engineering, pp. 33\u201342 (2006)","DOI":"10.1145\/1134285.1134292"},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P. Eades","year":"1993","unstructured":"Eades, P., Lin, X., Smyth, W.F.: A fast and effective heuristic for the feedback arc set problem. Information Processing Letters\u00a047(6), 319\u2013323 (1993)","journal-title":"Information Processing Letters"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/JPROC.2002.805829","volume":"91","author":"J. Eker","year":"2003","unstructured":"Eker, J., Janneck, J.W., Lee, E.A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S., Xiong, Y.: Taming heterogeneity\u2014the Ptolemy approach. Proceedings of the IEEE\u00a091(1), 127\u2013144 (2003)","journal-title":"Proceedings of the IEEE"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-31843-9_22","volume-title":"Graph Drawing","author":"M. Forster","year":"2005","unstructured":"Forster, M.: A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 206\u2013216. Springer, Heidelberg (2005), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-540-31843-9_22"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E.R. Gansner","year":"1993","unstructured":"Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.P.: A technique for drawing directed graphs. Software Engineering\u00a019(3), 214\u2013230 (1993)","journal-title":"Software Engineering"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods\u00a04(3), 312\u2013316 (1983), \n                    \n                      http:\/\/link.aip.org\/link\/?SML\/4\/312\/1","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"11_CR8","unstructured":"Klauske, L.K., Dziobek, C.: Improving modeling usability: Automated layout generation for Simulink. In: Proceedings of the MathWorks Automotive Conference, MAC 2010 (2010)"},{"key":"11_CR9","unstructured":"Klauske, L.K., Dziobek, C.: Effizientes Erstellen von Simulink Modellen mit Hilfe eines spezifisch angepassten Layoutalgorithmus. In: Tagungsband Dagstuhl-Workshop MBEES: Modellbasierte Entwicklung eingebetteter Systeme VII, pp. 115\u2013126 (2011), \n                    \n                      http:\/\/www.in.tu-clausthal.de\/abteilungen\/gi\/Forschung\/MBEES2011\/"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1142\/S0218126603000751","volume":"12","author":"E.A. Lee","year":"2003","unstructured":"Lee, E.A., Neuendorffer, S., Wirthlin, M.J.: Actor-oriented design of embedded hardware and software systems. Journal of Circuits, Systems, and Computers (JCSC)\u00a012(3), 231\u2013260 (2003)","journal-title":"Journal of Circuits, Systems, and Computers (JCSC)"},{"key":"11_CR11","first-page":"151","volume-title":"Actes des Journ\u00e8es d\u2019Informatique Musicale (JIM 2002)","author":"Y. Orlarey","year":"2002","unstructured":"Orlarey, Y., Fober, D., Letz, S.: An algebraic approach to block diagram constructions. In: Actes des Journ\u00e8es d\u2019Informatique Musicale (JIM 2002), pp. 151\u2013158. GMEM, Marseille (2002)"},{"key":"11_CR12","unstructured":"Orlarey, Y., Fober, D., Letz, S.: FAUST: an efficient functional approach to DSP programming. In: Assayag, G., Gerzso, A. (eds.) New Computational Paradigms for Computer Music. Editions Delatour, France (2009)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1997","unstructured":"Purchase, H.C.: Which Aesthetic has the Greatest Effect on Human Understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 248\u2013261. Springer, Heidelberg (1997)"},{"key":"11_CR14","unstructured":"Sander, G.: Graph layout through the VCG tool. Tech. Rep. A03\/94, Universit\u00e4t des Saarlandes, FB 14 Informatik, 66041 Saarbr\u00fccken (October 1994)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BFb0021828","volume-title":"Graph Drawing","author":"G. Sander","year":"1996","unstructured":"Sander, G.: A Fast Heuristic for Hierarchical Manhattan Layout. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 447\u2013458. Springer, Heidelberg (1996)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-24595-7_35","volume-title":"Graph Drawing","author":"G. Sander","year":"2004","unstructured":"Sander, G.: Layout of Directed Hypergraphs with Orthogonal Hyperedges. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 381\u2013386. Springer, Heidelberg (2004)"},{"key":"11_CR17","unstructured":"Schreiber, F.: Visualisierung biochemischer Reaktionsnetze. Ph.D. thesis, Universit\u00e4t Passau, Innstrasse 29, 94032 Passau (2001)"},{"key":"11_CR18","unstructured":"Siebenhaller, M.: Orthogonal Graph Drawing with Constraints: Algorithms and Applications. Ph.D. thesis, Universit\u00e4t T\u00fcbingen, Wilhelmstr. 32, 72074 T\u00fcbingen (2009)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-11805-0_14","volume-title":"Graph Drawing","author":"M. Sp\u00f6nemann","year":"2010","unstructured":"Sp\u00f6nemann, M., Fuhrmann, H., von Hanxleden, R., Mutzel, P.: Port Constraints in Hierarchical Layout of Data Flow Diagrams. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/21.108304","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"Sugiyama, K., Misue, K.: Visualization of structural information: automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics\u00a021(4), 876\u2013892 (1991)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"2","key":"11_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-44541-2_23","volume-title":"Graph Drawing","author":"V. Waddle","year":"2001","unstructured":"Waddle, V.: Graph Layout for Displaying Data Structures. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 241\u2013252. Springer, Heidelberg (2001)"},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C. Ware","year":"2002","unstructured":"Ware, C., Purchase, H., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization\u00a01(2), 103\u2013110 (2002)","journal-title":"Information Visualization"},{"key":"11_CR24","unstructured":"Wernicke, M.: AUTOSAR auf dem Weg in die Serie. Elektronik Praxis 02 (2008), \n                    \n                      http:\/\/www.elektronikpraxis.vogel.de\/themen\/embeddedsoftwareengineering\/analyseentwurf\/articles\/105576\/"}],"container-title":["Lecture Notes in Computer Science","Diagrammatic Representation and Inference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31223-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T05:42:05Z","timestamp":1556862125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31223-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312229","9783642312236"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31223-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}