{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T20:51:04Z","timestamp":1699995064317},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1007\/bf02684436","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T05:06:17Z","timestamp":1186549577000},"page":"129-155","source":"Crossref","is-referenced-by-count":10,"title":["On the feedback vertex set problem for a planar graph"],"prefix":"10.1007","volume":"58","author":[{"given":"W.","family":"Hackbusch","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02684436_CR1","first-page":"471","volume":"23","author":"A. Brandst\u00e4dt","year":"1987","unstructured":"Brandst\u00e4dt, A.: The computational complexity of feedback vertex set, Hamiltonian circuit, dominating set, Steiner tree, and bandwidth on special perfect graphs. J. Inf. Process. Cybern. EIK23, 471\u2013477 (1987).","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"BF02684436_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","volume":"54","author":"A. Brandst\u00e4dt","year":"1987","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On domination problems for permutation and other graphs. Theor. Comp. Sci.54, 181\u2013198 (1987).","journal-title":"Theor. Comp. Sci."},{"key":"BF02684436_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02427-0","volume-title":"Multi-grid methods and applications","author":"W. Hackbusch","year":"1985","unstructured":"Hackbusch, W.: Multi-grid methods and applications. Berlin, Heidelberg, New York, Tokyo: Springer, 1985."},{"key":"BF02684436_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-11490-8","volume-title":"Elliptic differential equations","author":"W. Hackbusch","year":"1992","unstructured":"Hackbusch, W.: Elliptic differential equations. Berlin, Heidelberg, New York, Tokyo: Springer, 1992."},{"key":"BF02684436_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4288-8","volume-title":"Iterative solution of large sparse systems of equations","author":"W. Hackbusch","year":"1994","unstructured":"Hackbusch, W.: Iterative solution of large sparse systems of equations. Berlin, Heidelberg, New York, Tokyo: Springer 1994. Iterative L\u00f6sung gro\u00dfer schwachbesetzter Gleichungssysteme, 2. deutsche Auflage. Stuttgart: Teubner, 1993."},{"key":"BF02684436_CR6","first-page":"315","volume-title":"Bericht Nr 9, Paderborn 1981 \u2014 Proc. of the 7th Conf. on Graph Theoretical Concepts of Comput. Sci.","author":"B. Monien","year":"1981","unstructured":"Monien, B., Schulz, R.: Four approximation algorithms for the feedback vertex set problem. Bericht Nr 9, Paderborn 1981 \u2014 Proc. of the 7th Conf. on Graph Theoretical Concepts of Comput. Sci., pp. 315\u2013325. M\u00fcnchen: Hanser, 1981."},{"key":"BF02684436_CR7","series-title":"Research and Exposition in Mathematics","volume-title":"The linear ordering problem: algorithms and applications","author":"G. Reinelt","year":"1985","unstructured":"Reinelt, G.: The linear ordering problem: algorithms and applications. Research and Exposition in Mathematics8. Berlin: Heldermann, 1985."},{"key":"BF02684436_CR8","first-page":"719","volume":"42","author":"E. Speckenmeyer","year":"1983","unstructured":"Speckenmeyer, E.: Bounds on feedback vertex sets of undirected cubic graphs. Coll. Math. Soc. Janos Bolyai42, 719\u2013729 (1983).","journal-title":"Coll. Math. Soc. Janos Bolyai"},{"key":"BF02684436_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-53832-1_33","volume":"484","author":"H. Stamm","year":"1992","unstructured":"Stamm, H.: Graph-theoretical concepts in computer science. Lect. Notes Compt. Sci.484, 79\u201389 (1992).","journal-title":"Lect. Notes Compt. Sci."},{"key":"BF02684436_CR10","volume-title":"Teubner Skripten zur Numerik","author":"G. Wittum","year":"1992","unstructured":"Wittum, G.: Filternde Zerlegungen: Schnelle L\u00f6ser f\u00fcr gro\u00dfe Gleichungssysteme (Filtering decomposition, fast solvers for large systems of equations). Teubner Skripten zur Numerik. Stuttgart: Teubner, 1992."},{"key":"BF02684436_CR11","doi-asserted-by":"crossref","unstructured":"Hackbusch, W., Probst, Th.: Downwind Gau\u00df-Seidel smoothing for convection dominated problems. Numer. Lin. Alg. Appl. (to appear).","DOI":"10.1002\/(SICI)1099-1506(199703\/04)4:2<85::AID-NLA100>3.0.CO;2-2"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684436.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02684436\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T22:22:39Z","timestamp":1558218159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02684436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF02684436"],"URL":"https:\/\/doi.org\/10.1007\/bf02684436","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}