{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:11:19Z","timestamp":1725577879122},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_13","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"141-152","source":"Crossref","is-referenced-by-count":2,"title":["Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints"],"prefix":"10.1007","author":[{"given":"Markus","family":"Chimani","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]},{"given":"Miro","family":"Sp\u00f6nemann","sequence":"additional","affiliation":[]},{"given":"Hoi-Ming","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Baburin, D.E.: Using graph based representations in reengineering. In: Proc. CSMR 2002, pp. 203\u2013206 (2002)","DOI":"10.1109\/CSMR.2002.995805"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C. Batini","year":"1984","unstructured":"Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity relationship diagrams. J. Syst. Software\u00a04, 163\u2013173 (1984)","journal-title":"J. Syst. Software"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1137\/05062706X","volume":"20","author":"D. Bokal","year":"2006","unstructured":"Bokal, D., Fijavz, G., Mohar, B.: The minor crossing number. SIAM J. Discrete Math.\u00a020, 344\u2013356 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR4","first-page":"31","volume-title":"Proc. Graph Drawing 2001","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., K\u00f6pf, B.: Fast and simple horizontal coordinate assignment. In: Proc. Graph Drawing 2001, London, UK, pp. 31\u201344. Springer, Heidelberg (2002)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44541-2_22","volume-title":"Graph Drawing","author":"C. Buchheim","year":"2001","unstructured":"Buchheim, C., J\u00fcnger, M., Leipert, S.: A fast layout algorithm for k-level graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 229\u2013240. Springer, Heidelberg (2001)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-77120-3_18","volume-title":"Algorithms and Computation","author":"M. Chimani","year":"2007","unstructured":"Chimani, M., Gutwenger, C.: Algorithms for the hypergraph and the minor crossing number problems. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 184\u2013195. Springer, Heidelberg (2007)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.-M.: Layer-free upward crossing minimization. ACM Journal of Experimental Algorithmics\u00a015 (2010)","DOI":"10.1145\/1671970.1671975"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-11805-0_11","volume-title":"Graph Drawing","author":"M. Chimani","year":"2010","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.-M.: Upward planarization layout. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 94\u2013106. Springer, Heidelberg (2010)"},{"key":"13_CR9","first-page":"3","volume-title":"Proc. SODA 2000","author":"M. Eiglsperger","year":"2000","unstructured":"Eiglsperger, M., F\u00f6\u00dfmeier, U., Kaufmann, M.: Orthogonal graph drawing with constraints. In: Proc. SODA 2000, pp. 3\u201311. SIAM, Philadelphia (2000)"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.7155\/jgaa.00122","volume":"10","author":"T. Eschbach","year":"2006","unstructured":"Eschbach, T., Guenther, W., Becker, B.: Orthogonal hypergraph drawing for improved visibility. J. Graph Algorithms Appl.\u00a010(2), 141\u2013157 (2006)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"13_CR11","first-page":"214","volume":"19","author":"E. Gansner","year":"1993","unstructured":"Gansner, E., Koutsofios, E., North, S., Vo, K.-P.: A technique for drawing directed graphs. Software Pract. Exper.\u00a019(3), 214\u2013229 (1993)","journal-title":"Software Pract. Exper."},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.7155\/jgaa.00160","volume":"12","author":"C. Gutwenger","year":"2008","unstructured":"Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. J. Graph Algorithms Appl.\u00a012(1), 73\u201395 (2008)","journal-title":"J. Graph Algorithms Appl."},{"key":"13_CR13","first-page":"37","volume-title":"Proc. Graph Drawing 2000","author":"G.W. Klau","year":"2001","unstructured":"Klau, G.W., Klein, K., Mutzel, P.: An experimental comparison of orthogonal compaction algorithms. In: Proc. Graph Drawing 2000, London, UK, pp. 37\u201351. Springer, Heidelberg (2001)"},{"key":"13_CR14","unstructured":"Sander, G.: Graph layout through the VCG tool. Technical Report A03\/94, Universit\u00e4t des Saarlandes, FB 14 Informatik, 66041 Saarbr\u00fccken (October 1994)"},{"key":"13_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":"13_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":"13_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":"13_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 Trans. Sys. Man. Cyb.\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Sys. Man. Cyb."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T03:42:25Z","timestamp":1553398945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}