{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:48:44Z","timestamp":1748015324135,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"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-18173-8_18","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"249-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints"],"prefix":"10.1007","author":[{"given":"Vikram","family":"Kamat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: new upper and lower bound techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 17\u201337. Springer, Heidelberg (2009)"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/2629620","volume":"61","author":"H Dell","year":"2014","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. J. ACM 61(4), 23 (2014)","journal-title":"J. ACM"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"18_CR4","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer-Verlag New York Inc (2006)"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT news 38(1), 31\u201345 (2007)","journal-title":"SIGACT news"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Jukna, S.: Extremal combinatorics - with applications in computer science, pp. I-XVII, 1\u2013375. Springer (2001)","DOI":"10.1007\/978-3-662-04650-0"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Khanna, et al.: The Approximability of Constraint Satisfaction Problems. SICOMP: SIAM Journal on Computing 30 (2001)","DOI":"10.1137\/S0097539799349948"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-14165-2_55","volume-title":"Automata, Languages and Programming","author":"S Kratsch","year":"2010","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Preprocessing of min ones problems: a dichotomy. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 653\u2013665. Springer, Heidelberg (2010)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Niedermeier, Rossmanith: An Efficient Fixed-Parameter Algorithm for 3-Hitting Set. Journal of Discrete Algorithms, Elsevier (unseen by me), 1 (2003)","DOI":"10.1016\/S1570-8667(03)00009-1"},{"key":"18_CR10","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications)","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press, USA (2006)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-28639-4_11","volume-title":"Parameterized and Exact Computation","author":"N Nishimura","year":"2004","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: Smaller kernels for hitting set problems of constant arity. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 121\u2013126. Springer, Heidelberg (2004)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-36065-7_25","volume-title":"WALCOM: Algorithms and Computation","author":"V Raman","year":"2013","unstructured":"Raman, V., Shankar, B.S.: Improved fixed-parameter algorithm for the minimum weight 3-SAT problem. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol. 7748, pp. 265\u2013273. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T16:48:02Z","timestamp":1675270082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_18","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":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}