{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:24:55Z","timestamp":1769570695788,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319501055","type":"print"},{"value":"9783319501062","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_28","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"357-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Note on the Practicality of Maximal Planar Subgraph Algorithms"],"prefix":"10.1007","author":[{"given":"Markus","family":"Chimani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tilo","family":"Wiedera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"28_CR1","unstructured":"BarabasiAlbertGenerator of the java universal network\/graph framework. \n                      http:\/\/jung.sourceforge.net"},{"issue":"2\u20133","key":"28_CR2","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. J. Syst. Softw. 4(2\u20133), 163\u2013173 (1984)","journal-title":"J. Syst. Softw."},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer, J.M., Myrvold, W.J.: On the cutting edge: simplified $$\\cal{O}(n)$$ planarity by edge addition. J. Graph Algorithms Appl. 8(2), 241\u2013273 (2004)","journal-title":"J. Graph Algorithms Appl."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/jagm.1997.0920","volume":"27","author":"G C\u0103linescu","year":"1998","unstructured":"C\u0103linescu, G., Fernandes, C., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. J. Algorithms 27, 269\u2013302 (1998)","journal-title":"J. Algorithms"},{"key":"28_CR5","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, Chap. 17, pp. 543\u2013569. CRC Press (2014). \n                      http:\/\/www.ogdf.net"},{"issue":"7","key":"28_CR6","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1016\/j.disc.2007.12.078","volume":"309","author":"M Chimani","year":"2009","unstructured":"Chimani, M., Gutwenger, C.: Non-planar core reduction of graphs. Discrete Math. 309(7), 1838\u20131855 (2009)","journal-title":"Discrete Math."},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"729","DOI":"10.7155\/jgaa.00264","volume":"16","author":"M Chimani","year":"2012","unstructured":"Chimani, M., Gutwenger, C.: Advances in the planarization method: effective multiple edge insertions. J. Graph Algorithms Appl. 16(3), 729\u2013757 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-44543-4_26","volume-title":"Combinatorial Algorithms","author":"M Chimani","year":"2016","unstructured":"Chimani, M., Hedtke, I., Wiedera, T.: Limits of greedy approximation algorithms for the maximum planar subgraph problem. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 334\u2013346. Springer, Heidelberg (2016). doi:\n                      10.1007\/978-3-319-44543-4_26"},{"key":"28_CR9","unstructured":"Chimani, M., Hlinen\u00fd, P.: Inserting multiple edges into a planar graph. CoRR abs\/1509.07952 (2015). \n                      http:\/\/arxiv.org\/abs\/1509.07952"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-77537-9_17","volume-title":"Graph Drawing","author":"M Chimani","year":"2008","unstructured":"Chimani, M., Mutzel, P., Schmidt, J.M.: Efficient extraction of multiple kuratowski subdivisions. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 159\u2013170. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-77537-9_17"},{"issue":"56","key":"28_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G Di Battista","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. 7(56), 303\u2013325 (1997)","journal-title":"Comput. Geom."},{"issue":"06","key":"28_CR12","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1142\/S0218195900000358","volume":"10","author":"G Di Battista","year":"2000","unstructured":"Di Battista, G., Garg, A., Liotta, G., Parise, A., Tassinari, R., Tassinari, E., Vargiu, F., Vismara, L.: Drawing directed acyclic graphs: an experimental study. Int. J. Comput. Geom. Appl. 10(06), 623\u2013648 (2000)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"28_CR13","unstructured":"Hochstein, J.M., Weihe, K.: Maximum $$s$$-$$t$$-flow with $$k$$ crossings in $$\\cal{O}$$(k$$^3 n \\log n)$$. In: Proceedings of the SODA 2007, pp. 843\u2013847. ACM-SIAM (2007)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/11533719_80","volume-title":"Computing and Combinatorics","author":"W-L Hsu","year":"2005","unstructured":"Hsu, W.-L.: A linear time algorithm for finding a maximal planar subgraph based on PC-trees. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 787\u2013797. Springer, Heidelberg (2005). doi:\n                      10.1007\/11533719_80"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P.: Maximum planar subgraphs and nice embeddings: practical layout tools. Algorithmica 16(1), 33\u201359 (1996)","journal-title":"Algorithmica"},{"key":"28_CR16","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: An updated library on steiner tree problems in graphs. Technical report ZIB-Report 00\u201337, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (2000). \n                      http:\/\/elib.zib.de\/steinlib"},{"issue":"1","key":"28_CR17","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 problme des courbes gauches en topologie. Fundamenta Mathematicae 15(1), 271\u2013283 (1930)","journal-title":"Fundamenta Mathematicae"},{"key":"28_CR18","unstructured":"Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. In: Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 727\u2013738 (1979). Congress. Numer., XXIII-XXIV, Utilitas Math., Winnipeg, Man"},{"issue":"1\u20132","key":"28_CR19","first-page":"179","volume":"223","author":"W Shih","year":"1999","unstructured":"Shih, W., Hsu, W.: A new planarity test. Theor. Comput. Sci. 223(1\u20132), 179\u2013191 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"28_CR20","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1017\/S0963548399003867","volume":"8","author":"A Steger","year":"1999","unstructured":"Steger, A., Wormald, N.C.: Generating random regular graphs quickly. Comb. Probab. Comput. 8(4), 377\u2013396 (1999)","journal-title":"Comb. Probab. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:42:18Z","timestamp":1600476138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}