{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:41Z","timestamp":1725664121038},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_356","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:55Z","timestamp":1330257355000},"page":"52-63","source":"Crossref","is-referenced-by-count":1,"title":["On bend-minimum orthogonal upward drawing of directed planar graphs"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"F\u00f6\u00dfmeier","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"6_CR1","first-page":"272","volume":"621","author":"P. Bertolazzi","year":"1992","unstructured":"Bertolazzi, P., R.F. Cohen, G. Di Battista, R. Tamassia and I.G. Tollis, How to Draw a Series-Parallel Digraph, Proc. 3rd Scandinavian Workshop on Algorithm Theory, LNCS 621, (1992), pp. 272\u2013283.","journal-title":"LNCS"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Di Battista, G., G. Liotta and F. Vargiu, Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-planar Graphs, Proc. 3nd Workshop on Algorithms and Data Structures, (1993), Lecture Notes in Comp. Science 709, pp. 151\u2013162.","DOI":"10.1007\/3-540-57155-8_244"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"G. Battista Di","year":"1990","unstructured":"Di Battista, G., W.P. Liu, and I. Rival, Bipartite Graphs, Upward Drawings and Planarity, Information Processing Letters. vol. 36, (1990), pp. 317\u2013322.","journal-title":"Information Processing Letters"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G. and R. Tamassia, Algorithms for Plane Representations of Acyclic Digraphs, Theoretical Computer Science Vol.61, (1988), pp. 175\u2013198.","journal-title":"Theoretical Computer Science"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., R. Tamassia and I.G. Tollis, Area Requirement and Symmetry Display in Drawing Graphs, Discrete and Comp. Geometry 7 (1992), pp. 381\u2013401.","journal-title":"Discrete and Comp. Geometry"},{"key":"6_CR6","unstructured":"Eades, P., B. McKay and N. Wormald, On an Edge Crossing Problem, Proc. 9th Australian Computer Science Conf., (1986), pp. 327\u2013334."},{"key":"6_CR7","unstructured":"F\u00f6\u00dfmeier, U. and M. Kaufmann, An Approach for Bend-Minimal Upward Drawing, Workshop of GD'93, Paris (1993), pp. 27\u201329."},{"key":"6_CR8","volume-title":"Report CS-94-10","author":"A. Garg","year":"1994","unstructured":"Garg, A. and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Report CS-94-10, Comp. Sci. Dep., Brown Univ., Providence (1994), this proceedings."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","volume":"27","author":"I. Kelly","year":"1975","unstructured":"Kelly, I. and I. Rival, Planar Lattices, Canadian J. Mathematics, Vol. 27, (1975), pp. 636\u201366.","journal-title":"Canadian J. Mathematics"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J.A. Storer","year":"1984","unstructured":"Storer, J.A., On Minimal Node-cost Planar Embeddings, Networks 14 (1984), pp. 181\u2013212.","journal-title":"Networks"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., S. Tagawa and M. Toda, Methods for Visual Understanding of Hierarchical Systems, IEEE Trans. on Systems, Man and Cybernetics, Vol, SMC-11, (1981), pp. 109\u2013125.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R., On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM J. Comput. 16 (1987), pp. 421\u2013444.","journal-title":"SIAM J. Comput."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R. and I.G. Tollis, A Unified Approach to Visibility Representations of Planar Graphs, Discrete and Comput. Geometry 1 (1986), pp. 321\u2013341.","journal-title":"Discrete and Comput. Geometry"},{"key":"6_CR14","unstructured":"Tamassia, R. and I.G. Tollis, Efficient Embedding of Planar Graphs in Linear Time, Proc. IEEE Int. Symp. on Circuits and Systems, Philadelphia, (1987), pp. 495\u2013498."},{"key":"6_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E., Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, (1983), Chapter 8."},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00353654","volume":"5","author":"C. Thomassen","year":"1989","unstructured":"Thomassen, C., Planar Acyclic Oriented Graphs, Order, Vol. 5, (1989), pp. 349\u2013361.","journal-title":"Order"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_356.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:21:21Z","timestamp":1619558481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_356","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}