{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:02:31Z","timestamp":1772906551461,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001423","type":"print"},{"value":"9783540361367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_40","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"453-464","source":"Crossref","is-referenced-by-count":37,"title":["Approximation Algorithms for Some Parameterized Counting Problems"],"prefix":"10.1007","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"issue":"4","key":"40_CR1","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"N. Alon, R. Yuster and U. Zwick, \u201cColor-Coding\u201d, Journal of the Association for Computing Machinery, 42(4) (1995) 844\u2013856.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"H. Bodlaender, \u201cA Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth\u201d, SI AM J. Computing 25 (1996) 1305\u20131317.","journal-title":"SI AM J. Computing"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"40_CR4","unstructured":"U. Feige and J. Kilian, \u201cOn Limited versus Polynomial Nondeterminism\u201d, Chicago Journal of Theoretical Computer Science, March (1997)."},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"H. Fernau, \u201cParameterized Enumeration\u201d, to appear in the Proceedings of COCOON 2002.","DOI":"10.1007\/3-540-45655-4_60"},{"key":"40_CR6","unstructured":"J. Flum and M. Grohe, \u201cThe Parameterized Complexity of Counting Problems\u201d, To appear in 43rd IEEE Symposium on Foundations of Computer Science 2002."},{"key":"40_CR7","unstructured":"T. Johnson, N. Robertson, P. D. Seymour, R. Thomas, \u201cDirected Tree-Width\u201d, preprint (1998) (available at http:\/\/www.math.gatech.edu\/#thomas\/ )."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"R. M. Karp and M. Luby, \u201cMonte-Carlo Algorithms for Enumeration and Reliability Problems\u201d, In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (1983) 56\u201364.","DOI":"10.1109\/SFCS.1983.35"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","volume":"10","author":"R. M. Karp","year":"1989","unstructured":"R. M. Karp, M. Luby and N. Madras, \u201cMonte-Carlo Approximation Algorithms for Enumeration Problems\u201d, Journal of Algorithms 10 (1989) 429\u2013448.","journal-title":"Journal of Algorithms"},{"key":"40_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-44968-X_14","volume-title":"Proceedings of the Sixth Annual International Computing and Combinatorics Conference (COCOON","author":"S. Khot","year":"2000","unstructured":"S. Khot and V. Raman, \u201cParameterized Complexity of Finding Subgraphs with Hereditary Properties\u201d, Proceedings of the Sixth Annual International Computing and Combinatorics Conference (COCOON, July 2000, Sydney, Australia, Lecture Notes in Computer Science, Springer Verlag 1858 (2000) 137\u2013147. Full version to appear in Theoretical Computer Science."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"T. Kloks, \u201cTreewidth: Computations and Approximations\u201d, Lecture Notes in Computer Science, Springer-Verlag 842 1994.","DOI":"10.1007\/BFb0045375"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"M. Mahajan and V. Raman, \u201cParameterizing Above Guaranteed Values: MaxSat and MaxCut\u201d, Journal of Algorithms 31 (1999) 335\u2013354.","journal-title":"Journal of Algorithms"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"C. McCartin, \u201cParameterized Counting Problems\u201d, to appear in the Proceedings of MFCS 2002 conference.","DOI":"10.1007\/3-540-45687-2_46"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"N. Nisan, Using Hard Problems to Create Pseudorandom Generators, MIT Press (1992).","DOI":"10.7551\/mitpress\/7052.001.0001"},{"key":"40_CR16","unstructured":"P. Rossmanith, private communication."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:29:10Z","timestamp":1557930550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}