{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:05Z","timestamp":1725548945962},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118043"},{"type":"electronic","value":"9783642118050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_11","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T07:45:33Z","timestamp":1267775133000},"page":"94-106","source":"Crossref","is-referenced-by-count":5,"title":["Upward Planarization Layout"],"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":"11_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"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Pietrosanti, E., Tamassia, R., Tollis, I.G.: Automatic layout of PERT diagrams with X-PERT. In: Proc. IEEE Workshop on Visual Languages, pp. 171\u2013176 (1989)","DOI":"10.1109\/WVL.1989.77060"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45848-4_3","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., K\u00f6pf, B.: Fast and simple horizontal coordinate assignment. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 31\u201344. Springer, Heidelberg (2002)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0020-0190(01)00200-9","volume":"81","author":"J. Branke","year":"2002","unstructured":"Branke, J., Leppert, S., Middendorf, M., Eades, P.: Width-restricted layering of acyclic digraphs with consideration of dummy nodes. Inf. Process. Lett.\u00a081(2), 59\u201363 (2002)","journal-title":"Inf. Process. Lett."},{"key":"11_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":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-68552-4_5","volume-title":"Experimental Algorithms","author":"M. Chimani","year":"2008","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.-M.: Layer-free upward crossing minimization. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 55\u201368. Springer, Heidelberg (2008)"},{"issue":"6","key":"11_CR7","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-6","key":"11_CR8","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-6), 303\u2013325 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom.\u00a07(4), 381\u2013401 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"11_CR10","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."},{"issue":"3","key":"11_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."},{"key":"11_CR12","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":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-36151-0_10","volume-title":"Graph Drawing","author":"P. Healy","year":"2002","unstructured":"Healy, P., Nikolov, N.S.: A branch-and-cut approach to the directed acyclic graph layering problem. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 98\u2013109. Springer, Heidelberg (2002)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45848-4_2","volume-title":"Graph Drawing","author":"P. Healy","year":"2002","unstructured":"Healy, P., Nikolov, N.S.: How to layer a directed acyclic graph. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 16\u201330. Springer, Heidelberg (2002)"},{"issue":"5","key":"11_CR15","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.dam.2005.05.023","volume":"154","author":"N.S. Nikolov","year":"2006","unstructured":"Nikolov, N.S., Tarassov, A.: Graph layering by promotion of nodes. Discrete Applied Mathematics\u00a0154(5), 848\u2013860 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR16","unstructured":"OGDF \u2013 the Open Graph Drawing Framework. Technical University of Dortmund, Chair of Algorithm Engineering, \n                    \n                      http:\/\/www.ogdf.net"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom.\u00a01(1), 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"11_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-11805-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:58Z","timestamp":1606185838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}