{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:18Z","timestamp":1725525318739},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_29","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"334-344","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Upward Planarity Testing Algorithm and Related Applications"],"prefix":"10.1007","author":[{"given":"Sarmad","family":"Abbasi","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Healy","sequence":"additional","affiliation":[]},{"given":"Aimal","family":"Rextin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci.\u00a061, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"29_CR2","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/s00453-001-0083-x","volume":"32","author":"P. Bertolazzi","year":"2002","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Quasi-upward planarity. Algorithmica\u00a032(3), 474\u2013506 (2002)","journal-title":"Algorithmica"},{"issue":"6","key":"29_CR3","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica\u00a012(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput.\u00a027(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Chan, H.: A parameterized algorithm for upward planarity testing. In: Proceedings of ESA, pp. 157\u2013168 (2004)","DOI":"10.1007\/978-3-540-30140-0_16"},{"volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","year":"1999","author":"G. Battista Di","key":"29_CR6","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Healy, P., Lynch, K.: Fixed-parameter tractable algorithms for testing upward planarity. In: Proceedings of SOFSEM, pp. 199\u2013208 (2005)","DOI":"10.1007\/978-3-540-30577-4_23"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539792235906","volume":"25","author":"M.D. Hutton","year":"1996","unstructured":"Hutton, M.D., Lubiw, A.: Upward planar drawing of single-source acyclic digraphs. SIAM J. Comput.\u00a025(2), 291\u2013311 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2-3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","volume":"63","author":"D. Kelly","year":"1987","unstructured":"Kelly, D.: Fundamentals of planar ordered sets. Discrete Math\u00a063(2-3), 197\u2013216 (1987)","journal-title":"Discrete Math"},{"volume-title":"Graph algorithms and NP-completeness","year":"1984","author":"K. Mehlhorn","key":"29_CR11","unstructured":"Mehlhorn, K.: Graph algorithms and NP-completeness. Springer, New York (1984)"},{"volume-title":"LEDA: a platform for combinatorial and geometric computing","year":"1999","author":"K. Mehlhorn","key":"29_CR12","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: a platform for combinatorial and geometric computing. Cambridge University Press, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T03:13:42Z","timestamp":1551755622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":12,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-00202-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}
