{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:23Z","timestamp":1725512003993},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70904-6_14","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T15:44:43Z","timestamp":1179416683000},"page":"126-137","source":"Crossref","is-referenced-by-count":2,"title":["Planarity Testing and Optimal Edge Insertion with Embedding Constraints"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C. Batini","year":"1984","unstructured":"Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity relationship diagrams. Journal of Systems and Software\u00a04, 163\u2013173 (1984)","journal-title":"Journal of Systems and Software"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6hringer, K.-F., Paulisch, F.N.: Using constraints to achieve stability in automatic graph layout algorithms. In: Proc.\u00a0of CHI-90, pp. 43\u201351 (1990)","DOI":"10.1145\/97243.97250"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36151-0_1","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., Eiglsperger, M., Kaufmann, M., Wagner, D.: Sketch-driven orthogonal graph drawing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 1\u201311. Springer, Heidelberg (2002)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-63938-1_66","volume-title":"Graph Drawing","author":"U. Brandes","year":"1997","unstructured":"Brandes, U., Wagner, D.: A bayesian paradigm for dynamic graph layout. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 236\u2013247. Springer, Heidelberg (1997)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear algorithm for embedding planar graphs using PQ-trees. J. Computer and System Sciences\u00a030, 54\u201376 (1985)","journal-title":"J. Computer and System Sciences"},{"issue":"11","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1002\/spe.474","volume":"32","author":"G. Battista Di","year":"2002","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Drawing database schemas. Softw. Pract. Exper.\u00a032(11), 1065\u20131098 (2002), doi:10.1002\/spe.474","journal-title":"Softw. Pract. Exper."},{"issue":"5","key":"14_CR7","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.7155\/jgaa.00044","volume":"6","author":"C. Dornheim","year":"2002","unstructured":"Dornheim, C.: Planar graphs with topological constraints. J. Graph Algorithms Appl.\u00a06(1), 27\u201366 (2002), \n                    \n                      http:\/\/www.cs.brown.edu\/publications\/jgaa\/accepted\/2002\/Dornheim2002.6.1.pdf","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"14_CR10","unstructured":"Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. Technical Report TR06-1-005, Chair of Algorithm Engineering, University of Dortmund (2006)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-24595-7_2","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2004","unstructured":"Gutwenger, C., Mutzel, P.: An experimental study of crossing minimization heuristics. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 13\u201324. Springer, Heidelberg (2004)"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-004-1128-8","volume":"41","author":"C. Gutwenger","year":"2005","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica\u00a041(4), 289\u2013308 (2005)","journal-title":"Algorithmica"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. Journal of the ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"Journal of the ACM"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BFb0021824","volume-title":"Graph Drawing","author":"S.C. North","year":"1996","unstructured":"North, S.C.: Incremental layout in DynaDAG. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 409\u2013418. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:25Z","timestamp":1605762685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709039","9783540709046"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_14","relation":{},"subject":[]}}