{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:43Z","timestamp":1725495883821},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654735"},{"type":"electronic","value":"9783540376231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-37623-2_2","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T07:45:17Z","timestamp":1195458317000},"page":"15-29","source":"Crossref","is-referenced-by-count":5,"title":["Quasi-Upward Planarity"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bertolazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows. In G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, editors, Optimization, volume 1 of Handbooks in Operations Research and Management, pages 211\u2013360. North-Holland, 1990.","DOI":"10.1016\/S0927-0507(89)01005-4"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In Proc. 5th Workshop Algorithms Data Struct., volume 1272 of Lecture Notes Comput. Sci., pages 331\u2013344. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63307-3_72"},{"issue":"12","key":"2_CR3","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/BF01188716","volume":"6","author":"P. Bertolazzi","year":"1994","unstructured":"P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, 6 (12):476\u2013497, 1994.","journal-title":"Algorithmica"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, C. Mannino, and R. Tamassia. Optimal upward planarity testing of single-source digraphs. In Proc. 1st Annu. European Sympos. Algorithms, volume 726 of Lecture Notes Comput. Sci., pages 37\u201348. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57273-2_42"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR6","doi-asserted-by":"publisher","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 drawings and planarity. Inform. Process. Lett., 36:317\u2013322, 1990.","journal-title":"Inform. Process. Lett."},{"key":"2_CR7","doi-asserted-by":"publisher","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., 61:175\u2013198, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., 25:956\u2013997, 1996.","journal-title":"SIAM J. Comput."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD)\u2019 94), volume 894 of Lecture Notes Comput. Sci., pages 286\u2013297. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A. Garg","year":"1995","unstructured":"A. Garg and R. Tamassia. Upward planarity testing. Order, 12:109\u2013133, 1995.","journal-title":"Order"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. A new minimum cost flow algorithm with applications to graph drawing. In S.C. North, editor, Graph Drawing (Proc. GD\u2019 96), Lecture Notes Comput. Sci. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62495-3_49"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2:135\u2013158, 1973.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539792235906","volume":"25","author":"M. D. Hutton","year":"1996","unstructured":"M. D. Hutton and A. Lubiw. Upward planar drawing of single-source acyclic digraphs. SIAM J. Comput., 25(2):291\u2013311, 1996.","journal-title":"SIAM J. Comput."},{"key":"2_CR14","doi-asserted-by":"publisher","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., 63:197\u2013216, 1987.","journal-title":"Discrete Math."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"X. Lin and P. Eades. Area requirements for drawing hierarchically planar graphs. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 219\u2013229. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-63938-1_64"},{"key":"2_CR16","unstructured":"T. Nishizeki and N. Chiba. Planar graphs: Theory and algorithms. Ann. Discrete Math., 32, 1988."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"A. Papakostas. Upward planarity testing of outerplanar dags. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD\u2019 94, volume 894 of Lecture Notes Comput. Sci., pages 298\u2013306. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_385"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. Reingold","year":"1981","unstructured":"E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223\u2013228, 1981.","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","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., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37623-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T15:20:29Z","timestamp":1556983229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}