{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:44Z","timestamp":1725488504800},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424239"},{"type":"electronic","value":"9783540446347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_32","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"339-351","source":"Crossref","is-referenced-by-count":1,"title":["Upward Embeddings and Orientations of Undirected Planar Graphs"],"prefix":"10.1007","author":[{"given":"Walter","family":"Didimo","sequence":"first","affiliation":[]},{"given":"Maurizio","family":"Pizzonia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"32_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":"32_CR2","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum numbr of bends. IEEE Transactions on Computers, 49(8), 2000.","DOI":"10.1109\/12.868028"},{"issue":"12","key":"32_CR3","doi-asserted-by":"publisher","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"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"P. Bertolazzi, G. Di Battista, C. Mannino, and R. Tamassia. Optimal upward planarity testing of single-source digraphs. SIAM J. Comput., 27(1):13\u2013169, 1998.","journal-title":"SIAM J. Comput."},{"key":"32_CR5","unstructured":"M. Bousset. A flow model of low complexity for twisting a layout. In Workshop of GD\u201993, pages 43\u201344, Paris, 1993."},{"key":"32_CR6","unstructured":"J. Czyzowicz, A. Pelc, and I. Rival. Drawing orders with few slopes. Technical Report TR-87-12, Department of Computer Science, University of Ottawa, 1987."},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(94)00085-R","volume":"56","author":"H. Fraysseix de","year":"1995","unstructured":"H. de Fraysseix, P. O. de Mendez, and P. Rosenstiehl. Bipolar orientations revisited. Discrete Appl. Math., 56:157\u2013179, 1995.","journal-title":"Discrete Appl. Math."},{"key":"32_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"W. Didimo and M. Pizzonia. Upward embeddings and orientations of undirected planar graphs. Technical Report RT-DIA-65-2001, University of Roma Tre, 2001.","DOI":"10.1007\/3-540-44634-6_32"},{"key":"32_CR10","unstructured":"S. Fialko and P. Mutzel. A new approximation algorithm for the planar augmentation problem. In Symposium on Discrete Algorithms (SODA\u2019 98), pages 260\u2013269, 1998."},{"key":"32_CR11","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":"32_CR12","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), volume 1190 of Lecture Notes Comput. Sci., pages 201\u2013216. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62495-3_49"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"G. Kant and H. L. Bodlaender. Planar graph augmentation problems. In Proc. 2nd Workshop Algorithms Data Struct., volume 519 of Lecture Notes Comput. Sci., pages 286\u2013298. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0028270"},{"key":"32_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."},{"issue":"3","key":"32_CR15","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., 27(3):636\u2013665, 1975.","journal-title":"Canad. J. Math."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick and S. K. Wismath. Weighted visibility graphs of bars and related flow problems. In Proc. 1st Workshop Algorithms Data Struct., volume 382 of Lecture Notes Comput. Sci., pages 325\u2013334. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51542-9_28"},{"key":"32_CR17","unstructured":"M. Pizzonia. Engineering of Graph Drawing Algorithms for Applications. PhD thesis, Dipartimento di Informatica e Sistemistica, Universit\u00e0 \u201cLa Sapienza\u201d di Roma, 2001."},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"I. Rival. Reading, drawing, and order. In I. G. Rosenberg and G. Sabidussi, editors, Algebras and Orders, pages 359\u2013404. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-94-017-0697-1_9"},{"issue":"4","key":"32_CR19","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. Discrete Comput. Geom., 1(4):321\u2013341, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"32_CR20","unstructured":"S. K. Wismath. Bar-Representable Visibility Graphs and Related Flow Problems. Ph.D. thesis, Dept. Comput. Sci., Univ. British Columbia, 1989."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:11Z","timestamp":1556748731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}