{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T02:45:32Z","timestamp":1784342732163,"version":"3.55.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Visual Languages & Computing"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1016\/j.jvlc.2013.11.005","type":"journal-article","created":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T12:31:47Z","timestamp":1386937907000},"page":"89-106","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":30,"title":["Drawing layered graphs with port constraints"],"prefix":"10.1016","volume":"25","author":[{"given":"Christoph Daniel","family":"Schulze","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miro","family":"Sp\u00f6nemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reinhard","family":"von Hanxleden","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jvlc.2013.11.005_bib1","unstructured":"W. Barth, M. J\u00fcnger, P. Mutzel, Simple and efficient bilayer cross counting, in: Proceedings of the 10th International Symposium on Graph Drawing (GD'02), vol. 2528, Lecture Notes in Computer Sciences, Springer, 2002, pp. 331\u2013360."},{"key":"10.1016\/j.jvlc.2013.11.005_bib2","doi-asserted-by":"crossref","unstructured":"U. Brandes, B. K\u00f6pf, Fast and simple horizontal coordinate assignment, in: Proceedings of the 9th International Symposium on Graph Drawing (GD'01), vol. 2265, Lecture Notes in Computer Sciences, Springer, 2002, pp. 33\u201336. https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1007\/3-540-45848-4.","DOI":"10.1007\/3-540-45848-4"},{"key":"10.1016\/j.jvlc.2013.11.005_bib3","doi-asserted-by":"crossref","unstructured":"M. Broy, Challenges in automotive software engineering, in: Proceedings of the 28th International Conference on Software Engineering (ICSE'06), pp. 33\u201342.","DOI":"10.1145\/1134285.1134292"},{"key":"10.1016\/j.jvlc.2013.11.005_bib4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","article-title":"A fast and effective heuristic for the feedback arc set problem","volume":"47","author":"Eades","year":"1993","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.jvlc.2013.11.005_bib5","unstructured":"M. Eiglsperger, M. Siebenhaller, M. Kaufmann, An efficient implementation of Sugiyama's algorithm for layered graph drawing, in: J. Pach (Ed.), 12th International Symposium on Graph Drawing (GD'04), vol. 3383, Lecture Notes in Computer Sciences, Springer-Verlag, 2004, pp. 155\u2013166."},{"key":"10.1016\/j.jvlc.2013.11.005_bib6","doi-asserted-by":"crossref","unstructured":"J. Eker, J.W. Janneck, E.A. Lee, J. Liu, X. Liu, J. Ludvig, S. Neuendorffer, S. Sachs, Y. Xiong, Taming heterogeneity\u2014the Ptolemy approach, in: Proceedings of the IEEE 91 (2003) 127\u2013144. https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1109\/JPROC.2002.805829","DOI":"10.1109\/JPROC.2002.805829"},{"key":"10.1016\/j.jvlc.2013.11.005_bib7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.7155\/jgaa.00122","article-title":"Orthogonal hypergraph drawing for improved visibility","volume":"10","author":"Eschbach","year":"2006","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.jvlc.2013.11.005_bib8","unstructured":"M. Forster, A fast and simple heuristic for constrained two-level crossing reduction, in: Proceedings of the 12th International Symposium on Graph Drawing (GD'04), vol. 3383, Lecture Notes in Computer Sciences, Springer, 2005, pp. 206\u2013216."},{"key":"10.1016\/j.jvlc.2013.11.005_bib9","first-page":"406","article-title":"Design patterns","volume":"vol. 707","author":"Gamma","year":"1993"},{"key":"10.1016\/j.jvlc.2013.11.005_bib10","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/32.221135","article-title":"A technique for drawing directed graphs","volume":"19","author":"Gansner","year":"1993","journal-title":"Softw. Eng."},{"key":"10.1016\/j.jvlc.2013.11.005_bib11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is NP-complete","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebr. Discret. Methods"},{"key":"10.1016\/j.jvlc.2013.11.005_bib12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.7155\/jgaa.00160","article-title":"Planarity testing and optimal edge insertion with embedding constraints","volume":"12","author":"Gutwenger","year":"2008","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.jvlc.2013.11.005_bib13","unstructured":"M. Harrigan, P. Healy, Practical level planarity testing and layout with embedding constraints, in: Proceedings of the 15th International Symposium on Graph Drawing (GD'07), vol. 4875, Lecture Notes in Computer Sciences, Springer, 2008, pp. 62\u201368."},{"key":"10.1016\/j.jvlc.2013.11.005_bib14","series-title":"Handbook of Graph Drawing and Visualization","first-page":"409","article-title":"Hierarchical drawing algorithms","author":"Healy","year":"2013"},{"key":"10.1016\/j.jvlc.2013.11.005_bib15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","article-title":"2-layer straightline crossing minimization","volume":"1","author":"J\u00fcnger","year":"1997","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.jvlc.2013.11.005_bib16","unstructured":"L.K. Klauske, Effizientes Bearbeiten von Simulink Modellen mit Hilfe eines spezifisch angepassten Layoutalgorithmus (Ph.D. thesis), Technische Universit\u00e4t Berlin, 2012."},{"key":"10.1016\/j.jvlc.2013.11.005_bib17","unstructured":"L.K. Klauske, C. Dziobek, Improving modeling usability: automated layout generation for Simulink, in: Proceedings of the MathWorks Automotive Conference (MAC'10)."},{"key":"10.1016\/j.jvlc.2013.11.005_bib18","doi-asserted-by":"crossref","unstructured":"L.K. Klauske, C.D. Schulze, M. Sp\u00f6nemann, R. von Hanxleden, Improved layout for data flow diagrams with port constraints, in: Proceedings of the 7th International Conference on the Theory and Application of Diagrams (DIAGRAMS'12), vol. 7352, Lecture Notes in Artificial Intelligence, Springer, 2012, pp. 65\u201379. https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1007\/978-3-642-31223-6.","DOI":"10.1007\/978-3-642-31223-6"},{"key":"10.1016\/j.jvlc.2013.11.005_bib19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1142\/S0218126603000751","article-title":"Actor-oriented design of embedded hardware and software systems","volume":"12","author":"Lee","year":"2003","journal-title":"J. Circuits Syst. Comput. (JCSC)"},{"key":"10.1016\/j.jvlc.2013.11.005_bib20","unstructured":"H.C. Purchase, Which aesthetic has the greatest effect on human understanding?, in: Proceedings of the 5th International Symposium on Graph Drawing (GD'97), vol. 1353, Lecture Notes in Computer Sciences, Springer, 1997, pp. 248\u2013261."},{"key":"10.1016\/j.jvlc.2013.11.005_bib21","unstructured":"G. Sander, Graph Layout Through the VCG Tool, Technical Report A03\/94, Universit\u00e4t des Saarlandes, FB 14 Informatik, 66041 Saarbr\u00fccken, 1994."},{"key":"10.1016\/j.jvlc.2013.11.005_bib22","unstructured":"G. Sander, Layout of directed hypergraphs with orthogonal hyperedges, in: Proceedings of the 11th International Symposium on Graph Drawing (GD'03), vol. 2912, Lecture Notes in Computer Sciences, Springer, 2004, pp. 381\u2013386."},{"key":"10.1016\/j.jvlc.2013.11.005_bib23","unstructured":"F. Schreiber, Visualisierung biochemischer Reaktionsnetze (Ph.D. thesis), Universit\u00e4t Passau, Fakult\u00e4t f\u00fcr Informatik und Mathematik, 2001."},{"key":"10.1016\/j.jvlc.2013.11.005_bib24","unstructured":"M. Siebenhaller, Orthogonal graph drawing with constraints: algorithms and applications (Ph.D. thesis), Universit\u00e4t T\u00fcbingen, Mathematisch-naturwissenschaftliche Fakult\u00e4t, 2009."},{"key":"10.1016\/j.jvlc.2013.11.005_bib25","doi-asserted-by":"crossref","unstructured":"M. Sp\u00f6nemann, H. Fuhrmann, R. von Hanxleden, P. Mutzel, Port constraints in hierarchical layout of data flow diagrams, in: Proceedings of the 17th International Symposium on Graph Drawing (GD'09), vol. 5849, Lecture Notes in Computer Sciences, Springer, 2010, pp. 135\u2013146. https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1007\/978-3-642-11805-0.","DOI":"10.1007\/978-3-642-11805-0"},{"key":"10.1016\/j.jvlc.2013.11.005_bib26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","article-title":"Methods for visual understanding of hierarchical system structures","volume":"11","author":"Sugiyama","year":"1981","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/j.jvlc.2013.11.005_bib27","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","article-title":"Automatic graph drawing and readability of diagrams","volume":"18","author":"Tamassia","year":"1988","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/j.jvlc.2013.11.005_bib28","unstructured":"V. Waddle, Graph layout for displaying data structures, in: Proceedings of the 8th International Symposium on Graph Drawing (GD'00), vol. 1984, Lecture Notes in Computer Sciences, Springer, 2001, pp. 98\u2013103."},{"key":"10.1016\/j.jvlc.2013.11.005_bib29","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","article-title":"Cognitive measurements of graph aesthetics","volume":"1","author":"Ware","year":"2002","journal-title":"Inf. Vis."}],"container-title":["Journal of Visual Languages & Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1045926X13000943?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1045926X13000943?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:50:31Z","timestamp":1746075031000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1045926X13000943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["S1045926X13000943"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jvlc.2013.11.005","relation":{},"ISSN":["1045-926X"],"issn-type":[{"value":"1045-926X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Drawing layered graphs with port constraints","name":"articletitle","label":"Article Title"},{"value":"Journal of Visual Languages & Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jvlc.2013.11.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}