{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:08:54Z","timestamp":1725455334821},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540607236"},{"type":"electronic","value":"9783540493518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0021798","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:56:38Z","timestamp":1131864998000},"page":"140-151","source":"Crossref","is-referenced-by-count":1,"title":["Upward numbering testing for triconnected graphs"],"prefix":"10.1007","author":[{"given":"M.","family":"Chandramouli","sequence":"first","affiliation":[]},{"given":"A. A.","family":"Diwan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"G. Di Battista and E. Nardelli. An Algorithm for Planarity Testing of Hierarchical Graphs, volume 246 of Lecture Notes in Computer Science, pages 277\u2013289. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17218-1_65"},{"key":"15_CR2","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. Theoretical Computer Science, 61:175\u2013198, 1988.","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, to appear.","DOI":"10.1007\/BF01188716"},{"volume-title":"PhD thesis","year":"1994","author":"M. Chandramouli","key":"15_CR4","unstructured":"M. Chandramouli. Upward Planar Graph Drawings. PhD thesis, IIT Bombay, 1994."},{"key":"15_CR5","unstructured":"M. Chandramouli and A. A. Diwan. Intersection graphs of horizontal and vertical line segments in the plane, 1992. Unpublished manuscript."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. In Graph Drawing 94, DIMACS, 1994.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"L. S. Heath and S. Pemmaraju. Recognizing leveled-planar dags in linear time. In Proceedings of Graph Drawing '95, 1995.","DOI":"10.1007\/BFb0021813"},{"key":"15_CR8","unstructured":"M. D. Hutton and A. Lubiw. Upward planar drawing of single source acyclic digraphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 203\u2013211, 1991."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","volume":"63","author":"D. R. Kelly","year":"1987","unstructured":"D. R. Kelly. Fundamentals of planar ordered sets. Discrete Mathematics, 63:197\u2013216, 1987.","journal-title":"Discrete Mathematics"},{"key":"15_CR10","unstructured":"J. Kratochvil. A special planar satisfiability problem and some consequences of its np-completeness. Discrete Appl. Math. (to appear)."},{"key":"15_CR11","unstructured":"X. Lin. Analysis of Algorithms for Drawing Graphs. PhD thesis, Department of Computer Science, University of Queensland, 1992."},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","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. Disc. and Comp. Geometry, 1(4):321\u2013341, 1986.","journal-title":"Disc. and Comp. Geometry"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0021798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:50:48Z","timestamp":1586551848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0021798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607236","9783540493518"],"references-count":12,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0021798","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}
