{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T23:23:24Z","timestamp":1778887404859,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf01188716","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T05:55:44Z","timestamp":1108706144000},"page":"476-497","source":"Crossref","is-referenced-by-count":95,"title":["Upward drawings of triconnected digraphs"],"prefix":"10.1007","volume":"12","author":[{"given":"P.","family":"Bertolazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. Di","family":"Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Mannino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Graphs","author":"C. Berge","year":"1985","unstructured":"C. Berge,Graphs, North-Holland, Amsterdam, 1985."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"K. Booth and G. Lueker, Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms,J. Comput. System Sci., vol. 13, pp. 335?397, 1976.","journal-title":"J. Comput. System Sci."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"N. Chiba, T. Nishizeki, S. Abe, and T. Ozkwa, A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees,J. Comput. System Sci., vol. 30, pp. 54?76, 1985.","journal-title":"J. Comput. System Sci."},{"key":"CR4","first-page":"75","volume":"13","author":"H. Fraysseix de","year":"1982","unstructured":"H. de Fraysseix and P. Rosenstiehl, A Depth First Characterization of Planarity,Ann. Discrete Math., vol. 13, pp. 75?80, 1982.","journal-title":"Ann. Discrete Math."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"G. Battista Di","year":"1990","unstructured":"G. Di Battista, W. P. Liu, and I. Rival, Bipartite Graphs, Upward Drkwings, and Planarity,Inform. Process. Lett., vol. 36, pp. 317?322, 1990.","journal-title":"Inform. Process. Lett."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia, Algorithms for Plane Representations of Acyclic Digraphs,Theoret. Comput. Sci., vol. 61, pp. 175?198, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"G. Di Battista and R. Tamassia, Incremental Planarity Testing,Proc. 30th IEEE Symposium on Foundations of Computer Science, pp. 436?441, 1989.","DOI":"10.1109\/SFCS.1989.63515"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, R. Tamassia, and I. G. Tollis, Area Requirement and Symmetry Display of Planar Upward Drkwings,Discrete Comput. Geom., vol. 7, pp. 381?401, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"CR9","unstructured":"P. Eades and R. Tamassia, Algorithms for Drkwing Graphs: An Annotated Bibliography, Tech. Report No. CS-89-09, Brown University, 1989."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"P. Eades and L. Xuemin, How To Draw a Directed Graph,Proc. IEEE Workshop on Visual Languages, pp. 13?17, 1989.","DOI":"10.1109\/WVL.1989.77035"},{"key":"CR11","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even,Graph Algorithms, Computer Science Press, Rockville, MD, 1979."},{"issue":"no. 4","key":"CR12","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. E. Tarjan, Efficient Planarity Testing,J. Assoc. Comput. Mach., vol. 21, no. 4, pp. 549?568, 1974.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR13","unstructured":"M. D. Hutton and A. Lubiw, Upward Planar Drawing of Single Source Acyclic Digraphs,Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms, pp. 203?211, 1991."},{"key":"CR14","first-page":"103","volume":"51","author":"R. J\u00e9gan","year":"1987","unstructured":"R. J\u00e9gan, R. Nowakowski, and I. Rival, The Diagram Invariant Problem for Planar Lattices,Acta Sci. Math. (Szeged), vol. 51, pp. 103?121, 1987.","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","volume":"63","author":"D. Kelly","year":"1987","unstructured":"D. Kelly, Fundamentals of Planar Ordered Sets,Discrete Math., vol. 63, pp. 197?216, 1987.","journal-title":"Discrete Math."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","volume":"27","author":"D. Kelly","year":"1975","unstructured":"D. Kelly and I. Rival, Planar Lattices,Canad. J. Math., vol. 27, pp. 636?665, 1975.","journal-title":"Canad. J. Math."},{"key":"CR17","first-page":"215","volume-title":"Theory of Graphs","author":"A. Lempel","year":"1967","unstructured":"A. Lempel, A. Even, and I. Cederbaum, An Algorithm for Planarity Testing of Graphs,Theory of Graphs (International Symposium, Rome, 1966) (P. Rosenstiehl, ed.), Gordon and Breach, New York, pp. 215?232, 1967."},{"key":"CR18","first-page":"71","volume-title":"Annals of Discrete Mathematics, vol. 29","author":"L. Lovasz","year":"1986","unstructured":"L. Lovasz and M. D. Plummer,Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, Amsterdam, p. 71, 1986."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"S. M. Malitz and A. Papakostas, On the Angular Resolution of Planar Graphs,Proc. ACM Symposium on Theory of Computing, 1992.","DOI":"10.1145\/129712.129764"},{"key":"CR20","volume-title":"Annals of Discrete Mathematics","author":"T. Nishizeki","year":"1988","unstructured":"T. Nishizeki and N. Chiba,Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, North-Holland, Amsterdam, 1988."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0095-8956(76)90024-1","volume":"21","author":"C. Platt","year":"1976","unstructured":"C. Platt, Planar Lattices and Planar Graphs,J. Combin. Theory Ser. B, vol. 21, pp. 30?39, 1976.","journal-title":"J. Combin. Theory Ser. B"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-94-009-5315-4_3","volume-title":"Graphs and Orders","author":"I. Rival","year":"1985","unstructured":"I. Rival, The Diagram, inGraphs and Orders (I. Rival, ed.), Reidel, Dordrecht, pp. 103?133, 1985."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-94-009-2639-4_1","volume-title":"Algorithms and Orders","author":"I. Rival","year":"1989","unstructured":"I. Rival, Graphical Data Structures for Ordered Sets, inAlgorithms and Orders (I. Rival, ed.), Kluwer, Boston, pp. 3?31, 1989."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00714475","volume":"4","author":"I. Rival","year":"1988","unstructured":"I. Rival and J. Urrutia, Representing Orders on the Plane by Translating Convex Figures,Order, vol. 4, pp. 319?339, 1988.","journal-title":"Order"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagkwa, and M. Toda, Methods for Visual Understanding of Hierarchical Systems,IEEE Trans. Systems Man Cybernet., vol. 11, pp. 109?125, 1981.","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends,SIAM J. Comput., vol. 16, pp. 421?444, 1987.","journal-title":"SIAM J. Comput."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini, Automatic Graph Drawing and Readability of Diagrams,IEEE Trans. Systems Man Cybernet., vol. 18, pp. 61?79, 1988.","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"R. Tamassia and I. G. Tollis, A Unified Approach to Visibility Representations of Planar Graphs,Discrete Comput. Geometry, vol. 1, pp. 321?341, 1986.","journal-title":"Discrete Comput. Geometry"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00353654","volume":"5","author":"C. Thomassen","year":"1989","unstructured":"C. Thomassen, Planar Acyclic Oriented Graphs,Order, vol. 5, pp. 349?361, 1989.","journal-title":"Order"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0095-8956(77)90048-X","volume":"22","author":"W. Trotter","year":"1977","unstructured":"W. Trotter and J. Moore, Jr., The Dimension of Planar Posets,J. Combin. Theory Ser. B, vol. 22, pp. 54?67, 1977.","journal-title":"J. Combin. Theory Ser. B"},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"G. Vijayan, Geometry of Planar Graphs with Angles,Proc. 2nd ACM Symposium on Computational Geometry, pp. 116?124, 1986.","DOI":"10.1145\/10515.10528"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, Congruent Graphs and the Connectivity of Graphs,Amer. J. Math., vol. 54, pp. 150?168, 1932.","journal-title":"Amer. J. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188716.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01188716\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:41:47Z","timestamp":1556714507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01188716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF01188716"],"URL":"https:\/\/doi.org\/10.1007\/bf01188716","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}