{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:12:41Z","timestamp":1725732761343},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664505"},{"type":"electronic","value":"9783662010693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-662-01069-3_30","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T14:47:02Z","timestamp":1371739622000},"page":"199-206","source":"Crossref","is-referenced-by-count":0,"title":["Optimieren \u00fcber alle kombinatorischen Einbettungen eines planaren Graphen"],"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","reference":[{"issue":"5","key":"30_CR1","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Battista","year":"1996","unstructured":"G. Di Battista and R. Tamassia. On-line planarity testing. SIAM Journal on Computing, 25 (5): 956 - 997, October 1996.","journal-title":"SIAM Journal on Computing"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-63307-3_72","volume":"1272","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 - 344, 1998.","journal-title":"Lecture Notes in Computer Science"},{"issue":"1","key":"30_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 - 94, 1989.","journal-title":"Networks"},{"issue":"1","key":"30_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 - 109, 1990.","journal-title":"Algorithmica"},{"issue":"3","key":"30_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 - 352, 1993.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G Battista","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 - 326, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-58950-3_384","volume":"894","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 - 297, 1995.","journal-title":"Lecture Notes in Computer Science"},{"key":"30_CR8","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 - 32, 1937.","journal-title":"Fundamenta Mathematicae"},{"key":"30_CR9","volume-title":"Proceedings of the Seventh Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 1610 of LNCS. Springer Verlag","author":"P Mutzel","year":"1999","unstructured":"P. Mutzel and R. Weiskircher. Optimizing over all combinatorial embeddings of a planar graph. In Proceedings of the Seventh Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 1610 of LNCS. Springer Verlag, 1999."},{"issue":"3","key":"30_CR10","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 - 444, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"30_CR11","volume-title":"Personal communications","author":"G. J","year":"1998","unstructured":"G. J. Woeginger. personal communications, July 1998."}],"container-title":["Informatik aktuell","Informatik\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-01069-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T22:18:58Z","timestamp":1645827538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-01069-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664505","9783662010693"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-01069-3_30","relation":{},"ISSN":["1431-472X"],"issn-type":[{"type":"print","value":"1431-472X"}],"subject":[],"published":{"date-parts":[[1999]]}}}