{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:29Z","timestamp":1725543089912},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_29","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"265-273","source":"Crossref","is-referenced-by-count":5,"title":["Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants"],"prefix":"10.1007","author":[{"given":"Daniel","family":"M\u00f6lle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"29_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.R., Raman, V.: An improved fixed parameter algorithm for vertex cover. Information Processing Letters\u00a065(3), 163\u2013168 (1998)","journal-title":"Information Processing Letters"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ipl.2004.10.003","volume":"93","author":"L.S. Chandran","year":"2005","unstructured":"Chandran, L.S., Grandoni, F.: Refined memorization for vertex cover. Information Processing Letters\u00a093, 125\u2013131 (2005)","journal-title":"Information Processing Letters"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. Journal of Algorithms\u00a041, 280\u2013301 (2001)","journal-title":"Journal of Algorithms"},{"key":"29_CR4","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report TR05-008, School of CTI, DePaul University (2005)"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1972","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks\u00a01, 195\u2013207 (1972)","journal-title":"Networks"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-45655-4_60","volume-title":"Computing and Combinatorics","author":"H. Fernau","year":"2002","unstructured":"Fernau, H.: On parameterized enumeration. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 564\u2013573. Springer, Heidelberg (2002)"},{"key":"29_CR7","unstructured":"Fernau, H.: Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitation thesis, Universit\u00e4t T\u00fcbingen (2005)"},{"key":"29_CR8","unstructured":"Fernau, H., Manlove, D.F.: Vertex and edge covers with clustering properties: Complexity and algorithms. Technical Report TR-2006-210, Dept of Computing Science, University of Glasgow (April 2006)"},{"key":"29_CR9","first-page":"47","volume":"87","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. EATCS Bulletin\u00a087, 47\u201377 (2005)","journal-title":"EATCS Bulletin"},{"key":"29_CR10","unstructured":"Fomin, F.V., H\u00f8ie, K.: Pathwidth of cubic graphs and exact algorithms. Technical Report 298, Department of Informatics, University of Bergen (May 2005)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Fuchs, B., Kern, W., M\u00f6lle, D., Richter, S., Rossmanith, P., Wang, X.: Dynamic programming for minimum steiner trees. Theory of Computing Systems (to appear, 2006)","DOI":"10.1007\/s00224-007-1324-4"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. In: Proc. of 1st CSR (to appear, 2006)","DOI":"10.1007\/11753728_28"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/11672142_46","volume-title":"STACS 2006","author":"D. M\u00f6lle","year":"2006","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: A faster algorithm for the Steiner tree problem. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 561\u2013570. Springer, Heidelberg (2006)"},{"key":"29_CR14","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Habilitation thesis, Universit\u00e4t T\u00fcbingen (2002)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/3-540-49116-3_53","volume-title":"STACS 99","author":"R. Niedermeier","year":"1999","unstructured":"Niedermeier, R., Rossmanith, P.: Upper bounds for Vertex Cover further improved. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 561\u2013570. Springer, Heidelberg (1999)"},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: On efficient fixed parameter algorithms for Weighted Vertex Cover. Journal of Algorithms\u00a047, 63\u201377 (2003)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"29_CR17","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"J.A. Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics\u00a010(4), 529\u2013550 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:42Z","timestamp":1605644022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11809678_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}