{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T02:45:40Z","timestamp":1767494740135},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T00:00:00Z","timestamp":1192492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s00224-007-9089-3","type":"journal-article","created":{"date-parts":[[2007,10,15]],"date-time":"2007-10-15T15:53:19Z","timestamp":1192463599000},"page":"234-253","source":"Crossref","is-referenced-by-count":35,"title":["Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover"],"prefix":"10.1007","volume":"43","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","published-online":{"date-parts":[[2007,10,16]]},"reference":[{"issue":"3","key":"9089_CR1","doi-asserted-by":"crossref","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. Inf. Process. Lett. 65(3), 163\u2013168 (1998)","journal-title":"Inf. Process. Lett."},{"key":"9089_CR2","doi-asserted-by":"crossref","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. Inf. Process. Lett. 93, 125\u2013131 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9089_CR3","doi-asserted-by":"crossref","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. J. Algorithms 41, 280\u2013301 (2001)","journal-title":"J. Algorithms"},{"key":"9089_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":"9089_CR5","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, New York (1999)"},{"key":"9089_CR6","doi-asserted-by":"crossref","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 1, 195\u2013207 (1972)","journal-title":"Networks"},{"key":"9089_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1007\/3-540-45655-4_60","volume-title":"Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON)","author":"H. Fernau","year":"2002","unstructured":"Fernau, H.: On parameterized enumeration. In: Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science, vol. 2387, pp. 564\u2013573. Springer, New York (2002)"},{"key":"9089_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":"9089_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/11534273_5","volume-title":"Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS)","author":"J. Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS), Waterloo, Canada. Lecture Notes in Computer Science, vol. 3608, pp. 36\u201348. Springer, New York (2005)"},{"key":"9089_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON)","author":"D. M\u00f6lle","year":"2006","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: Enumerate and expand: new runtime bounds for vertex cover variants. In: Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science, vol. 4112. Springer, New York (2006)"},{"key":"9089_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/11672142_46","volume-title":"Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS)","author":"D. M\u00f6lle","year":"2006","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: A faster algorithm for the Steiner tree problem. In: Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol. 3884, pp. 561\u2013570. Springer, New York (2006)"},{"key":"9089_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/3-540-49116-3_53","volume-title":"Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS)","author":"R. Niedermeier","year":"1999","unstructured":"Niedermeier, R., Rossmanith, P.: Upper bounds for vertex cover further improved. In: Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol. 1563, pp. 561\u2013570. Springer, New York (1999)"},{"key":"9089_CR13","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. J. Algorithms 47, 63\u201377 (2003)","journal-title":"J. Algorithms"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9089-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9089-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9089-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:35Z","timestamp":1558698695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9089-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,16]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9089"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9089-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,16]]}}}