{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:17:18Z","timestamp":1725974238896},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"am","delay-in-days":325,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1016\/j.dam.2020.03.052","type":"journal-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T21:17:48Z","timestamp":1586467068000},"page":"168-186","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Structurally parameterized d<\/mml:mi><\/mml:math>-scattered set"],"prefix":"10.1016","volume":"308","author":[{"given":"Ioannis","family":"Katsikarelis","sequence":"first","affiliation":[]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2020.03.052_b1","article-title":"Parameterized power vertex cover","volume":"20","author":"Angel","year":"2018","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2020.03.052_b2","doi-asserted-by":"crossref","unstructured":"Andreas Bj\u00f6rklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Fourier meets M\u00f6bius: fast subset convolution, in: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007, 2007, pp. 67\u201374.","DOI":"10.1145\/1250790.1250801"},{"key":"10.1016\/j.dam.2020.03.052_b3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S1571-0653(05)80116-7","article-title":"The algorithmic theory of treewidth","volume":"5","author":"Bodlaender","year":"2000","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.dam.2020.03.052_b4","series-title":"Graph-Theoretic Concepts in Computer Science, 32nd International Workshop","first-page":"1","article-title":"Treewidth: Characterizations, applications, and computations","volume":"vol. 4271","author":"Bodlaender","year":"2006"},{"issue":"2","key":"10.1016\/j.dam.2020.03.052_b5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1995.1009","article-title":"Approximating treewidth, pathwidth, frontsize, and shortest elimination tree","volume":"18","author":"Bodlaender","year":"1995","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/j.dam.2020.03.052_b6","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1137\/S0097539795289859","article-title":"Parallel algorithms with optimal speedup for bounded treewidth","volume":"27","author":"Bodlaender","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.dam.2020.03.052_b7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10951-011-0225-1","article-title":"Scheduling of pipelined operator graphs","volume":"15","author":"Bodlaender","year":"2012","journal-title":"J. Sched."},{"key":"10.1016\/j.dam.2020.03.052_b8","series-title":"Mathematical Foundations of Computer Science 2010, 35th International Symposium","first-page":"174","article-title":"Faster algorithms on branch and clique decompositions","volume":"vol. 6281","author":"Bodlaender","year":"2010"},{"key":"10.1016\/j.dam.2020.03.052_b9","series-title":"11th International Symposium on Parameterized and Exact Computation","first-page":"8:1","article-title":"Optimal dynamic program for r-domination problems over tree decompositions","volume":"vol. 63","author":"Borradaile","year":"2016"},{"issue":"1\u20133","key":"10.1016\/j.dam.2020.03.052_b10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","article-title":"Upper bounds to the clique width of graphs","volume":"101","author":"Courcelle","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.03.052_b11","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.dam.2020.03.052_b12","series-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"issue":"1","key":"10.1016\/j.dam.2020.03.052_b13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s10878-012-9594-4","article-title":"Distance- d independent set problems for bipartite and chordal graphs","volume":"27","author":"Eto","year":"2014","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2020.03.052_b14","series-title":"10th Annual International Conference on Combinatorial Optimization and Applications","first-page":"270","article-title":"Approximability of the distance independent set problem on regular graphs and planar graphs","volume":"vol. 10043","author":"Eto","year":"2016"},{"key":"10.1016\/j.dam.2020.03.052_b15","series-title":"11th International Conference and Workshops on Algorithms and Computation","first-page":"228","article-title":"Approximation algorithm for the distance-3 independent set problem on cubic graphs","volume":"vol. 10167","author":"Eto","year":"2017"},{"key":"10.1016\/j.dam.2020.03.052_b16","series-title":"Parameterized Complexity Theory","author":"Flum","year":"2006"},{"key":"10.1016\/j.dam.2020.03.052_b17","series-title":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"748","article-title":"Bidimensionality and EPTAS","author":"Fomin","year":"2011"},{"issue":"1\u20133","key":"10.1016\/j.dam.2020.03.052_b18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0166-218X(99)00124-9","article-title":"Independent sets with domination constraints","volume":"99","author":"Halldorsson","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.03.052_b19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03b5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Math."},{"issue":"2","key":"10.1016\/j.dam.2020.03.052_b20","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","article-title":"On the complexity of k-SAT","volume":"62","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/j.dam.2020.03.052_b21","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","article-title":"Which problems have strongly exponential complexity?","volume":"63","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2020.03.052_b22","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.dam.2018.11.002","article-title":"Structural parameters, tight bounds, and approximation for (k,r)-center","volume":"264","author":"Katsikarelis","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.03.052_b23","series-title":"Treewidth, Computations and Approximations","volume":"vol. 842","author":"Kloks","year":"1994"},{"key":"10.1016\/j.dam.2020.03.052_b24","series-title":"Automata, Languages, and Programming - 41st International Colloquium","first-page":"775","article-title":"Parameterized approximation schemes using graph widths","volume":"vol. 8572","author":"Lampis","year":"2014"},{"issue":"2","key":"10.1016\/j.dam.2020.03.052_b25","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/3170442","article-title":"Known algorithms on graphs of bounded treewidth are probably optimal","volume":"14","author":"Lokshtanov","year":"2018","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.dam.2020.03.052_b26","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","article-title":"Parameterized complexity and approximation algorithms","volume":"51","author":"Marx","year":"2008","journal-title":"Comput. J."},{"key":"10.1016\/j.dam.2020.03.052_b27","series-title":"23rd Annual European Symposium on Algorithms","first-page":"865","article-title":"Optimal parameterized algorithms for planar facility location problems using voronoi diagrams","volume":"vol. 9294","author":"Marx","year":"2015"},{"key":"10.1016\/j.dam.2020.03.052_b28","series-title":"42nd International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"183","article-title":"On distance-d independent set and other problems in graphs with few minimal separators","volume":"vol. 9941","author":"Montealegre","year":"2016"},{"issue":"6","key":"10.1016\/j.dam.2020.03.052_b29","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","article-title":"Tree-depth, subgraph coloring and homomorphism bounds","volume":"27","author":"Nesetril","year":"2006","journal-title":"European J. Combin."},{"issue":"2","key":"10.1016\/j.dam.2020.03.052_b30","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(94)00160-K","article-title":"Mixed searching and proper-path-width","volume":"137","author":"Takahashi","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2020.03.052_b31","series-title":"Algorithms - ESA 2009, 17th Annual European Symposium","first-page":"566","article-title":"Dynamic programming on tree decompositions using generalised fast subset convolution","volume":"vol. 5757","author":"van Rooij","year":"2009"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20301517?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20301517?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T08:26:04Z","timestamp":1640334364000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X20301517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":31,"alternative-id":["S0166218X20301517"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.dam.2020.03.052","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2022,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Structurally parameterized -scattered set","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2020.03.052","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
