{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:59Z","timestamp":1725543479314},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_29","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"304-315","source":"Crossref","is-referenced-by-count":3,"title":["Triangles, 4-Cycles and Parameterized (In-)Tractability"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"29_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0020-0190(02)00434-9","volume":"85","author":"M. Bl\u00e4ser","year":"2003","unstructured":"Bl\u00e4ser, M.: Computing small partial coverings. Information Processing Letters\u00a085(6), 327\u2013331 (2003)","journal-title":"Information Processing Letters"},{"key":"29_CR2","unstructured":"Cesati, M.: \n                    \n                      http:\/\/bravo.ce.uniroma2.it\/home\/cesati\/research\/compendium\/"},{"key":"29_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"29_CR4","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"29_CR5","unstructured":"Fomin, F.V., Pyatkin, A.V.: Finding Feedback Vertex Set in a Bipartite Graph. Reports in Informatics, University of Bergen. Report No. 291 (2005)"},{"key":"29_CR6","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11534273_5","volume-title":"Algorithms and Data Structures","author":"J. Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized Vertex Cover problems. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 36\u201348. Springer, Heidelberg (2005)"},{"key":"29_CR8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley Publishing Company, Reading (1969)"},{"key":"29_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics. Springer, Heidelberg (2001)"},{"issue":"2","key":"29_CR10","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/S0304-3975(01)00414-5","volume":"289","author":"S. Khot","year":"2002","unstructured":"Khot, S., Raman, V.: Parameterized complexity of finding Subgraphs with hereditary properties. Theoretical Computer Science\u00a0289(2), 997\u20131008 (2002)","journal-title":"Theoretical Computer Science"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Peleg, D.: On Choosing a Dense Subgraph. In: The Proceeding of 34th FOCS, pp. 692\u2013701 (1993)","DOI":"10.1109\/SFCS.1993.366818"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:21Z","timestamp":1619507961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11785293_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}