{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:27:02Z","timestamp":1743046022311,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308901"},{"type":"electronic","value":"9783642308918"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30891-8_6","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T05:24:05Z","timestamp":1339997045000},"page":"69-73","source":"Crossref","is-referenced-by-count":0,"title":["Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(97)00213-5","volume":"65","author":"R. Balasubramanian","year":"1998","unstructured":"Balasubramanian, R., Fellows, M., Raman, V.: An improved fixed parameter algorithm for Vertex Cover. Information Processing Letters\u00a065, 163\u2013168 (1998)","journal-title":"Information Processing Letters"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1137\/0403002","volume":"3","author":"A. Bar-Noy","year":"1990","unstructured":"Bar-Noy, A., Naor, J.: Sorting, minimal feedback sets, and Hamiltonial paths in Tournaments. SIAM J. Discrete Mathematics\u00a03(1), 7\u201320 (1990)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and Systems Sciences\u00a067(4), 789\u2013807 (2003); preliminary version in ICALP 2001","DOI":"10.1016\/S0022-0000(03)00074-6"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-1-4612-2566-9_7","volume-title":"Proceedings of the Second Cornell Workshop on Feasible Mathematics, Feasible Mathematics II","author":"R. Downey","year":"1995","unstructured":"Downey, R., Fellows, M.: Parameterized Computational Feasibility. In: Clote, P., Remmel, J. (eds.) Proceedings of the Second Cornell Workshop on Feasible Mathematics, Feasible Mathematics II, pp. 219\u2013244. Birkhauser, Boston (1995)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(99)00185-7","volume":"100","author":"R. Downey","year":"2000","unstructured":"Downey, R., Fellows, M.R., Raman, V.: The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics\u00a0100, 155\u2013167 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","volume":"14","author":"R.L. Graham","year":"1971","unstructured":"Graham, R.L., Spencer, J.H.: A constructive solution to a tournament problem. Canadian Mathematics Bulletin\u00a014, 45\u201348 (1971)","journal-title":"Canadian Mathematics Bulletin"},{"key":"6_CR7","unstructured":"Philip, G., Raman, V., Sikdar, S.: A polynomial kernel for dominating set in Ki,j-free and d-degenerate graphs. To appear in ACM Transactions on Algorithms; a preliminary version in Proceedings of ESA 2009"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Khot, S., Raman, V.: The Parameterized complexity of findng subgraphs with hereditary properties. Theoretical Computer Science\u00a0289, 997\u20131008 (2002); a preliminary version appeared in Proceedings of COCOON 2000","DOI":"10.1016\/S0304-3975(01)00414-5"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above the guarantee: maxsat and maxcut. Journal of Algorithms\u00a031, 335\u2013354 (1999)","journal-title":"Journal of Algorithms"},{"issue":"2-3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(88)90131-4","volume":"61","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Vishkin, U.: On finding a minimum dominating set in a tournament (Note). Theoretical Computer Science\u00a061(2-3), 307\u2013316 (1988)","journal-title":"Theoretical Computer Science"},{"key":"6_CR11","unstructured":"Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster Parameterized Algorithms using Linear Programming, \n                    \n                      http:\/\/arXiv.org\/abs\/1203.0833\n                    \n                    \n                  ; preliminary version appeared as LP can be a cure for parameterized algorithms. In: The Proceedings of STACS 2012"},{"key":"6_CR12","unstructured":"Table of FPT races, \n                    \n                      http:\/\/fpt.wikidot.com\/fpt-races"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jcss.1996.0058","volume":"53","author":"C.H. Papadimitriou","year":"1996","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On Limited non-determinism and the complexity of the V-C Dimension. Journal of Computer and Systems Sciences\u00a053(2), 161\u2013170 (1996)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"6_CR14","unstructured":"Raman, V.: Some hard problems in (weighted) tournaments. In: Proceedings of the Fifth National Seminar on Theoretical Computer Science, Bombay, pp. 115\u2013122 (1995)"},{"key":"6_CR15","unstructured":"Raman, V.: Parameterized Complexity. In: Proceedings of the Seventh National Seminar on Theoretical Computer Science, Chennai, pp. I1\u2013I18 (June 1997)"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-007-9148-9","volume":"52","author":"V. Raman","year":"2008","unstructured":"Raman, V., Saurabh, S.: Short cycles make W-hard problems hard; FPT algorithms for hard problems in graphs with no short cycles. Algorithmica\u00a052(2), 203\u2013225 (2008); preliminary version in the Proceedings of SWAT 2006","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","The Multivariate Algorithmic Revolution and Beyond"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30891-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:32:37Z","timestamp":1558297957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30891-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308901","9783642308918"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30891-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}