{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T02:40:00Z","timestamp":1784774400135,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424963","type":"print"},{"value":"9783540446835","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_11","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"111-123","source":"Crossref","is-referenced-by-count":21,"title":["Refined Search Tree Technique for Dominating Set on Planar Graphs"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Alber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongbing","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fran","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrike","family":"Stege","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-44985-X_10","volume-title":"7th Scandinavian Workshop on Algorithm Theory SWAT","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 7th Scandinavian Workshop on Algorithm Theory SWAT, volume 1851 of LNCS, pages 97\u2013110, Springer-Verlag, 2000. A lng version has been accepted for publication in Algorithmica."},{"key":"11_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Technical Report WSI-2001-8","author":"J. Alber","year":"2001","unstructured":"J. Alber, H. Fernau, and R. Niedermeier. Graph separators: a parameterized view. Technical Report WSI-2001-8, Universit\u00e4t T\u00fcbingen (Fed. Rep. of Germany), Wilhelm-Schickard-Institut f\u00fcr Informatik, 2001. Extended abstract accepted at COCOON 2001, to appear in LNCS, Springer-Verlag, August 2001."},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Technical Report TR01-023, ECCC Reports","author":"J. Alber","year":"2001","unstructured":"J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speedup for planar graph problems. Technical Report TR01-023, ECCC Reports, Trier (Fed. Rep. of Germany), March 2001. Extended abstract accepted at ICALP 2001, to appear in LNCS, Springer-Verlag, July 2001."},{"key":"11_CR4","unstructured":"L. Cai, M. Fellows, D. Juedes, and F. Rosamond. Efficient polynomial-time approximation schemes for problems on planar graph structures: upper and lower bounds. Manuscript, May 2001."},{"key":"11_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Extended abstract accepted at ICALP 2001","author":"L. Cai","year":"2001","unstructured":"L. Cai and D. Juedes. Subexponential parameterized algorithms collapse the W-hierarchy. Extended abstract accepted at ICALP 2001, to appear in LNCS, Springer-Verlag, July 2001."},{"key":"11_CR6","unstructured":"R. Diestel. Graph Theory. Springer-Verlag, 1997."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized computational feasibility. In Feasible Mathematics II, pages 219\u2013244. Birkh\u00e4user, 1995.","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1090\/dimacs\/049\/04","volume":"49","author":"R. G. Downey","year":"1999","unstructured":"R. G. Downey, M. R. Fellows, and U. Stege. Parameterized complexity: A framework for systematically confronting computational intractability. DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, 49:49\u201399, 1999.","journal-title":"DIM ACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"R. Niedermeier and P. Rossmanith. A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters, 73:125\u2013129, 2000.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T06:55:57Z","timestamp":1550904957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}