{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:29:40Z","timestamp":1725514180798},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540685487"},{"type":"electronic","value":"9783540685524"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68552-4_5","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T09:06:43Z","timestamp":1211965603000},"page":"55-68","source":"Crossref","is-referenced-by-count":3,"title":["Layer-Free Upward Crossing Minimization"],"prefix":"10.1007","author":[{"given":"Markus","family":"Chimani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoi-Ming","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","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"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput.\u00a027(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"5_CR3","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica\u00a012(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"issue":"6","key":"5_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1142\/S0218195900000358","volume":"10","author":"G. Battista Di","year":"2000","unstructured":"Di Battista, G., Garg, A., Liotta, G., Parise, A., Tamassia, R., Tassinari, E., Vargiu, F., Vismara, L.: Drawing directed acyclic graphs: An experimental study. Int. J. Comput. Geom. Appl.\u00a010(6), 623\u2013648 (2000)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"5\u20136","key":"5_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl.\u00a07(5\u20136), 303\u2013325 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"5_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.7155\/jgaa.00067","volume":"7","author":"M. Eiglsperger","year":"2003","unstructured":"Eiglsperger, M., Kaufmann, M., Eppinger, F.: An approach for mixed upward planarization. J. Graph Algorithms Appl.\u00a07(2), 203\u2013220 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-540-31843-9_17","volume-title":"Graph Drawing","author":"M. Eiglsperger","year":"2005","unstructured":"Eiglsperger, M., Siebenhaller, M., Kaufmann, M.: An efficient implementation of Sugiyama\u2019s algorithm for layered graph drawing. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 155\u2013166. Springer, Heidelberg (2005)"},{"issue":"3","key":"5_CR8","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":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-24595-7_2","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2004","unstructured":"Gutwenger, C., Mutzel, P.: An experimental study of crossing minimization heuristics. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 13\u201324. Springer, Heidelberg (2004)"},{"key":"5_CR11","unstructured":"OGDF \u2013 the Open Graph Drawing Framework. Technical University of Dortmund, Chair of Algorithm Engineering, \n                  \n                    http:\/\/www.ogdf.net"},{"issue":"2","key":"5_CR12","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","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68552-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:54:59Z","timestamp":1620017699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68552-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540685487","9783540685524"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68552-4_5","relation":{},"subject":[]}}