{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:35Z","timestamp":1725807875708},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_27","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:12:53Z","timestamp":1417414373000},"page":"319-330","source":"Crossref","is-referenced-by-count":5,"title":["Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports"],"prefix":"10.1007","author":[{"given":"Ulf","family":"R\u00fcegg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Kieffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Dwyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Wybrow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36151-0_1","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., Eiglsperger, M., Kaufmann, M., Wagner, D.: Sketch-driven orthogonal graph drawing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 1\u201311. Springer, Heidelberg (2002)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-18469-7_13","volume-title":"Graph Drawing","author":"M. Chimani","year":"2011","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P., Sp\u00f6nemann, M., Wong, H.M.: Crossing minimization and layouts of directed hypergraphs with port constraints. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 141\u2013152. Springer, Heidelberg (2011)"},{"issue":"5","key":"27_CR3","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TVCG.2006.156","volume":"12","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. IEEE Transactions on Visualization and Computer Graphics\u00a012(5), 821\u2013828 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"6","key":"27_CR4","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TVCG.2009.109","volume":"15","author":"T. Dwyer","year":"2009","unstructured":"Dwyer, T., Lee, B., Fisher, D., Quinn, K.I., Isenberg, P., Robertson, G., North, C.: A comparison of user-generated and automatic graph layouts. IEEE Transactions on Visualization and Computer Graphics\u00a015(6), 961\u2013968 (2009)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11618058_15","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 153\u2013164. Springer, Heidelberg (2006)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-00219-9_41","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2009","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Dunnart: A constraint-based network diagram authoring tool. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 420\u2013431. Springer, Heidelberg (2009)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-00219-9_22","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2009","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Topology preserving constrained graph layout. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 230\u2013241. Springer, Heidelberg (2009)"},{"issue":"6","key":"27_CR8","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"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.C.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-319-03841-4_39","volume-title":"Graph Drawing","author":"S. Kieffer","year":"2013","unstructured":"Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: Incremental grid-like layout using soft and hard constraints. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 448\u2013459. Springer, Heidelberg (2013)"},{"key":"27_CR11","unstructured":"Klauske, L.K.: Effizientes Bearbeiten von Simulink Modellen mit Hilfe eines spezifisch angepassten Layoutalgorithmus. Ph.D. thesis, Technische Universit\u00e4t Berlin (2012)"},{"key":"27_CR12","unstructured":"Klauske, L.K., Dziobek, C.: Improving modeling usability: Automated layout generation for Simulink. In: Proceedings of the MathWorks Automotive Conference, MAC 2010 (2010)"},{"issue":"3","key":"27_CR13","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":"27_CR14","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":"27_CR15","doi-asserted-by":"crossref","unstructured":"R\u00fcegg, U., Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: Stress-minimizing orthogonal layout of data flow diagrams with ports. Technical report (August 2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1408.4626","DOI":"10.1007\/978-3-662-45803-7_27"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jvlc.2013.11.005","volume":"25","author":"C.D. Schulze","year":"2014","unstructured":"Schulze, C.D., Sp\u00f6nemann, M., von Hanxleden, R.: Drawing layered graphs with port constraints. Journal of Visual Languages and Computing, Special Issue on Diagram Aesthetics and Layout\u00a025(2), 89\u2013106 (2014)","journal-title":"Journal of Visual Languages and Computing, Special Issue on Diagram Aesthetics and Layout"},{"key":"27_CR17","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":"2","key":"27_CR18","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":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-11805-0_22","volume-title":"Graph Drawing","author":"M. Wybrow","year":"2010","unstructured":"Wybrow, M., Marriott, K., Stuckey, P.J.: Orthogonal connector routing. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 219\u2013231. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T17:20:53Z","timestamp":1559064053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}