{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:34Z","timestamp":1759637734439,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_27","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"325-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems"],"prefix":"10.1007","author":[{"given":"Ashwin","family":"Jacob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vibha","family":"Sahlot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"unstructured":"Alambardar Meybodi, M., Fomin, F., Mouawad, A.E., Panolan, F.: On the parameterized complexity of [1, j]-domination problems. In: FSTTCS 2018 (2018)","key":"27_CR1"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/BFb0020811","volume-title":"STACS 91","author":"JF Buss","year":"1991","unstructured":"Buss, J.F., Goldsmith, J.: Nondeterminism within P. In: Choffrut, C., Jantzen, M. (eds.) STACS 1991. LNCS, vol. 480, pp. 348\u2013359. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0020811"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"27_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: FOCS, pp. 150\u2013159. IEEE (2011)","key":"27_CR5","DOI":"10.1109\/FOCS.2011.23"},{"key":"27_CR6","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2005)"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"MR Fellows","year":"2013","unstructured":"Fellows, M.R., Jansen, B.M., Rosamond, F.: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34(3), 541\u2013566 (2013)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. TCS 1(3), 237\u2013267 (1976)","journal-title":"TCS"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-68705-6_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Knop","year":"2017","unstructured":"Knop, D., Kouteck\u00fd, M., Masa\u0159\u00edk, T., Toufar, T.: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 344\u2013357. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_26"},{"unstructured":"Knop, D., Masar\u00edk, T., Toufar, T.: Parameterized complexity of fair deletion problems II. CoRR abs\/1803.06878 (2018)","key":"27_CR10"},{"unstructured":"Kolman, P., Lidick\u1ef3, B., Sereni, J.S.: On fair edge deletion problems. Manuscript (2009). http:\/\/kam.mff.cuni.cz\/kolman\/papers\/kls09.pdf","key":"27_CR11"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.disopt.2013.02.001","volume":"10","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Two edge modification problems without polynomial kernels. Discrete Optim. 10(3), 193\u2013199 (2013)","journal-title":"Discrete Optim."},{"issue":"2","key":"27_CR13","first-page":"219","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. JCSS 20(2), 219\u2013230 (1980)","journal-title":"JCSS"},{"issue":"5","key":"27_CR14","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1109\/12.24280","volume":"38","author":"L Lin","year":"1989","unstructured":"Lin, L., Sahni, S.: Fair edge deletion problems. IEEE Trans. Comput. 38(5), 756\u2013761 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-319-55911-7_45","volume-title":"Theory and Applications of Models of Computation","author":"T Masa\u0159\u00edk","year":"2017","unstructured":"Masa\u0159\u00edk, T., Toufar, T.: Parameterized complexity of fair deletion problems. In: Gopal, T.V., J\u00e4ger, G., Steila, S. (eds.) TAMC 2017. LNCS, vol. 10185, pp. 628\u2013642. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55911-7_45"},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s00453-007-9112-8","volume":"53","author":"R Rizzi","year":"2009","unstructured":"Rizzi, R.: Minimum weakly fundamental cycle bases are hard to find. Algorithmica 53(3), 402\u2013424 (2009)","journal-title":"Algorithmica"},{"issue":"1","key":"27_CR17","first-page":"157","volume":"1","author":"JA Telle","year":"1994","unstructured":"Telle, J.A.: Complexity of domination-type problems in graphs. Nord. J. Comput. 1(1), 157\u2013171 (1994)","journal-title":"Nord. J. Comput."},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-04128-0_51","volume-title":"Algorithms - ESA 2009","author":"JMM van Rooij","year":"2009","unstructured":"van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic programming on tree decompositions using generalised fast subset convolution. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 566\u2013577. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_51"}],"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-030-26176-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:07:00Z","timestamp":1709820420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}