{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:41Z","timestamp":1725484421749},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438663"},{"type":"electronic","value":"9783540454717"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45471-3_19","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T13:18:22Z","timestamp":1179753502000},"page":"180-189","source":"Crossref","is-referenced-by-count":6,"title":["The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus"],"prefix":"10.1007","author":[{"given":"J.","family":"Ellis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44985-X_10","volume-title":"7th Scandinavian Workshop on Algorithm Theory","author":"J. Alber","year":"2000","unstructured":"J. Alber, H. L. Bodlaender, H. Fernau, and R. Niedermeier. Fixed parameter algorithms for planar dominating set and related problems. In M. M. Halld\u00f3rsson, editor, 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of LNCS, pages 97\u2013110, 2000."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-44683-4_11","volume-title":"Mathematical Foundations of Computer Science","author":"J. Alber","year":"2001","unstructured":"J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, and U. Stege. Refined search tree techniques for the planar dominating set problem. In J. Sgall, A. Pultr, and P. Kolman, editors, Mathematical Foundations of Computer Science, volume 2136 of LNCS, pages 111\u2013122. Springer, 2001."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"J. Alber, H. Fernau, and R. Niedermeier. Graph separators: a parameterized view. Technical Report WSI-2001-8, Universit\u00e4t T\u00fcbingen (Germany), Wilhelm-Schickard-Institut f\u00fcr Informatik, 2001.","DOI":"10.1007\/3-540-44679-6_35"},{"key":"19_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-48224-5_22","volume-title":"28th ICALP 2001","author":"J. Alber","year":"2001","unstructured":"J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speedup for planar graph problems. In 28th ICALP 2001, volume 2076 of LNCS, pages 261\u2013272. Springer, 2001."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","volume-title":"8th Scandinavian Workshop on Algorithm Theory","author":"J. Alber","year":"2002","unstructured":"J. Alber, M. Fellows, and R. Niedermeier. Efficient data reduction for dominating set: A linear problem kernel for the planar case. In 8th Scandinavian Workshop on Algorithm Theory, LNCS. Springer, 2002."},{"key":"19_CR6","unstructured":"B. Boll\u00f3bas. Combinatorics. Cambridge University Press, 1986."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized computational feasibility. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 219\u2013244. Birkh\u00e4user, 1995.","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"116","DOI":"10.2307\/2324180","volume":"99","author":"C. Thomassen","year":"1992","unstructured":"C. Thomassen. The jordan-schonfliess theorem and the classification of surfaces. Amer. Math. Monthly, 99:116\u2013130, 1992.","journal-title":"Amer. Math. Monthly"},{"key":"19_CR10","unstructured":"C. Thomassen. Embeddings and minors. In R. L. Graham, M. Groschel, and L. Lov\u00e1sz, editors, Handbook of Combinatorics Volume I. The MIT Press, 1995."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45471-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:42:21Z","timestamp":1556419341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45471-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438663","9783540454717"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45471-3_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}