{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:25:40Z","timestamp":1743153940099,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_33","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"399-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Improved Parameterized Algorithms for Planar Dominating Set"],"prefix":"10.1007","author":[{"given":"Iyad A.","family":"Kanj","sequence":"first","affiliation":[]},{"given":"Ljubomir","family":"Perkovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"33_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44985-X_10","volume-title":"Algorithmica","author":"J. Alber","year":"2000","unstructured":"J. Alber, H. L. Bodlaender, H. Ferneau, AND R. Niedermeier, Fixed parameter algorithms for Dominating Set and related problems on planar graphs, To appear in Algorithmica (2002). Earlier version appeared in LNCS\n                           1851, (2000), pp. 97\u2013110."},{"key":"33_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-44683-4_11","volume-title":"Refined search tree techniques for Dominating Set on planar graphs","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 Dominating Set on planar graphs, in LNCS\n                           2136, (2001), pp. 111\u2013122."},{"key":"33_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-48224-5_22","volume-title":"Parameterized complexity: Exponential speed-up for planar graph problems","author":"J. Alber","year":"2001","unstructured":"J. Alber, H. Fernau, AND R. Niedermeier, Parameterized complexity: Exponential speed-up for planar graph problems, in LNCS\n                           2076, (2001), pp. 261\u2013272."},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. S. Baker","year":"1994","unstructured":"B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM\n                           41, (1994), pp. 153\u2013180.","journal-title":"Journal of the ACM"},{"key":"33_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-46632-0_26","volume-title":"Upper bounds for Max-Sat further improved","author":"N. Bansal","year":"1999","unstructured":"N. Bansal AND V. Raman, Upper bounds for Max-Sat further improved, LNCS\n                           1741, (1999), pp. 247\u2013258."},{"key":"33_CR6","unstructured":"L. Cai AND D. Juedes, On the existence of subexponential-time parameterized algorithms, available at http:\/\/www.cs.uga.edu\/~cai\/."},{"key":"33_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Improved exact algorithms for Max-Sat","author":"J. Chen","year":"2002","unstructured":"J. Chen, AND I. A. Kanj, Improved exact algorithms for Max-Sat, in LNCS\n                           2286, (2002)."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"J. Chen, I. A. Kanj, AND W. Jia, Vertex cover: further observations and further improvement, Journal of Algorithms\n                           41, (2001), pp. 280\u2013301.","journal-title":"Journal of Algorithms"},{"key":"33_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. G. Downey","year":"1999","unstructured":"R. G. Downey AND M. R. Fellows, Parameterized Complexity, New York, New York: Springer, (1999)."},{"key":"33_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey AND D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979."},{"key":"33_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/3-540-49116-3_53","volume-title":"Upper bounds for vertex cover further improved","author":"R. Niedermeier","year":"1999","unstructured":"R. Niedermeier AND P. Rossmanith, Upper bounds for vertex cover further improved, in LNCS\n                           1563, (1999), pp. 561\u2013570."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T02:10:12Z","timestamp":1676686212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}