{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:20:01Z","timestamp":1725852001458},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_46","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"619-633","source":"Crossref","is-referenced-by-count":1,"title":["Rank Reduction of Directed Graphs by Vertex and Edge Deletions"],"prefix":"10.1007","author":[{"given":"Syed Mohammad","family":"Meesum","sequence":"first","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"7","key":"46_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"46_CR2","unstructured":"Akbari, S., Cameron, P. J., Khosrovshahi, G. B.: Ranks and signatures of adjacency matrices (2004)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Bliznets, I., Cygan, M., Komosa, P., Mach, L., Pilipczuk, M.: Lower bounds for the parameterized complexity of minimum fill-in and other completion problems. In: SODA 16 (2016, to appear)","DOI":"10.1137\/1.9781611974331.ch79"},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-662-44777-2_15","volume-title":"Algorithms - ESA 2014","author":"I Bliznets","year":"2014","unstructured":"Bliznets, I., Fomin, F.V., Pilipczuk, M., Pilipczuk, M.: A subexponential parameterized algorithm for proper interval completion. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 173\u2013184. Springer, Heidelberg (2014)"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Bliznets, I., Fomin, F.V., Pilipczuk, M., Pilipczuk, M.: A subexponential parameterized algorithm for interval completion. In: SODA 16 (2016, to appear)","DOI":"10.1137\/1.9781611974331.ch78"},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/978-3-662-47672-7_25","volume-title":"Automata, Languages, and Programming","author":"Y Cao","year":"2015","unstructured":"Cao, Y.: Unit interval editing is fixed-parameter tractable. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 306\u2013317. Springer, Heidelberg (2015)"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Cao, Y.: Linear recognition of almost interval graphs. In: SODA 16 (2016, to appear)","DOI":"10.1137\/1.9781611974331.ch77"},{"key":"46_CR8","unstructured":"Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. In: STACS, vol. 25, pp. 214\u2013225. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"issue":"3","key":"46_CR9","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2629595","volume":"11","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. ACM Trans. Algorithms 11(3), 21:1\u201321:35 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"46_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015)"},{"key":"46_CR11","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)"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48350-3_35","volume-title":"Algorithms - ESA 2015","author":"PG Drange","year":"2015","unstructured":"Drange, P.G., Dregi, M.S., Lokshtanov, D., Sullivan, B.D.: On the threshold of intractability. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9242, pp. 411\u2013423. Springer, Heidelberg (2015)"},{"key":"46_CR13","unstructured":"Drange, P.G., Fomin, F.V., Pilipczuk, M., Villanger, Y.: Exploring subexponential parameterized complexity of completion problems. In: STACS, LIPIcs, vol. 25, pp. 288\u2013299. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"key":"46_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-662-48350-3_36","volume-title":"Algorithms - ESA 2015","author":"PG Drange","year":"2015","unstructured":"Drange, P.G., Pilipczuk, M.: A polynomial kernel for trivially perfect editing. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 424\u2013436. Springer, Heidelberg (2015)"},{"issue":"7","key":"46_CR15","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. J. Comput. Syst. Sci. 80(7), 1430\u20131447 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S., F-deletion, P.: Approximation, kernelization and optimal FPT algorithms. In: FOCS (2012)","DOI":"10.1109\/FOCS.2012.62"},{"issue":"6","key":"46_CR17","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 J. Comput. 42(6), 2197\u20132216 (2013)","journal-title":"SIAM J. Comput."},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0166-218X(98)00035-3","volume":"86","author":"T Fujito","year":"1998","unstructured":"Fujito, T.: A unified approximation algorithm for node-deletion problems. Discrete Appl. Math. 86, 213\u2013231 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"46_CR19","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00453-013-9837-5","volume":"71","author":"E Ghosh","year":"2015","unstructured":"Ghosh, E., Kolay, S., Kumar, M., Misra, P., Panolan, F., Rai, A., Ramanujan, M.S.: Faster parameterized algorithms for deletion to split graphs. Algorithmica 71(4), 989\u20131006 (2015)","journal-title":"Algorithmica"},{"issue":"2","key":"46_CR20","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. J. Graph Theor. 23(2), 185\u2013189 (1996)","journal-title":"J. Graph Theor."},{"issue":"2","key":"46_CR21","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. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"46_CR22","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960\u2013981 (1994)","journal-title":"J. ACM"},{"issue":"1","key":"46_CR23","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s00224-008-9136-8","volume":"46","author":"M Mahajan","year":"2010","unstructured":"Mahajan, M., Sarma, J.: On the complexity of matrix rank and rigidity. Theory Comput. Syst. 46(1), 9\u201326 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"46_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/2500119","volume":"9","author":"D Marx","year":"2013","unstructured":"Marx, D., O\u2019Sullivan, B., Razgon, I.: Finding small separators in linear time via treewidth reduction. ACM Trans. Algorithms 9(4), 30 (2013)","journal-title":"ACM Trans. Algorithms"},{"key":"46_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-319-21398-9_29","volume-title":"Computing and Combinatorics","author":"SM Meesum","year":"2015","unstructured":"Meesum, S.M., Misra, P., Saurabh, S.: Reducing rank of the adjacency matrix by graph modification. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 361\u2013373. Springer, Heidelberg (2015)"},{"issue":"3","key":"46_CR26","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 Appl. Math. 131(3), 651\u2013654 (2003)","journal-title":"Discrete Appl. Math."},{"key":"46_CR27","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: STOC 1978, pp. 253\u2013264. ACM, New York (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:34:59Z","timestamp":1559421299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}