{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:12Z","timestamp":1725456612505},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_13","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:42:25Z","timestamp":1350895345000},"page":"103-113","source":"Crossref","is-referenced-by-count":4,"title":["The Duals of Upward Planar Graphs on Cylinders"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Auer","sequence":"first","affiliation":[]},{"given":"Christian","family":"Bachmaier","sequence":"additional","affiliation":[]},{"given":"Franz J.","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Glei\u00dfner","sequence":"additional","affiliation":[]},{"given":"Kathrin","family":"Hanauer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Glei\u00dfner, A., Hanauer, K.: The duals of upward planar graphs on cylinders. Tech. Rep. MIP-1204, Faculty of Informatics and Mathematics, University of Passau (2012), \n                    \n                      http:\/\/www.fim.uni-passau.de\/en\/research\/forschungsberichte\/mip-1204.html","DOI":"10.1007\/978-3-642-34611-8_13"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/978-3-642-22233-7","volume-title":"GD 2011","author":"C. Auer","year":"2011","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Glei\u00dfner, A.: Classification of Planar Upward Embedding. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 415\u2013426. Springer, Heidelberg (2011)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TVCG.2007.1000","volume":"13","author":"C. Bachmaier","year":"2007","unstructured":"Bachmaier, C.: A radial adaption of the Sugiyama framework for visualizing hierarchical information. IEEE Trans. Vis. Comput. Graphics\u00a013(3), 583\u2013594 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.7155\/jgaa.00254","volume":"16","author":"C. Bachmaier","year":"2012","unstructured":"Bachmaier, C., Brandenburg, F.J., Brunner, W., F\u00fcl\u00f6p, R.: Drawing recurrent hierarchies. J. Graph Alg. App.\u00a016(2), 151\u2013198 (2012)","journal-title":"J. Graph Alg. App."},{"key":"13_CR5","unstructured":"Bang-Jensen, J., Cutin, G.: Digraphs: Theory, Algorithms and Applications, 1st edn. Springer (2000)"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/s00453-001-0083-x","volume":"32","author":"P. Bertolazzi","year":"2002","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica\u00a032(3), 474\u2013506 (2002)","journal-title":"Algorithmica"},{"key":"13_CR7","unstructured":"Brandenburg, F.J.: On the curve complexity of upward planar drawings. In: Mestre, J. (ed.) Computing: The Australasian Theory Symposium, CATS 2012. Conferences in Research and Practice in Information Technology (CRPIT), vol.\u00a0128, pp. 27\u201336. Australian Computer Society, ACS (2012)"},{"issue":"2-3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci.\u00a061(2-3), 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR9","unstructured":"Dolati, A.: Digraph embedding on t\n                  \n                    h\n                  . In: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008, pp. 11\u201314 (2008)"},{"issue":"11","key":"13_CR10","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1016\/j.disc.2006.09.053","volume":"308","author":"A. Dolati","year":"2008","unstructured":"Dolati, A., Hashemi, S.M.: On the sphericity testing of single source digraphs. Discrete Math.\u00a0308(11), 2175\u20132181 (2008)","journal-title":"Discrete Math."},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1216\/RMJ-2008-38-1-107","volume":"38","author":"A. Dolati","year":"2008","unstructured":"Dolati, A., Hashemi, S.M., Kosravani, M.: On the upward embedding on the torus. Rocky Mt. J. Math.\u00a038(1), 107\u2013121 (2008)","journal-title":"Rocky Mt. J. Math."},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0012-365X(92)90343-E","volume":"102","author":"S. Foldes","year":"1992","unstructured":"Foldes, S., Rival, I., Urrutia, J.: Light sources, obstructions and spherical orders. Discrete Math.\u00a0102(1), 13\u201323 (1992)","journal-title":"Discrete Math."},{"issue":"2","key":"13_CR13","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."},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00224-005-1258-7","volume":"39","author":"K.A. Hansen","year":"2006","unstructured":"Hansen, K.A.: Constant width planar computation characterizes ACC0. Theor. Comput. Sci.\u00a039(1), 79\u201392 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1023\/A:1006095702164","volume":"14","author":"S.M. Hashemi","year":"1998","unstructured":"Hashemi, S.M., Rival, I., Kisielewicz, A.: The complexity of upward drawings on spheres. Order\u00a014, 327\u2013363 (1998)","journal-title":"Order"},{"issue":"1-3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0012-365X(00)00249-1","volume":"233","author":"S.M. Hashemi","year":"2001","unstructured":"Hashemi, S.M.: Digraph embedding. Discrete Math.\u00a0233(1-3), 321\u2013328 (2001)","journal-title":"Discrete Math."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","volume":"63","author":"D. Kelly","year":"1987","unstructured":"Kelly, D.: Fundamentals of planar ordered sets. Discrete Math.\u00a063, 197\u2013216 (1987)","journal-title":"Discrete Math."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/11672142_54","volume-title":"STACS 2006","author":"N. Limaye","year":"2006","unstructured":"Limaye, N., Mahajan, M., Sarma, J.M.N.: Evaluating Monotone Circuits on Cylinders, Planes and Tori. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 660\u2013671. Springer, Heidelberg (2006)"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00037-009-0265-5","volume":"18","author":"N. Limaye","year":"2009","unstructured":"Limaye, N., Mahajan, M., Sarma, J.M.N.: Upper bounds for monotone planar circuit value and variants. Comput. Complex.\u00a018(3), 377\u2013412 (2009)","journal-title":"Comput. Complex."},{"issue":"2","key":"13_CR21","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. Syst., Man, Cybern.\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00353654","volume":"5","author":"C. Thomassen","year":"1989","unstructured":"Thomassen, C.: Planar acyclic oriented graphs. Order\u00a05(1), 349\u2013361 (1989)","journal-title":"Order"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:00:38Z","timestamp":1620133238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}