{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:42:58Z","timestamp":1725892978691},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660194"},{"type":"electronic","value":"9783540487777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_27","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T13:43:11Z","timestamp":1172842991000},"page":"361-376","source":"Crossref","is-referenced-by-count":8,"title":["Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Petra","family":"Mutzel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Weiskircher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"issue":"5","key":"27_CR1","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 Journal on Computing, 25(5):956\u2013997, October 1996.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR2","series-title":"Lect Notes Comput Sci","first-page":"331","volume-title":"Computing orthogonal drawings with the minimum number of bends","author":"P. Bertolazzi","year":"1998","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. Lecture Notes in Computer Science, 1272:331\u2013344, 1998."},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/net.3230190107","volume":"19","author":"D. Bienstock","year":"1989","unstructured":"D. Bienstock and C. L. Monma. Optimal enclosing regions in planar graphs. Networks, 19(1):79\u201394, 1989.","journal-title":"Networks"},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D. Bienstock","year":"1990","unstructured":"D. Bienstock and C. L. Monma. On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica, 5(1):93\u2013109, 1990.","journal-title":"Algorithmica"},{"issue":"3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1137\/0406027","volume":"6","author":"J. Cai","year":"1993","unstructured":"J. Cai. Counting embeddings of planar graphs using DFS trees. SIAM Journal on Discrete Mathematics, 6(3):335\u2013352, 1993.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303\u2013326, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"P. Eades and P. Mutzel. Algorithms and theory of computation handbook, chapter 9 Graph drawing algorithms. CRC Press, 1999.","DOI":"10.1201\/9781420049503-c10"},{"key":"27_CR8","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"I. Fary. On straight line representing of planar graphs. Acta. Sci. Math.(Szeged), 11:229\u2013233, 1948.","journal-title":"Acta. Sci. Math.(Szeged)"},{"key":"27_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-58950-3_384","volume-title":"On the computational complexity of upward and rectilinear planarity testing","author":"A. Garg","year":"1995","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Lecture Notes in Computer Science, 894:286\u2013297, 1995."},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing, 2(3):135\u2013158, August 1973.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"22","DOI":"10.4064\/fm-28-1-22-32","volume":"28","author":"S. MacLane","year":"1937","unstructured":"S. MacLane. A combinatorial condition for planar graphs. Fundamenta Mathematicae, 28:22\u201332, 1937.","journal-title":"Fundamenta Mathematicae"},{"issue":"3","key":"27_CR12","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 Journal on Computing, 16(3):421\u2013444, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR13","unstructured":"G. J. Woeginger. personal communications, July 1998."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48777-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T10:44:06Z","timestamp":1628505846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}