{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:38:36Z","timestamp":1766378316639},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_29","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"373-384","source":"Crossref","is-referenced-by-count":4,"title":["Finding Triangles for Maximum Planar Subgraphs"],"prefix":"10.1007","author":[{"given":"Parinya","family":"Chalermsook","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"6","key":"29_CR1","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/0222068","volume":"22","author":"J Cai","year":"1993","unstructured":"Cai, J., Han, X., Tarjan, R.E.: An $$O(m \\log n)$$ -time algorithm for the maximal planar subgraph problem. SIAM J. Comput. 22(6), 1142\u20131162 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"29_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jagm.1997.0920","volume":"27","author":"G C\u0103linescu","year":"1998","unstructured":"C\u0103linescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. J. Algorithms 27(2), 269\u2013302 (1998)","journal-title":"J. Algorithms"},{"issue":"2","key":"29_CR3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00453-002-1020-3","volume":"36","author":"G C\u0103linescu","year":"2003","unstructured":"C\u0103linescu, G., Fernandes, C.G., Karloff, H.J., Zelikovsky, A.: A new approximation algorithm for finding heavy planar subgraphs. Algorithmica 36(2), 179\u2013205 (2003)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"29_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00453-011-9523-4","volume":"63","author":"G C\u0103linescu","year":"2012","unstructured":"C\u0103linescu, G., Fernandes, C.G., Kaul, H., Zelikovsky, A.: Maximum series-parallel subgraph. Algorithmica 63(1\u20132), 137\u2013157 (2012)","journal-title":"Algorithmica"},{"key":"29_CR5","unstructured":"Chiba, T., Nishioka, I., Shirakawa, I.: An algorithm of maximal planarization of graphs. In: Proceedings of IEEE Symposium on Circuits and Systems, pp. 649\u2013652 (1979)"},{"issue":"1\u20133","key":"29_CR6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0012-365X(94)00326-E","volume":"149","author":"R Cimikowski","year":"1996","unstructured":"Cimikowski, R., Coppersmith, D.: The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. Discret. Math. 149(1\u20133), 303\u2013309 (1996)","journal-title":"Discret. Math."},{"issue":"1","key":"29_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0166-218X(03)00370-6","volume":"141","author":"L Faria","year":"2004","unstructured":"Faria, L., De Figueiredo, C.M.H., Mendon\u00e7a, C.F.X.: On the complexity of the approximation of nonplanarity parameters for cubic graphs. Discret. Appl. Math. 141(1), 119\u2013134 (2004)","journal-title":"Discret. Appl. Math."},{"key":"29_CR8","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010749","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"TF Gonzalez","year":"2007","unstructured":"Gonzalez, T.F.: Handbook of Approximation Algorithms and Metaheuristics. CRC Press, Boca Raton (2007)"},{"issue":"1","key":"29_CR9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/990518.990521","volume":"7","author":"MS Krishnamoorthy","year":"1975","unstructured":"Krishnamoorthy, M.S.: An NP hard problem in bipartite graphs. ACM SIGACT News 7(1), 26 (1975)","journal-title":"ACM SIGACT News"},{"issue":"2","key":"29_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.jctb.2005.04.004","volume":"95","author":"D K\u00fchn","year":"2005","unstructured":"K\u00fchn, D., Osthus, D., Taraz, A.: Large planar subgraphs in dense graphs. J. Comb. Theory, Ser. B 95(2), 263\u2013282 (2005)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"29_CR11","unstructured":"Liu, P.C., Geldmacher, R.C.: On the deletion of nonplanar edges of a graph. In: Proceedings of 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 727\u2013738 (1977)"},{"issue":"3","key":"29_CR12","first-page":"503","volume":"18","author":"T Poranen","year":"2008","unstructured":"Poranen, T.: Two new approximation algorithms for the maximum planar subgraph problem. Acta Cybern. 18(3), 503\u2013527 (2008)","journal-title":"Acta Cybern."},{"key":"29_CR13","doi-asserted-by":"crossref","DOI":"10.1201\/b15385","volume-title":"Handbook of Graph Drawing and Visualization","author":"R Tamassia","year":"2013","unstructured":"Tamassia, R.: Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T17:53:16Z","timestamp":1601661196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}