{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:25:48Z","timestamp":1766377548701},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_385","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:54:53Z","timestamp":1330275293000},"page":"298-306","source":"Crossref","is-referenced-by-count":24,"title":["Upward planarity testing of outerplanar dags (extended abstract)"],"prefix":"10.1007","author":[{"given":"Achilleas","family":"Papakostas","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi and G. Di Battista, On upward drawing testing of triconnected digraphs, Proc. 7th ACM Symp. on Computational Geometry, pp. 272\u2013280, 1991.","DOI":"10.1145\/109648.109679"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, C. Mannino and R. Tamassia, Optimal upward planarity testing of single-source digraphs, In 1st Annual European Symp. on Algorithms, Lecture Notes in Comp. Sci., Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57273-2_42"},{"key":"35_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":"G. Di Battista, W.P. Liu, I. Rival, Bipartite graphs, Upward drawings and Planarity, Information Processing Letters, vol. 36, pp. 317\u2013322, 1990.","journal-title":"Information Processing Letters"},{"key":"35_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":"G. Di Battista and R. Tamassia, Algorithms for plane representations of acyclic digraphs, Theoretical Computer Science, vol. 61, pp. 175\u2013198, 1988.","journal-title":"Theoretical Computer Science"},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica, vol. 10, pp. 41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, to appear in Proc. of Graph Drawing 1994.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach., vol. 21, pp. 549\u2013568, 1974.","journal-title":"J. Assoc. Comput. Mach."},{"key":"35_CR8","unstructured":"M.D. Hutton and A. Lubiw, Upward planar drawing of single source acyclic digraphs, Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pp. 203\u2013211, 1990."},{"key":"35_CR9","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, On the dimension of partially ordered sets, Discrete Math., vol. 63, pp. 197\u2013216, 1987.","journal-title":"Discrete Math."},{"key":"35_CR10","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\u201339, 1976.","journal-title":"J. Combin. Theory Ser. B"},{"key":"35_CR11","unstructured":"W. Schnyder, Embedding planar graphs on the grid, Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pp. 138\u2013147, 1990."}],"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_385.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:52Z","timestamp":1605648292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_385","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}