{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:56:45Z","timestamp":1761919005592},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_52","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"613-627","source":"Crossref","is-referenced-by-count":32,"title":["Improved Tree Decomposition Based Algorithms for Domination-like Problems"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Alber","sequence":"first","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,3,14]]},"reference":[{"key":"52_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44985-X_10","volume-title":"Fixed parameter algorithms for planar dominating set and related problems","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 Proceedings 7th SWAT 2000, Springer-Verlag LNCS 1851, pp. 97\u2013110, 2000."},{"key":"52_CR2","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 Proceedings 28th ICALP 2001, Springer-Verlag LNCS 2076, pp. 261\u2013272, 2001."},{"key":"52_CR3","unstructured":"J. Alber, F. Dorn, and R. Niedermeier. Experiments on optimally solving parameterized problems on planar graphs. Manuscript, December 2001."},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/s004530010025","volume":"27","author":"B. Aspvall","year":"2000","unstructured":"B. Aspvall, A. Proskurowski, and J. A. Telle. Memory requirements for table computations in partial k-tree algorithms. Algorithmica 27: 382\u2013394, 2000.","journal-title":"Algorithmica"},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/0217004","volume":"17","author":"D. Bienstock","year":"1988","unstructured":"D. Bienstock and C. L. Monma. On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17:53\u201376, 1988.","journal-title":"SIAM J. Comput"},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. L. Bodlaender","year":"1996","unstructured":"H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25:1305\u20131317, 1996.","journal-title":"SIAM J. Comput"},{"key":"52_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Treewidth: Algorithmic techniques and results","author":"H. L. Bodlaender","year":"1997","unstructured":"H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proceedings 22nd MFCS\u201997, Springer-Verlag LNCS 1295, pp. 19\u201336, 1997."},{"key":"52_CR8","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V. B. Le, and J. P. Spinrad. Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"52_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-46784-X_30","volume-title":"Vertex cover: further observations and further improvements","author":"J. Chen","year":"1999","unstructured":"J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. In Proceedings 25th WG, Springer-Verlag LNCS 1665, pp. 313\u2013324, 1999."},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/0608044","volume":"8","author":"D. G. Corneil","year":"1987","unstructured":"D. G. Corneil and J. M. Keil. A dynamic programming approach to the dominating set problem on k-trees. SIAM J. Alg. Disc. Meth., 8: 535\u2013543, 1987.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"52_CR11","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":"52_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":"52_CR13","unstructured":"T. W. Haynes, S. T. Hedetniemi, and P. J. Slater eds.. Domination in Graphs; Advanced Topics. Monographs and textbooks in Pure and Applied Mathematics Vol. 209, Marcel Dekker, 1998."},{"key":"52_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth. Computations and Approximations","author":"T. Kloks","year":"1994","unstructured":"T. Kloks. Treewidth. Computations and Approximations. Springer-Verlag LNCS 842, 1994."},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"A. M. C. A. Koster, H. L. Bodlaender, and S. P. M. Hoesel. Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics 8, Elsevier Science Publishers, 2001.","DOI":"10.1016\/S1571-0653(05)80078-2"},{"key":"52_CR16","unstructured":"D. Kratsch. Algorithms. Chapter 8 in [13]."},{"key":"52_CR17","volume-title":"LEDA: A Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: A Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, England, 1999."},{"key":"52_CR18","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 Proc. 16th STACS\u201999, Springer-Verlag LNCS 1563, pp. 561\u2013570, 1999."},{"key":"52_CR19","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":"52_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/3-540-57155-8_284","volume-title":"Practical algorithms on partial k-trees with an application to domination-like problems","author":"J. A. Telle","year":"1993","unstructured":"J. A. Telle and A. Proskurowski. Practical algorithms on partial k-trees with an application to domination-like problems. In Proceedings 3rd WADS\u201993, Springer-Verlag LNCS 709, pp. 610\u2013621, 1993."},{"issue":"4","key":"52_CR21","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"J. A. Telle","year":"1997","unstructured":"J. A. Telle and A. Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discr. Math. 10(4):529\u2013550, 1997.","journal-title":"SIAM J. Discr. Math."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:30:27Z","timestamp":1556454627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}