{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:03Z","timestamp":1759638123978},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_39","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"415-426","source":"Crossref","is-referenced-by-count":3,"title":["Classification of Planar Upward Embedding"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Auer","sequence":"first","affiliation":[]},{"given":"Christian","family":"Bachmaier","sequence":"additional","affiliation":[]},{"given":"Franz Josef","family":"Brandenburg","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Glei\u00dfner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-18469-7_7","volume-title":"Graph Drawing","author":"C. Auer","year":"2011","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Brunner, W., Glei\u00dfner, A.: Plane Drawings of Queue and Deque Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 68\u201379. Springer, Heidelberg (2011)"},{"key":"39_CR2","unstructured":"Auer, C., Brandenburg, F.J., Bachmaier, C., Glei\u00dfner, A.: Classification of planar upward embedding. Technical Report MIP-1106, Fakult\u00e4t f\u00fcr Informatik und Mathematik, Universit\u00e4t Passau (2011), http:\/\/www.fim.uni-passau.de\/wissenschaftler\/forschungsberichte\/mip-1106.html"},{"issue":"3","key":"39_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"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-02882-3_8","volume-title":"Computing and Combinatorics","author":"C. Bachmaier","year":"2009","unstructured":"Bachmaier, C., Brandenburg, F.J., Brunner, W., F\u00fcl\u00f6p, R.: Coordinate Assignment for Cyclic Level Graphs. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 66\u201375. Springer, Heidelberg (2009)"},{"key":"39_CR5","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)"},{"key":"39_CR6","unstructured":"Dolati, A.: Digraph embedding on t h . In: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008, pp. 11\u201314 (2008)"},{"issue":"11","key":"39_CR7","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":"39_CR8","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":"39_CR9","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":"39_CR10","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 Journal on Computing\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"39_CR11","first-page":"79","volume":"39","author":"K.A. Hansen","year":"2006","unstructured":"Hansen, K.A.: Constant width planar computation characterizes ACC $^{\\mbox{0}}$ . Theor. Comput. Sci.\u00a039(1), 79\u201392 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"39_CR12","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":"39_CR13","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"},{"key":"39_CR14","volume-title":"Introduction to Smooth Manifolds","author":"J.M. Lee","year":"2002","unstructured":"Lee, J.M.: Introduction to Smooth Manifolds. Springer, Heidelberg (2002)"},{"key":"39_CR15","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":"39_CR16","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"},{"key":"39_CR17","volume-title":"Manifolds, Tensor Analysis, and Applications","author":"J.E. Marsen","year":"2001","unstructured":"Marsen, J.E., Ratiu, T., Abraham, R.: Manifolds, Tensor Analysis, and Applications, 3rd edn. Springer, Heidelberg (2001)","edition":"3"},{"key":"39_CR18","volume-title":"Algebraic Topology: An Introduction","author":"W.S. Massey","year":"1967","unstructured":"Massey, W.S.: Algebraic Topology: An Introduction. Springer, Heidelberg (1967)"},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/PL00009344","volume":"19","author":"B. Mohar","year":"1998","unstructured":"Mohar, B., Rosenstiel, P.: Tessellation and visibility representations of maps on the torus. Discrete Comput. Geom.\u00a019, 249\u2013263 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. John Hopkins University Press (2001)","DOI":"10.56021\/9780801866890"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Snyder, J.P.: Map projections \u2013 a working manual. US Geological Survey, 1395 (1987)","DOI":"10.3133\/pp1395"},{"issue":"2","key":"39_CR22","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":"39_CR23","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"},{"key":"39_CR24","volume-title":"Complexity Theory - Exploring the Limits of Efficient Algorithms","author":"I. Wegener","year":"2005","unstructured":"Wegener, I.: Complexity Theory - Exploring the Limits of Efficient Algorithms. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T21:11:10Z","timestamp":1686517870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}