{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:42Z","timestamp":1725484422704},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_16","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T13:18:22Z","timestamp":1179753502000},"page":"150-159","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Alber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"16_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44985-X_10","volume-title":"Proc. 7th SWAT 2000","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 Proc. 7th SWAT 2000, Springer-Verlag LNCS 1851, pp. 97\u2013110, 2000."},{"key":"16_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-44683-4_11","volume-title":"Proc. 26th MFCS 2001","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 technique for dominating set on planar graphs. In Proc. 26th MFCS 2001, Springer-Verlag LNCS 2136, pp. 111\u2013122, 2001."},{"key":"16_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-48224-5_22","volume-title":"Proc. 28th ICALP 2001","author":"J. Alber","year":"2001","unstructured":"J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. In Proc. 28th ICALP 2001, Springer-Verlag LNCS 2076, pp. 261\u2013272, 2001."},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-44679-6_35","volume-title":"Proc. 7th COCOON 2001","author":"J. Alber","year":"2001","unstructured":"J. Alber, H. Fernau, and R. Niedermeier. Graph separators: a parameterized view. In Proc. 7th COCOON 2001, Springer-Verlag LNCS 2108, pp. 318\u2013327, 2001."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0012-365X(00)00199-0","volume":"229","author":"J. Alber","year":"2001","unstructured":"J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229: 3\u201327, 2001.","journal-title":"Discrete Mathematics"},{"key":"16_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-45995-2_52","volume-title":"Proc. 5th LATIN 2002","author":"J. Alber","year":"2002","unstructured":"J. Alber and R. Niedermeier. Improved tree decomposition based algorithms for domination-like problems. In Proc. 5th LATIN 2002, Springer-Verlag LNCS 2286, pp. 613\u2013627, 2002."},{"key":"16_CR7","first-page":"27","volume":"25","author":"R. Bar-Yehuda","year":"1985","unstructured":"R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25: 27\u201346, 1985.","journal-title":"Annals of Discrete Mathematics"},{"key":"16_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 improvements. Journal of Algorithms, 41:280\u2013301, 2001.","journal-title":"Journal of Algorithms"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized computational feasibility. In P. Clote, J. Remmel (eds.): Feasible Mathematics II, pp. 219\u2013244. Birkh\u00e4user, 1995.","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer-Verlag, 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"16_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-45678-3_26","volume-title":"Proc. 12th ISAAC 2001","author":"M. R. Fellows","year":"2001","unstructured":"M. R. Fellows. Parameterized complexity: the main ideas and some research frontiers. In Proc. 12th ISAAC 2001, Springer-Verlag LNCS 2223, pp. 291\u2013307, 2001."},{"key":"16_CR12","unstructured":"T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Monographs and textbooks in pure and applied Mathematics Vol. 208, Marcel Dekker, 1998."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G. L. Nemhauser","year":"1975","unstructured":"G. L. Nemhauser and L. E. Trotter. Vertex packing: structural properties and algorithms. Mathematical Programming, 8:232\u2013248, 1975.","journal-title":"Mathematical Programming"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"F. S. Roberts. Graph Theory and Its Applications to Problems of Society. SIAM Press 1978. Third printing 1993 by Odyssey Press.","DOI":"10.1137\/1.9781611970401"},{"key":"16_CR15","first-page":"157","volume":"1","author":"J. A. Telle","year":"1994","unstructured":"J. A. Telle. Complexity of domination-type problems in graphs. Nordic J. Comput. 1:157\u2013171, 1994.","journal-title":"Nordic J. Comput."},{"key":"16_CR16","unstructured":"K. Weihe. Covering trains by stations or the power of data reduction. In Proc. 1st ALEX\u201998, pp. 1\u20138, 1998."},{"key":"16_CR17","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. WAE 2000","author":"K. Weihe","year":"2001","unstructured":"K. Weihe. On the differences between \u201cpractical\u201d and \u201capplied\u201d (invited paper). In Proc. WAE 2000, Springer-Verlag LNCS 1982, pp. 1\u201310, 2001."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:42:23Z","timestamp":1556419343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45471-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438663","9783540454717"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45471-3_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}