{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:42:36Z","timestamp":1743086556030,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_29","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"361-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reducing Rank of the Adjacency Matrix by Graph Modification"],"prefix":"10.1007","author":[{"given":"S. M.","family":"Meesum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranabendu","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"29_CR1","unstructured":"Akbari, S., Cameron, P.J., Khosrovshahi, G.B.: Ranks and signatures of adjacency matrices (2004)"},{"issue":"13","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1016\/j.dam.2006.03.031","volume":"154","author":"P Burzyn","year":"2006","unstructured":"Burzyn, P., Bonomo, F., Dur\u00e1n, G.: Np-completeness results for edge modification problems. Discrete Applied Mathematics 154(13), 1824\u20131844 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"29_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. In: STACS, pp. 214\u2013225 (2014)","DOI":"10.1137\/1.9781611973402.9"},{"issue":"3","key":"29_CR5","first-page":"21","volume":"11","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. ACM Transactions on Algorithms (TALG) 11(3), 21 (2015)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-04657-0_24","volume-title":"Algorithms and Computation","author":"P Damaschke","year":"2014","unstructured":"Damaschke, P., Mogren, O.: Editing the simplest graphs. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 249\u2013260. Springer, Heidelberg (2014)"},{"issue":"7","key":"29_CR7","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1016\/j.jcss.2014.04.015","volume":"80","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Journal of Computer and System Sciences 80(7), 1430\u20131447 (2014)","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"29_CR8","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1137\/11085390X","volume":"42","author":"FV Fomin","year":"2013","unstructured":"Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in. SIAM Journal on Computing 42(6), 2197\u20132216 (2013)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-74450-4_4","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"J Guo","year":"2007","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 36\u201347. Springer, Heidelberg (2007)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory of Computing Systems 47(1) (2010)","DOI":"10.1007\/s00224-008-9150-x"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Jukna, S.: Extremal combinatorics: with applications in computer science. Springer Science & Business Media (2011)","DOI":"10.1007\/978-3-642-17364-6"},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<185::AID-JGT9>3.0.CO;2-P","volume":"23","author":"A Kotlov","year":"1996","unstructured":"Kotlov, A., Lov\u00e1sz, L.: The rank and size of graphs. Journal of Graph Theory 23(2), 185\u2013189 (1996)","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is np-complete. Journal of Computer and System Sciences 20(2), 219\u2013230 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"29_CR14","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is np-complete. Discrete Applied Mathematics 131(3), 651\u2013654 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B Reed","year":"2004","unstructured":"Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299\u2013301 (2004)","journal-title":"Operations Research Letters"},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. xiii. the disjoint paths problem. Journal of Combinatorial Theory, Series B 63(1), 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144(1-2) (2004)","DOI":"10.1016\/j.dam.2004.01.007"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion np-complete problems. In: STOC, pp. 253\u2013264. ACM (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T13:01:56Z","timestamp":1675861316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}