{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T04:14:38Z","timestamp":1745381678509,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_14","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T08:02:33Z","timestamp":1580112153000},"page":"158-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Maximum Bipartite Subgraph of Geometric Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Satyabrata","family":"Jana","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Saeed","family":"Mehrabi","sequence":"additional","affiliation":[]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/0206007","volume":"6","author":"K Aoshima","year":"1977","unstructured":"Aoshima, K., Iri, M.: Comments on F. Hadlock\u2019s paper: finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 6(1), 86 (1977)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1137\/140980053","volume":"30","author":"M Ba\u00efou","year":"2016","unstructured":"Ba\u00efou, M., Barahona, F.: Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs. SIAM J. Discrete Math. 30(2), 1290\u20131301 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR3","first-page":"211","volume-title":"Lecture Notes in Computer Science","author":"Prosenjit Bose","year":"2019","unstructured":"Bose, P., et al.: Computing maximum independent set on outerstring graphs and their relatives. In: Proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS 2019), Edmonton, AB, Canada (2019)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-56402-0_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Brandst\u00e4dt","year":"1993","unstructured":"Brandst\u00e4dt, A.: On improved time bounds for permutation graph problems. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol. 657, pp. 1\u201310. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56402-0_30"},{"doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 4\u20136 January 2009, pp. 892\u2013901 (2009)","key":"14_CR5","DOI":"10.1137\/1.9781611973068.97"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1137\/0402004","volume":"2","author":"H Choi","year":"1989","unstructured":"Choi, H., Nakajima, K., Rim, C.S.: Graph bipartization and via minimization. SIAM J. Discrete Math. 2(1), 38\u201347 (1989)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"14_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1137\/060650015","volume":"21","author":"D Cornaz","year":"2007","unstructured":"Cornaz, D., Mahjoub, A.R.: The maximum induced bipartite subgraph problem with edge weights. SIAM J. Discrete Math. 21(3), 662\u2013675 (2007)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"14_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s002360050088","volume":"34","author":"Y Daniel Liang","year":"1997","unstructured":"Daniel Liang, Y., Chang, M.S.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Informatica 34(5), 337\u2013346 (1997)","journal-title":"Acta Informatica"},{"key":"14_CR10","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"14_CR11","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W.H. Freeman, New York (2002)"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4(3), 221\u2013225 (1975)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"issue":"08","key":"14_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.4236\/jcc.2016.48003","volume":"4","author":"H Honma","year":"2016","unstructured":"Honma, H., Nakajima, Y., Sasaki, A.: An algorithm for the feedback vertex set problem on a normal helly circular-arc graph. J. Comput. Commun. 4(08), 23 (2016)","journal-title":"J. Comput. Commun."},{"doi-asserted-by":"crossref","unstructured":"Jana, S., Maheshwari, A., Mehrabi, S., Roy, S.: Maximum bipartite subgraph of geometric intersection graphs. CoRR abs\/1909.03896 (2019)","key":"14_CR15","DOI":"10.1007\/978-3-030-39881-1_14"},{"issue":"1","key":"14_CR16","first-page":"85","volume":"31","author":"J Kratochv\u00edl","year":"1990","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: Independent set and clique problems in intersection-defined classes of graphs. Commentationes Mathematicae Universitatis Carolinae 31(1), 85\u201393 (1990)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"10","key":"14_CR17","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1016\/j.dam.2007.10.006","volume":"156","author":"D Kratsch","year":"2008","unstructured":"Kratsch, D., M\u00fcller, H., Todinca, I.: Feedback vertex set on AT-free graphs. Discrete Appl. Math. 156(10), 1936\u20131947 (2008)","journal-title":"Discrete Appl. Math."},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-319-26626-8_46","volume-title":"Combinatorial Optimization and Applications","author":"A Lahiri","year":"2015","unstructured":"Lahiri, A., Mukherjee, J., Subramanian, C.R.: Maximum independent set on $$B_1$$-VPG graphs. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 633\u2013646. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_46"},{"doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Saurabh, S., Sikdar, S.: Simpler parameterized algorithm for OCT. In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravic\u00ed, Czech Republic, 28 June\u20132 July 2009, Revised Selected Papers. pp. 380\u2013384 (2009)","key":"14_CR19","DOI":"10.1007\/978-3-642-10217-2_37"},{"unstructured":"Lokshtanov, D., Saurabh, S., Wahlstr\u00f6m, M.: Subexponential parameterized odd cycle transversal on planar graphs. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, Hyderabad, India, 15\u201317 December 2012, pp. 424\u2013434 (2012)","key":"14_CR20"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(96)00193-7","volume":"61","author":"CL Lu","year":"1997","unstructured":"Lu, C.L., Tang, C.Y.: A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Inf. Process. Lett. 61(2), 107\u2013111 (1997)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Marx, D.: Efficient approximation schemes for geometric problems? In: 13th Annual European Symposium on Algorithms - ESA 2005, Palma de Mallorca, Spain, 3\u20136 October 2005, Proceedings, pp. 448\u2013459 (2005)","key":"14_CR22","DOI":"10.1007\/11561071_41"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11847250_14","volume-title":"Parameterized and Exact Computation","author":"D Marx","year":"2006","unstructured":"Marx, D.: Parameterized complexity of independence and domination on geometric graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 154\u2013165. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11847250_14"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-46515-7_16","volume-title":"Discrete and Computational Geometry","author":"T Matsui","year":"2000","unstructured":"Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 194\u2013200. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46515-7_16"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2017.07.007","volume":"127","author":"SC Nandy","year":"2017","unstructured":"Nandy, S.C., Pandit, S., Roy, S.: Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127, 58\u201361 (2017)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"14_CR26","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"BA Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"9","key":"14_CR27","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/81.414831","volume":"42","author":"CS Rim","year":"1995","unstructured":"Rim, C.S., Nakajima, K.: On rectangle intersection and overlap graphs. IEEE Trans. Circ. Syst. I Fundam. Theory Appl. 42(9), 549\u2013553 (1995)","journal-title":"IEEE Trans. Circ. Syst. I Fundam. Theory Appl."},{"unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 1\u20133 May 1978, pp. 253\u2013264 (1978)","key":"14_CR28"},{"issue":"2","key":"14_CR29","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM J. Comput. 10(2), 310\u2013327 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T23:19:15Z","timestamp":1665616755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}