{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:51Z","timestamp":1725552171486},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_21","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"223-234","source":"Crossref","is-referenced-by-count":2,"title":["Non-planar Core Reduction of Graphs"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[]},{"given":"Markus","family":"Chimani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Chimani, M., Gutwenger, C.: On the minimum cut of planarizations. Technical report, University of Dortmund, Germany (2005)"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl.\u00a07, 303\u2013325 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintanance of triconnected components with SPQR-trees. Algorithmica\u00a015, 302\u2013318 (1996)","journal-title":"Algorithmica"},{"issue":"5","key":"21_CR4","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":"3","key":"21_CR5","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 J. Algebraic Discrete Methods\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"21_CR6","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":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"21_CR8","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":"21_CR9","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. J. ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C. Kuratowski","year":"1930","unstructured":"Kuratowski, C.: Sur le probl\u00e8me des courbes gauches en topologie. Fundamenta Mathematicae\u00a015, 271\u2013283 (1930)","journal-title":"Fundamenta Mathematicae"},{"issue":"1","key":"21_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00032","volume":"5","author":"A. Liebers","year":"2001","unstructured":"Liebers, A.: Planarizing graphs \u2014 A survey and annotated bibliography. J. Graph Algorithms and Applications\u00a05(1), 1\u201374 (2001)","journal-title":"J. Graph Algorithms and Applications"},{"key":"21_CR12","first-page":"727","volume":"24","author":"P.C. Liu","year":"1979","unstructured":"Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. Congr. Numerantium\u00a024, 727\u2013738 (1979)","journal-title":"Congr. Numerantium"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1017\/S030500410006028X","volume":"93","author":"A. Mansfield","year":"1983","unstructured":"Mansfield, A.: Determining the thickness of graphs is NP-hard. Math. Proc. Camb. Philos. Soc.\u00a093, 9\u201323 (1983)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P. Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: A survey. Graphs and Combinatorics\u00a014(1), 59\u201373 (1998)","journal-title":"Graphs and Combinatorics"},{"issue":"4","key":"21_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF02454162","volume":"15","author":"J. \u0160ir\u00e1\u0148","year":"1984","unstructured":"\u0160ir\u00e1\u0148, J.: Additivity of the crossing number of graphs with connectivity 2. Periodica Mathematica Hungarica\u00a015(4), 301\u2013305 (1984)","journal-title":"Periodica Mathematica Hungarica"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:11Z","timestamp":1619507531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11618058_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}