{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T15:41:13Z","timestamp":1783352473887,"version":"3.54.6"},"reference-count":131,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872048"],"award-info":[{"award-number":["61872048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772454"],"award-info":[{"award-number":["61772454"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61811530332"],"award-info":[{"award-number":["61811530332"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702491"],"award-info":[{"award-number":["61702491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702557"],"award-info":[{"award-number":["61702557"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Hum. Cent. Comput. Inf. Sci."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Parameterized computation theory has developed rapidly over the last two decades. In theoretical computer science, it has attracted considerable attention for its theoretical value and significant guidance in many practical applications. We give an overview on parameterized algorithms for some fundamental NP-hard problems, including MaxSAT, Maximum Internal Spanning Trees, Maximum Internal Out-Branching, Planar (Connected) Dominating Set, Feedback Vertex Set, Hyperplane Cover, Vertex Cover, Packing and Matching problems. All of these problems have been widely applied in various areas, such as Internet of Things, Wireless Sensor Networks, Artificial Intelligence, Bioinformatics, Big Data, and so on. In this paper, we are focused on the algorithms\u2019 main idea and algorithmic techniques, and omit the details of them.<\/jats:p>","DOI":"10.1186\/s13673-020-00226-w","type":"journal-article","created":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T11:25:10Z","timestamp":1593689110000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":67,"title":["Parameterized algorithms of fundamental NP-hard problems: a survey"],"prefix":"10.1186","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6121-588X","authenticated-orcid":false,"given":"Wenjun","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R. Simon","family":"Sherratt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jong Hyuk","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,2]]},"reference":[{"key":"226_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1186\/s13673-019-0191-8","volume":"9","author":"MJJ Ghrabat","year":"2019","unstructured":"Ghrabat MJJ, Ma G, Maolood IY, Alresheedi SS, Abduljabbar ZA (2019) An effective image retrieval based on optimized genetic algorithm utilized a novel svm-based convolutional neural network classifier. Hum Centr Comput Inform Sci 9:31. https:\/\/doi.org\/10.1186\/s13673-019-0191-8","journal-title":"Hum Centr Comput Inform Sci"},{"issue":"3","key":"226_CR2","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1007\/s10462-019-09719-2","volume":"53","author":"A Darwish","year":"2020","unstructured":"Darwish A, Hassanien AE, Das S (2020) A survey of swarm and evolutionary computing approaches for deep learning. Artif Intell Rev 53(3):1767\u20131812. https:\/\/doi.org\/10.1007\/s10462-019-09719-2","journal-title":"Artif Intell Rev"},{"key":"226_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5533","author":"Y Chen","year":"2019","unstructured":"Chen Y, Wang J, Liu S, Chen X, Xiiong J, Xie J, Yang K (2019) The multi-scale fast correlation filtering tracking algorithm based on a features fusion model. Concurr Comput Pract Exp. https:\/\/doi.org\/10.1002\/cpe.5533","journal-title":"Concurr Comput Pract Exp"},{"key":"226_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.neucom.2019.03.053","volume":"350","author":"F Yu","year":"2019","unstructured":"Yu F, Liu L, Xiao L, Li K, Cai S (2019) A robust and xed-time zeroing neural dynamics for computing time-variant nonlinear equation using a novel nonlinear activation function. Neurocomputing 350:108\u2013116. https:\/\/doi.org\/10.1016\/j.neucom.2019.03.053","journal-title":"Neurocomputing"},{"key":"226_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1186\/s13638-019-1396-2","volume":"2019","author":"SMH Rostami","year":"2019","unstructured":"Rostami SMH, Sangaiah AK, Wang J, Liu X (2019) Obstacle avoidance of mobile robots using modified artificial potential field algorithm. EURASIP J Wireless Comm Netw 2019:70. https:\/\/doi.org\/10.1186\/s13638-019-1396-2","journal-title":"EURASIP J Wireless Comm Netw"},{"key":"226_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1186\/s13673-019-0197-2","volume":"9","author":"SN Danial","year":"2019","unstructured":"Danial SN, Smith J, Veitch B, Khan FI (2019) On the realization of the recognition-primed decision model for artificial agents. Hum Centr Comput Inform Sci 9:36. https:\/\/doi.org\/10.1186\/s13673-019-0197-2","journal-title":"Hum Centr Comput Inform Sci"},{"issue":"3","key":"226_CR7","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/1047671.1047672","volume":"48","author":"J Cohen","year":"2005","unstructured":"Cohen J (2005) Computer science and bioinformatics. Commun ACM 48(3):72\u201378. https:\/\/doi.org\/10.1145\/1047671.1047672","journal-title":"Commun ACM"},{"key":"226_CR8","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbaa019","author":"D Toro-Dominguez","year":"2020","unstructured":"Toro-Dominguez D, Villatoro-Garca JA, Martorell-Marugan J, Roman-Montoya Y, Alarcon-Riquelme ME, Carmona-Saez P (2020) A survey of gene expression meta-analysis: methods and applications. Briengs Bioinf. https:\/\/doi.org\/10.1093\/bib\/bbaa019","journal-title":"Briengs Bioinf"},{"key":"226_CR9","volume-title":"Big data: a revolution that will transform how we live, work, and think","author":"AI Naimi","year":"2014","unstructured":"Naimi AI, Westreich DJ (2014) Big data: a revolution that will transform how we live, work, and think. Oxford University Press, Oxford"},{"key":"226_CR10","doi-asserted-by":"publisher","first-page":"26411","DOI":"10.1109\/ACCESS.2019.2901742","volume":"7","author":"Z Liao","year":"2019","unstructured":"Liao Z, Zhang R, He S, Zeng D, Wang J, Kim H (2019) Deep learning-based data storage for low latency in data center networks. IEEE Access 7:26411\u201326417. https:\/\/doi.org\/10.1109\/ACCESS.2019.2901742","journal-title":"IEEE Access"},{"key":"226_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1186\/s13673-019-0179-4","volume":"9","author":"J Wang","year":"2019","unstructured":"Wang J, Gu X, Liu W, Sangaiah AK, Kim H (2019) An empower Hamilton loop based data collection algorithm with mobile agent for WSNs. Hum Centr Comput Inform Sci 9:18. https:\/\/doi.org\/10.1186\/s13673-019-0179-4","journal-title":"Hum Centr Comput Inform Sci"},{"key":"226_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-018-9892-7","author":"L Xiang","year":"2018","unstructured":"Xiang L, Shen X, Qin J, Hao W (2018) Discrete multi-graph hashing for large-scale visual search. Neural Process Lett. https:\/\/doi.org\/10.1007\/s11063-018-9892-7","journal-title":"Neural Process Lett"},{"issue":"2","key":"226_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.3966\/160792642020032102008","volume":"21","author":"J Wang","year":"2020","unstructured":"Wang J, Yang Y, Wang T, Sherratt RS, Zhang J (2020) Big data service architecture: a survey. J Internet Technol 21(2):393\u2013405. https:\/\/doi.org\/10.3966\/160792642020032102008","journal-title":"J Internet Technol"},{"issue":"10","key":"226_CR14","doi-asserted-by":"publisher","first-page":"3557","DOI":"10.1109\/TIE.2009.2039455","volume":"57","author":"VC Gungor","year":"2010","unstructured":"Gungor VC, Lu B, Hancke GP (2010) Opportunities and challenges of wireless sensor networks in smart grid. IEEE Trans Ind Electr 57(10):3557\u20133564. https:\/\/doi.org\/10.1109\/TIE.2009.2039455","journal-title":"IEEE Trans Ind Electr"},{"key":"226_CR15","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2957124","author":"Q Tang","year":"2019","unstructured":"Tang Q, Wang K, Song Y, Li F, Park JH (2019) Waiting time minimized charging and discharging strategy based on mobile edge computing supported by software defined network. IEEE Intern Things J. https:\/\/doi.org\/10.1109\/JIOT.2019.2957124","journal-title":"IEEE Intern Things J"},{"issue":"12","key":"226_CR16","doi-asserted-by":"publisher","first-page":"2292","DOI":"10.1016\/j.comnet.2008.04.002","volume":"52","author":"J Yick","year":"2008","unstructured":"Yick J, Mukherjee B, Ghosal D (2008) Wireless sensor network survey. Comput Netw 52(12):2292\u20132330. https:\/\/doi.org\/10.1016\/j.comnet.2008.04.002","journal-title":"Comput Netw"},{"issue":"11","key":"226_CR17","doi-asserted-by":"publisher","first-page":"2579","DOI":"10.3390\/s19112579","volume":"19","author":"J Wang","year":"2019","unstructured":"Wang J, Gao Y, Wang K, Sangaiah AK, Lim S-J (2019) An affinity propagation-based self-adaptive clustering method for wireless sensor networks. Sensors 19(11):2579. https:\/\/doi.org\/10.3390\/s19112579","journal-title":"Sensors"},{"issue":"3","key":"226_CR18","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1109\/JSYST.2019.2910409","volume":"13","author":"S He","year":"2019","unstructured":"He S, Xie K, Xie K, Xu C, Wang J (2019) Interference-aware multisource transmission in multiradio and multichannel wireless network. IEEE Syst J 13(3):2507\u20132518. https:\/\/doi.org\/10.1109\/JSYST.2019.2910409","journal-title":"IEEE Syst J"},{"issue":"8","key":"226_CR19","doi-asserted-by":"publisher","first-page":"1752","DOI":"10.3390\/s19081752","volume":"19","author":"W Wang","year":"2019","unstructured":"Wang W, Deng Z, Wang J (2019) Enhancing sensor network security with improved internal hardware design. Sensors 19(8):1752. https:\/\/doi.org\/10.3390\/s19081752","journal-title":"Sensors"},{"key":"226_CR20","doi-asserted-by":"publisher","DOI":"10.1186\/s13673-019-0200-y","author":"A Nieto","year":"2019","unstructured":"Nieto A, Rios R (2019) Cybersecurity profiles based on human-centric IoT devices. Hum Centr Comput Inform Sci. https:\/\/doi.org\/10.1186\/s13673-019-0200-y","journal-title":"Hum Centr Comput Inform Sci."},{"issue":"3","key":"226_CR21","doi-asserted-by":"publisher","first-page":"4844","DOI":"10.1109\/JIOT.2018.2872133","volume":"6","author":"W Li","year":"2019","unstructured":"Li W, Chen Z, Gao X, Liu W, Wang J (2019) Multimodel framework for indoor localization under mobile edge computing environment. IEEE Intern Things J 6(3):4844\u20134853. https:\/\/doi.org\/10.1109\/JIOT.2018.2872133","journal-title":"IEEE Intern Things J"},{"key":"226_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13673-018-0162-5","volume":"9","author":"D Jo","year":"2019","unstructured":"Jo D, Kim GJ (2019) Iot + AR: pervasive and augmented environments for \u201cdigi-log\u201d shopping experience. Hum Centr Comput Inform Sci 9:1. https:\/\/doi.org\/10.1186\/s13673-018-0162-5","journal-title":"Hum Centr Comput Inform Sci"},{"key":"226_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2949352","author":"W Li","year":"2019","unstructured":"Li W, Xu H, Li H, Yang Y, Sharma PK, Wang J, Singh S (2019) Complexity and algorithms for superposed data uploading problem in networks with smart devices. IEEE Intern Things J. https:\/\/doi.org\/10.1109\/JIOT.2019.2949352","journal-title":"IEEE Intern Things J"},{"issue":"1","key":"226_CR24","doi-asserted-by":"publisher","first-page":"122","DOI":"10.3390\/s20010122","volume":"20","author":"Y Luo","year":"2020","unstructured":"Luo Y, Li W, Qiu S (2020) Anomaly detection based latency-aware energy consumption optimization for iot data-flow services. Sensors 20(1):122. https:\/\/doi.org\/10.3390\/s20010122","journal-title":"Sensors"},{"issue":"2","key":"226_CR25","doi-asserted-by":"publisher","first-page":"695","DOI":"10.32604\/cmc.2020.08674","volume":"62","author":"J Wang","year":"2020","unstructured":"Wang J, Gao Y, Zhou C, Sherratt RS, Wang L (2020) Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs. Comput Mater Continua 62(2):695\u2013711. https:\/\/doi.org\/10.32604\/cmc.2020.08674","journal-title":"Comput Mater Continua"},{"issue":"2","key":"226_CR26","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.jnca.2012.12.023","volume":"36","author":"SM Bilal","year":"2013","unstructured":"Bilal SM, Bernardos CJ, Guerrero C (2013) Position-based routing in vehicular networks: a survey. J Netw Comput Appl 36(2):685\u2013697. https:\/\/doi.org\/10.1016\/j.jnca.2012.12.023","journal-title":"J Netw Comput Appl"},{"key":"226_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1863-4","author":"D Cao","year":"2018","unstructured":"Cao D, Zheng B, Ji B, Lei Z, Feng C (2018) A robust distance-based relay selection for message dissemination in vehicular network. Wireless Netw. https:\/\/doi.org\/10.1007\/s11276-018-1863-4","journal-title":"Wireless Netw"},{"key":"226_CR28","doi-asserted-by":"publisher","first-page":"12714","DOI":"10.1109\/ACCESS.2019.2892979","volume":"7","author":"D Cao","year":"2019","unstructured":"Cao D, Liu Y, Ma X, Wang J, Ji B, Feng C, Si J (2019) A relay-node selection on curve road in vehicular networks. IEEE Access 7:12714\u201312728. https:\/\/doi.org\/10.1109\/ACCESS.2019.2892979","journal-title":"IEEE Access"},{"issue":"6","key":"226_CR29","doi-asserted-by":"publisher","first-page":"2078","DOI":"10.3390\/app10062078","volume":"10","author":"K Gao","year":"2020","unstructured":"Gao K, Huang S, Han F, Li S, Wu W, Du R (2020) An integrated algorithm for intersection queue length estimation based on IoT in a mixed trac scenario. Appl Sci 10(6):2078. https:\/\/doi.org\/10.3390\/app10062078","journal-title":"Appl Sci"},{"key":"226_CR30","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/s13673-019-0174-9","volume":"9","author":"SS Alresheedi","year":"2019","unstructured":"Alresheedi SS, Lu S, Elaziz MEA, Ewees AA (2019) Improved multiobjective salp swarm optimization for virtual machine placement in cloud computing. Hum Centr Comput Inform Sci 9:15. https:\/\/doi.org\/10.1186\/s13673-019-0174-9","journal-title":"Hum Centr Comput Inform Sci"},{"key":"226_CR31","doi-asserted-by":"publisher","first-page":"10","DOI":"10.3390\/electronics8101106","volume":"8","author":"S He","year":"2019","unstructured":"He S, Xie K, Zhou X, Semong T, Wang J (2019) Multi-source reliable multicast routing with qos constraints of nfv in edge computing. Electronics 8:10. https:\/\/doi.org\/10.3390\/electronics8101106","journal-title":"Electronics"},{"key":"226_CR32","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.comcom.2019.12.018","volume":"151","author":"Q Tang","year":"2020","unstructured":"Tang Q, Changa L, Yang K, Wang K, Wanga J, KumarSharma P (2020) Task number maximization offloading strategy seamlessly adapted to UAV scenario. Comput Commun 151:19\u201330. https:\/\/doi.org\/10.1016\/j.comcom.2019.12.018","journal-title":"Comput Commun"},{"key":"226_CR33","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2941869","author":"K Gu","year":"2019","unstructured":"Gu K, Wu N, Yin B, Jia W (2019) Secure data query framework for cloud and fog computing. IEEE Trans Netw Serv Manag. https:\/\/doi.org\/10.1109\/TNSM.2019.2941869","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"226_CR34","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2019.2943524","author":"K Gu","year":"2019","unstructured":"Gu K, Wu N, Yin B, Jia W (2019) Secure data sequence query framework based on multiple fogs. IEEE Trans Emerg Top Comput. https:\/\/doi.org\/10.1109\/TETC.2019.2943524","journal-title":"IEEE Trans Emerg Top Comput"},{"issue":"4","key":"226_CR35","doi-asserted-by":"publisher","first-page":"041121","DOI":"10.1117\/1.JEI.22.4.041121","volume":"22","author":"RP Loce","year":"2013","unstructured":"Loce RP, Bernal EA, Wu W, Bala R (2013) Computer vision in roadway transportation systems: a survey. J Electr Imag 22(4):041121. https:\/\/doi.org\/10.1117\/1.JEI.22.4.041121","journal-title":"J Electr Imag"},{"key":"226_CR36","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2972338","author":"J Zhang","year":"2020","unstructured":"Zhang J, Xie Z, Sun J, Zou X, Wang J (2020) A cascaded r-cnn with multiscale attention and imbalanced samples for traffic sign detection. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2020.2972338","journal-title":"IEEE Access"},{"key":"226_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s12243-019-00731-9","author":"J Zhang","year":"2019","unstructured":"Zhang J, Wang W, Lu C, Wang J, Sangaiah AK (2019) Lightweight deep network for traffic sign classification. Ann Telecommun. https:\/\/doi.org\/10.1007\/s12243-019-00731-9","journal-title":"Ann Telecommun"},{"key":"226_CR38","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s13673-019-0176-7","volume":"9","author":"M Imran","year":"2019","unstructured":"Imran M, Durad MH, Khan FA, Derhab A (2019) Reducing the effects of dos attacks in software defined networks using parallel flow installation. Hum Centr Comput Inform Sci 9:16. https:\/\/doi.org\/10.1186\/s13673-019-0176-7","journal-title":"Hum Centr Comput Inform Sci"},{"key":"226_CR39","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.3934\/mbe.2020055","volume":"17","author":"L Xiang","year":"2020","unstructured":"Xiang L, Guo G, Yu J, Sheng V, Yang P (2020) A convolutional neural network-based linguistic steganalysis for synonym substitution steganography. Math Biosci Eng 17:1041\u20131058. https:\/\/doi.org\/10.3934\/mbe.2020055","journal-title":"Math Biosci Eng"},{"issue":"12","key":"226_CR40","doi-asserted-by":"publisher","first-page":"8450","DOI":"10.1109\/TCOMM.2019.2938950","volume":"67","author":"P Zhang","year":"2019","unstructured":"Zhang P, Wang J (2019) On enhancing network dynamic adaptability for compressive sensing in wsns. IEEE Trans Comm 67(12):8450\u20138459. https:\/\/doi.org\/10.1109\/TCOMM.2019.2938950","journal-title":"IEEE Trans Comm"},{"key":"226_CR41","doi-asserted-by":"publisher","first-page":"4047957","DOI":"10.1155\/2019\/4047957","volume":"2019","author":"F Yu","year":"2019","unstructured":"Yu F, Liu L, He B, Huang Y, Shi C, Cai S, Song Y, Du S, Wan Q (2019) Analysis and FPGA realization of a novel 5D hyperchaotic four-wing memristive system, active control synchronization, and secure communication application. Complexity 2019:4047957. https:\/\/doi.org\/10.1155\/2019\/4047957","journal-title":"Complexity"},{"key":"226_CR42","doi-asserted-by":"publisher","DOI":"10.1109\/TCDS.2019.2920364","author":"C Yuan","year":"2019","unstructured":"Yuan C, Xia Z, Sun X, Wu QJ (2019) Deep residual network with adaptive learning framework for fingerprint liveness detection. IEEE Trans Cogn Dev Syst. https:\/\/doi.org\/10.1109\/TCDS.2019.2920364","journal-title":"IEEE Trans Cogn Dev Syst"},{"issue":"1","key":"226_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3966\/160792642020012101001","volume":"21","author":"J Zhang","year":"2020","unstructured":"Zhang J, Zhong S, Wang T, Chao H-C, Wang J (2020) Blockchain-based systems and applications: a survey. J Intern Technol 21(1):1\u201314. https:\/\/doi.org\/10.3966\/160792642020012101001","journal-title":"J Intern Technol"},{"key":"226_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey RG, Fellows MR (2013) Fundamentals of parameterized complexity. Springer, London. https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"226_CR45","doi-asserted-by":"publisher","unstructured":"Xu C, Li W, Yang Y, Chen J, Wang J (2019) Resolution and domination: An improved exact maxsat algorithm. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pp. 1191\u20131197. https:\/\/doi.org\/10.24963\/ijcai.2019\/166","DOI":"10.24963\/ijcai.2019\/166"},{"issue":"8","key":"226_CR46","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1007\/s00224-018-9843-8","volume":"62","author":"Y Yang","year":"2018","unstructured":"Yang Y, Guo J (2018) Parameterized complexity of voter control in multi-peaked elections. Theory Comput Syst 62(8):1798\u20131825. https:\/\/doi.org\/10.1007\/s00224-018-9843-8","journal-title":"Theory Comput Syst"},{"key":"226_CR47","unstructured":"Ganian R, Kanj IA, Ordyniak S, Szeider S (2018) Parameterized algorithms for the matrix completion problem. In: Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsm\u00e4ssan, Stockholm, Sweden, July 10-15, 2018, pp. 1642\u20131651. http:\/\/proceedings.mlr.press\/v80\/ganian18a.html"},{"key":"226_CR48","doi-asserted-by":"publisher","unstructured":"Grohe M (2001) The parameterized complexity of database queries. In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA, pp. 82\u201392. https:\/\/doi.org\/10.1145\/375551.375564","DOI":"10.1145\/375551.375564"},{"key":"226_CR49","unstructured":"Yang Y, Wang J (2018) Parameterized complexity of multi-winner determination: More effort towards fixed-parameter tractability. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10-15, 2018, pp. 2142\u20132144. http:\/\/dl.acm.org\/citation.cfm?id=3238099"},{"issue":"1","key":"226_CR50","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s10878-018-00372-z","volume":"38","author":"Y Chen","year":"2019","unstructured":"Chen Y, Goebel R, Lin G, Su B, Xu Y, Zhang A (2019) An improved approximation algorithm for the minimum 3-path partition problem. J Comb Optim 38(1):150\u2013164. https:\/\/doi.org\/10.1007\/s10878-018-00372-z","journal-title":"J Comb Optim"},{"key":"226_CR51","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2017.09.023","volume":"734","author":"Y Yang","year":"2018","unstructured":"Yang Y, Shrestha YR, Li W, Guo J (2018) On the kernelization of split graph problems. Theor. Comput. Sci. 734:72\u201382. https:\/\/doi.org\/10.1016\/j.tcs.2017.09.023","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"226_CR52","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A Braunstein","year":"2005","unstructured":"Braunstein A, M\u00e9zard M, Zecchina R (2005) Survey propagation: an algorithm for satisfiability. Random Struct Algor 27(2):201\u2013226. https:\/\/doi.org\/10.1002\/rsa.20057","journal-title":"Random Struct Algor"},{"key":"226_CR53","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/264216.264220","volume":"2","author":"R Battiti","year":"1997","unstructured":"Battiti R, Protasi M (1997) Reactive search, a history-sensitive heuristic for MAX-SAT. ACM J Exp Algor 2:2. https:\/\/doi.org\/10.1145\/264216.264220","journal-title":"ACM J Exp Algor"},{"key":"226_CR54","doi-asserted-by":"crossref","unstructured":"Gallaire H, Minker J, Nicolas J-M (1989) Logic and databases: a deductive approach. In: Readings in Artificial Intelligence and Databases, pp. 231\u2013247. New York: Elsevier","DOI":"10.1016\/B978-0-934613-53-8.50020-0"},{"issue":"4","key":"226_CR55","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P Hansen","year":"1990","unstructured":"Hansen P, Jaumard B (1990) Algorithms for the maximum satisfiability problem. Computing 44(4):279\u2013303. https:\/\/doi.org\/10.1007\/BF02241270","journal-title":"Computing"},{"key":"226_CR56","unstructured":"Nguyen TA, Perkins WA, Laffey TJ, Pecora D (1985) Checking an expert systems knowledge base for consistency and completeness. In: Joshi AK (ed.) Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp. 375\u2013378"},{"issue":"1","key":"226_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(97)00223-8","volume":"65","author":"V Raman","year":"1998","unstructured":"Raman V, Ravikumar B, Rao SS (1998) A simplified NP-complete MAXSAT problem. Inform Process Lett 65(1):1\u20136. https:\/\/doi.org\/10.1016\/S0020-0190(97)00223-8","journal-title":"Inform Process Lett"},{"issue":"3","key":"226_CR58","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis M, Putnam H (1960) A computing procedure for quantification theory. J ACM 7(3):201\u2013215. https:\/\/doi.org\/10.1145\/321033.321034","journal-title":"J ACM"},{"issue":"4","key":"226_CR59","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"RG Downey","year":"1995","unstructured":"Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness I: basic results. SIAM J Comput 24(4):873\u2013921. https:\/\/doi.org\/10.1137\/S0097539792228228","journal-title":"SIAM J Comput"},{"key":"226_CR60","doi-asserted-by":"publisher","unstructured":"Niedermeier R, Rossmanith P (1999) New upper bounds for MaxSat. In: ICALP, pp. 575\u2013584. https:\/\/doi.org\/10.1007\/3-540-48523-6_54","DOI":"10.1007\/3-540-48523-6_54"},{"key":"226_CR61","doi-asserted-by":"publisher","unstructured":"Bansal N, Raman V (1999) Upper bounds for MaxSAT: Further improved. In: ISAAC, pp. 247\u2013258. https:\/\/doi.org\/10.1007\/3-540-46632-0_26","DOI":"10.1007\/3-540-46632-0_26"},{"issue":"1\u20133","key":"226_CR62","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.dam.2003.03.002","volume":"142","author":"J Chen","year":"2004","unstructured":"Chen J, Kanj IA (2004) Improved exact algorithms for Max-Sat. Discr Appl Math 142(1\u20133):17\u201327. https:\/\/doi.org\/10.1016\/j.dam.2003.03.002","journal-title":"Discr Appl Math"},{"key":"226_CR63","doi-asserted-by":"publisher","unstructured":"Bliznets I, Golovnev A (2012) A new algorithm for parameterized MAX-SAT. In: International Symposium on Parameterized and Exact Computation Springer, pp. 37\u201348. https:\/\/doi.org\/10.1007\/978-3-642-33293-7_6","DOI":"10.1007\/978-3-642-33293-7_6"},{"key":"226_CR64","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.tcs.2016.08.008","volume":"774","author":"C Xu","year":"2019","unstructured":"Xu C, Chen J, Wang J (2019) Resolution and linear CNF formulas: Improved (n, 3)-maxsat algorithms. Theor Comput Sci 774:113\u2013123. https:\/\/doi.org\/10.1016\/j.tcs.2016.08.008","journal-title":"Theor Comput Sci"},{"key":"226_CR65","doi-asserted-by":"publisher","unstructured":"Li W, Xu C, Wang J, Yang Y (2017) An improved branching algorithm for $$(n, 3)$$-MaxSAT based on refined observations. In: International Conference on Combinatorial Optimization and Applications, pp. 94\u2013108. https:\/\/doi.org\/10.1007\/978-3-319-71147-8_7","DOI":"10.1007\/978-3-319-71147-8_7"},{"issue":"3","key":"226_CR66","doi-asserted-by":"publisher","first-page":"308","DOI":"10.5555\/1145884.1145890","volume":"12","author":"E Prieto-Rodriguez","year":"2005","unstructured":"Prieto-Rodriguez E, Sloper C (2005) Reducing to independent set structure - the case of $$k$$-internal spanning tree. Nordic J Comput 12(3):308\u2013318. https:\/\/doi.org\/10.5555\/1145884.1145890","journal-title":"Nordic J Comput"},{"issue":"1","key":"226_CR67","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-011-9575-5","volume":"65","author":"D Binkele-Raible","year":"2013","unstructured":"Binkele-Raible D, Fernau H, Gaspers S, Liedloff M (2013) Exact and parameterized algorithms for max internal spanning tree. Algorithmica 65(1):95\u2013128. https:\/\/doi.org\/10.1007\/s00453-011-9575-5","journal-title":"Algorithmica"},{"issue":"2","key":"226_CR68","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00453-007-9133-3","volume":"54","author":"FV Fomin","year":"2009","unstructured":"Fomin FV, Gaspers S, Saurabh S, Stepanov AA (2009) On two techniques of combining branching and treewidth. Algorithmica 54(2):181\u2013207. https:\/\/doi.org\/10.1007\/s00453-007-9133-3","journal-title":"Algorithmica"},{"key":"226_CR69","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ic.2016.11.003","volume":"252","author":"W Li","year":"2017","unstructured":"Li W, Cao Y, Chen J, Wang J (2017) Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. Inf Comput 252:187\u2013200. https:\/\/doi.org\/10.1016\/j.ic.2016.11.003","journal-title":"Inf Comput"},{"issue":"45","key":"226_CR70","doi-asserted-by":"publisher","first-page":"4571","DOI":"10.1016\/j.tcs.2009.03.036","volume":"410","author":"GZ Gutin","year":"2009","unstructured":"Gutin GZ, Razgon I, Kim EJ (2009) Minimum leaf out-branching and related problems. Theor Comput Sci 410(45):4571\u20134579. https:\/\/doi.org\/10.1016\/j.tcs.2009.03.036","journal-title":"Theor Comput Sci"},{"issue":"7","key":"226_CR71","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.jcss.2010.01.001","volume":"76","author":"N Cohen","year":"2010","unstructured":"Cohen N, Fomin FV, Gutin GZ, Kim EJ, Saurabh S, Yeo A (2010) Algorithm for finding $$k$$-vertex out-trees and its application to $$k$$-internal out-branching problem. J Comput Syst Sci 76(7):650\u2013662. https:\/\/doi.org\/10.1016\/j.jcss.2010.01.001","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"226_CR72","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/s00453-011-9555-9","volume":"63","author":"FV Fomin","year":"2012","unstructured":"Fomin FV, Grandoni F, Lokshtanov D, Saurabh S (2012) Sharp separation and applications to exact and parameterized algorithms. Algorithmica 63(3):692\u2013706. https:\/\/doi.org\/10.1007\/s00453-011-9555-9","journal-title":"Algorithmica"},{"key":"226_CR73","doi-asserted-by":"publisher","unstructured":"Zehavi M (2013) Algorithms for $$k$$-internal out-branching. In: 8th International Symposium on Parameterized and Exact Computation, pp. 361\u2013373. https:\/\/doi.org\/10.1007\/978-3-319-03898-8_30","DOI":"10.1007\/978-3-319-03898-8_30"},{"issue":"4","key":"226_CR74","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00453-001-0116-5","volume":"33","author":"J Alber","year":"2002","unstructured":"Alber J, Bodlaender HL, Fernau H, Kloks T, Niedermeier R (2002) Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. Algorithmica 33(4):461\u2013493. https:\/\/doi.org\/10.1007\/s00453-001-0116-5","journal-title":"Algorithmica"},{"key":"226_CR75","doi-asserted-by":"publisher","unstructured":"Kanj IA, Perkovic L (2002) Improved parameterized algorithms for planar dominating set. In: 27th International Symposium on Mathematical Foundations of Computer Science, pp. 399\u2013410. https:\/\/doi.org\/10.1007\/3-540-45687-2_33","DOI":"10.1007\/3-540-45687-2_33"},{"issue":"3","key":"226_CR76","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J Alber","year":"2004","unstructured":"Alber J, Fellows MR, Niedermeier R (2004) Polynomial-time data reduction for dominating set. J ACM 51(3):363\u2013384. https:\/\/doi.org\/10.1145\/990308.990309","journal-title":"J ACM"},{"issue":"4","key":"226_CR77","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jcss.2004.03.007","volume":"71","author":"J Alber","year":"2005","unstructured":"Alber J, Fan H, Fellows MR, Fernau H, Niedermeier R, Rosamond FA, Stege U (2005) A refined search tree technique for dominating set on planar graphs. J Comput Syst Sci 71(4):385\u2013405. https:\/\/doi.org\/10.1016\/j.jcss.2004.03.007","journal-title":"J Comput Syst Sci"},{"key":"226_CR78","doi-asserted-by":"publisher","unstructured":"Chen J, Fernau H, Shaw P, Wang J, Yang Z (2012) Kernels for packing and covering problems - (extended abstract). In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, pp. 199\u2013211. https:\/\/doi.org\/10.1007\/978-3-642-29700-7_19","DOI":"10.1007\/978-3-642-29700-7_19"},{"key":"226_CR79","doi-asserted-by":"publisher","unstructured":"Lokshtanov D, Mnich M, Saurabh S (2009) Linear kernel for planar connected dominating set. In: Proceedings of Theory and Applications of Models of Computation. Lecture Notes in Computer Science, vol. 5532, pp. 281\u2013290. https:\/\/doi.org\/10.1007\/978-3-642-02017-9_31","DOI":"10.1007\/978-3-642-02017-9_31"},{"key":"226_CR80","doi-asserted-by":"publisher","unstructured":"Gu Q, Imani N (2010) Connectivity is not a limit for kernelization: Planar connected dominating set. In: Latin American Symposium on Theoretical Informatics, pp. 26\u201337. https:\/\/doi.org\/10.1007\/978-3-642-12200-2_4","DOI":"10.1007\/978-3-642-12200-2_4"},{"key":"226_CR81","doi-asserted-by":"publisher","unstructured":"Luo W, Wang J, Feng Q, Guo J, Chen J (2011) An improved kernel for planar connected dominating set. In: Proceedings of Theory Applications of Models of Computation-conference. Lecture Notes in Computer Science, vol. 6648, pp. 70\u201381. https:\/\/doi.org\/10.1007\/978-3-642-20877-5_8","DOI":"10.1007\/978-3-642-20877-5_8"},{"issue":"2","key":"226_CR82","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s00453-012-9681-z","volume":"68","author":"N Misra","year":"2014","unstructured":"Misra N, Philip G, Raman V, Saurabh S (2014) The kernelization complexity of connected domination in graphs with (no) small cycles. Algorithmica 68(2):504\u2013530. https:\/\/doi.org\/10.1007\/s00453-012-9681-z","journal-title":"Algorithmica"},{"key":"226_CR83","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2016.06.012","volume":"657","author":"W Li","year":"2017","unstructured":"Li W, Feng Q, Chen J, Hu S (2017) Improved kernel results for some FPT problems based on simple observations. Theor Comput Sci 657:20\u201327. https:\/\/doi.org\/10.1016\/j.tcs.2016.06.012","journal-title":"Theor Comput Sci"},{"key":"226_CR84","doi-asserted-by":"publisher","unstructured":"Fernau H (2006) Edge dominating set: Efficient enumeration-based exact algorithms. In: International Workshop on Parameterized and Exact Computation, pp. 142\u2013153. https:\/\/doi.org\/10.1007\/11847250_13","DOI":"10.1007\/11847250_13"},{"key":"226_CR85","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2012.06.022","volume":"511","author":"M Xiao","year":"2013","unstructured":"Xiao M, Kloks T, Poon S (2013) New parameterized algorithms for the edge dominating set problem. Theor Comput Sci 511:147\u2013158. https:\/\/doi.org\/10.1016\/j.tcs.2012.06.022","journal-title":"Theor Comput Sci"},{"key":"226_CR86","unstructured":"Rodr\u00edguez EP (2005) Systematic kernelization in FPT algorithm design. PhD thesis, The University of Newcastle"},{"key":"226_CR87","doi-asserted-by":"publisher","unstructured":"Hagerup T (2012) Kernels for edge dominating set: Simpler or smaller. In: Rovan B, Sassone V, Widmayer P (eds) 37th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 7464, pp. 491\u2013502 (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_44","DOI":"10.1007\/978-3-642-32589-2_44"},{"key":"226_CR88","volume-title":"Operating system concepts","author":"A Silberschatz","year":"2005","unstructured":"Silberschatz A, Galvin PB, Gagne G (2005) Operating system concepts. Wiley, New York"},{"key":"226_CR89","doi-asserted-by":"publisher","unstructured":"Festa P, Pardalos PM, Resende MGC (2009) Feedback set problems. In: Floudas CA, Pardalos PM (eds.) Encyclopedia of Optimization, Second Edition, pp. 1005\u20131016. https:\/\/doi.org\/10.1007\/978-0-387-74759-0_178","DOI":"10.1007\/978-0-387-74759-0_178"},{"key":"226_CR90","doi-asserted-by":"publisher","unstructured":"Raman V, Saurabh S, Subramanian CR (2002) Faster fixed parameter tractable algorithms for undirected feedback vertex set. In: 13th International Symposium on Algorithms and Computation, pp. 241\u2013248. https:\/\/doi.org\/10.1007\/3-540-36136-7_22","DOI":"10.1007\/3-540-36136-7_22"},{"key":"226_CR91","doi-asserted-by":"publisher","unstructured":"Kanj IA, Pelsmajer MJ, Schaefer M (2004) Parameterized algorithms for feedback vertex set. In: International Workshop on Parameterized and Exact Computation, pp. 235\u2013247. https:\/\/doi.org\/10.1007\/978-3-540-28639-4_21","DOI":"10.1007\/978-3-540-28639-4_21"},{"issue":"3","key":"226_CR92","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s00224-007-1345-z","volume":"41","author":"FKHA Dehne","year":"2007","unstructured":"Dehne FKHA, Fellows MR, Langston MA, Rosamond FA, Stevens K (2007) An $$o(2^{O(k)}) n^3)$$ FPT algorithm for the undirected feedback vertex set problem. Theory Comput Syst 41(3):479\u2013492. https:\/\/doi.org\/10.1007\/s00224-007-1345-z","journal-title":"Theory Comput Syst"},{"key":"226_CR93","doi-asserted-by":"publisher","unstructured":"Chen J, Fomin FV, Liu Y, Lu S, Villanger Y (2007) Improved algorithms for the feedback vertex set problems. In: 10th International Workshop on Algorithms and Data Structures, pp. 422\u2013433. https:\/\/doi.org\/10.1007\/978-3-540-73951-7_37","DOI":"10.1007\/978-3-540-73951-7_37"},{"issue":"1","key":"226_CR94","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00453-014-9904-6","volume":"73","author":"Y Cao","year":"2015","unstructured":"Cao Y, Chen J, Liu Y (2015) On feedback vertex set: new measure and new structures. Algorithmica 73(1):63\u201386. https:\/\/doi.org\/10.1007\/s00453-014-9904-6","journal-title":"Algorithmica"},{"issue":"10","key":"226_CR95","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.ipl.2014.05.001","volume":"114","author":"T Kociumaka","year":"2014","unstructured":"Kociumaka T, Pilipczuk M (2014) Faster deterministic feedback vertex set. Inform Process Lett 114(10):556\u2013560. https:\/\/doi.org\/10.1016\/j.ipl.2014.05.001","journal-title":"Inform Process Lett"},{"key":"226_CR96","doi-asserted-by":"publisher","unstructured":"Cao Y (2018) A naive algorithm for feedback vertex set. In: 1st Symposium on Simplicity in Algorithms, pp. 1\u2013119. https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2018.1","DOI":"10.4230\/OASIcs.SOSA.2018.1"},{"key":"226_CR97","doi-asserted-by":"publisher","unstructured":"Burrage K, Estivill-Castro V, Fellows MR, Langston MA, Mac S, Rosamond FA (2006) The undirected feedback vertex set problem has a poly(k) kernel. In: International Workshop on Parameterized and Exact Computation, pp. 192\u2013202. https:\/\/doi.org\/10.1007\/11847250_18","DOI":"10.1007\/11847250_18"},{"issue":"3","key":"226_CR98","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/s00224-009-9234-2","volume":"46","author":"HL Bodlaender","year":"2010","unstructured":"Bodlaender HL, van Dijk TC (2010) A cubic kernel for feedback vertex set and loop cutset. Theory Comput Syst 46(3):566\u2013597. https:\/\/doi.org\/10.1007\/s00224-009-9234-2","journal-title":"Theory Comput Syst"},{"issue":"2","key":"226_CR99","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721848","volume":"6","author":"S Thomass\u00e9","year":"2010","unstructured":"Thomass\u00e9 S (2010) A $$4k^2$$ kernel for feedback vertex set. ACM Trans Algor 6(2):1\u20138. https:\/\/doi.org\/10.1145\/1721837.1721848","journal-title":"ACM Trans Algor"},{"key":"226_CR100","doi-asserted-by":"publisher","unstructured":"Bodlaender HL, Penninkx E (2008) A linear kernel for planar feedback vertex set. In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 160\u2013171. https:\/\/doi.org\/10.1007\/978-3-540-79723-4_16","DOI":"10.1007\/978-3-540-79723-4_16"},{"key":"226_CR101","doi-asserted-by":"publisher","unstructured":"Abu-Khzam FN, Khuzam MB (2012) An improved kernel for the undirected planar feedback vertex set problem. In: 7th International Symposium on Parameterized and Exact Computation, pp. 264\u2013273. https:\/\/doi.org\/10.1007\/978-3-642-33293-7_25","DOI":"10.1007\/978-3-642-33293-7_25"},{"key":"226_CR102","doi-asserted-by":"publisher","unstructured":"Xiao M (2014) A new linear kernel for undirected planar feedback vertex set: Smaller and simpler. In: 10th International Conference on Algorithmic Aspects in Information and Management, pp. 288\u2013298. https:\/\/doi.org\/10.1007\/978-3-319-07956-1_26","DOI":"10.1007\/978-3-319-07956-1_26"},{"key":"226_CR103","doi-asserted-by":"publisher","unstructured":"Bonamy M, Kowalik L (2014) A $$14k$$-kernel for planar feedback vertex set via region decomposition. In: International Symposium on Parameterized and Exact Computation, pp. 97\u2013109. https:\/\/doi.org\/10.1007\/978-3-319-13524-3_9","DOI":"10.1007\/978-3-319-13524-3_9"},{"key":"226_CR104","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2016.05.031","volume":"645","author":"M Bonamy","year":"2016","unstructured":"Bonamy M, Kowalik L (2016) A $$13k$$-kernel for planar feedback vertex set via region decomposition. Theor Comput Sci 645:25\u201340. https:\/\/doi.org\/10.1016\/j.tcs.2016.05.031","journal-title":"Theor Comput Sci"},{"issue":"3","key":"226_CR105","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1137\/0222038","volume":"22","author":"JF Buss","year":"1993","unstructured":"Buss JF, Goldsmith J (1993) Nondeterminism within P. SIAM J Comput 22(3):560\u2013572. https:\/\/doi.org\/10.1137\/0222038","journal-title":"SIAM J Comput"},{"issue":"3","key":"226_CR106","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(97)00213-5","volume":"65","author":"R Balasubramanian","year":"1998","unstructured":"Balasubramanian R, Fellows MR, Raman V (1998) An improved fixed-parameter algorithm for vertex cover. Inf Process Lett 65(3):163\u2013168. https:\/\/doi.org\/10.1016\/S0020-0190(97)00213-5","journal-title":"Inf Process Lett"},{"key":"226_CR107","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR (1999) Parameterized complexity. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"key":"226_CR108","doi-asserted-by":"publisher","unstructured":"Niedermeier R, Rossmanith P (1999) Upper bounds for vertex cover further improved. In: 16th annual symposium on theoretical aspects of computer science, pp. 561\u2013570. https:\/\/doi.org\/10.1007\/3-540-49116-3_53","DOI":"10.1007\/3-540-49116-3_53"},{"issue":"2","key":"226_CR109","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J Chen","year":"2001","unstructured":"Chen J, Kanj IA, Jia W (2001) Vertex cover: further observations and further improvements. J Algor 41(2):280\u2013301. https:\/\/doi.org\/10.1006\/jagm.2001.1186","journal-title":"J Algor"},{"key":"226_CR110","doi-asserted-by":"publisher","unstructured":"Chen J, Kanj IA, Xia G (2006) Improved parameterized upper bounds for vertex cover. In: 31st International symposium on mathematical foundations of computer science, pp. 238\u2013249. https:\/\/doi.org\/10.1007\/11821069_21","DOI":"10.1007\/11821069_21"},{"issue":"1","key":"226_CR111","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser GL, Trotter LE Jr (1975) Vertex packings: structural properties and algorithms. Math Program 8(1):232\u2013248. https:\/\/doi.org\/10.1007\/BF01580444","journal-title":"Math Program"},{"key":"226_CR112","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-0208(08)72955-4","volume":"19","author":"C Ebengger","year":"1984","unstructured":"Ebengger C, Hammer P, de Werra D (1984) Pseudo-boolean functions and stability of graphs. Ann Discr Math 19:83\u201393. https:\/\/doi.org\/10.1016\/S0304-0208(08)72955-4","journal-title":"Ann Discr Math"},{"issue":"3","key":"226_CR113","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-1328-0","volume":"41","author":"FN Abu-Khzam","year":"2007","unstructured":"Abu-Khzam FN, Fellows MR, Langston MA, Suters WH (2007) Crown structures for vertex cover kernelization. Theory Comput Syst 41(3):411\u2013430. https:\/\/doi.org\/10.1007\/s00224-007-1328-0","journal-title":"Theory Comput Syst"},{"key":"226_CR114","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2018.05.004","volume":"739","author":"W Li","year":"2018","unstructured":"Li W, Zhu B (2018) A $$2k$$-kernelization algorithm for vertex cover based on crown decomposition. Theor Comput Sci 739:80\u201385. https:\/\/doi.org\/10.1016\/j.tcs.2018.05.004","journal-title":"Theor Comput Sci"},{"key":"226_CR115","doi-asserted-by":"publisher","unstructured":"Grantson M, Levcopoulos C (2006) Covering a set of points with a minimum number of lines. In: 6th Italian Conference on Algorithms and Complexity, pp. 6\u201317. https:\/\/doi.org\/10.1007\/11758471_4","DOI":"10.1007\/11758471_4"},{"issue":"44\u201346","key":"226_CR116","doi-asserted-by":"publisher","first-page":"4005","DOI":"10.1016\/j.tcs.2010.08.012","volume":"411","author":"J Wang","year":"2010","unstructured":"Wang J, Li W, Chen J (2010) A parameterized algorithm for the hyperplane-cover problem. Theor Comput Sci 411(44\u201346):4005\u20134009. https:\/\/doi.org\/10.1016\/j.tcs.2010.08.012","journal-title":"Theor Comput Sci"},{"key":"226_CR117","doi-asserted-by":"publisher","unstructured":"Afshani P, Berglin E, van Duijn I, Nielsen JS (2016) Applications of incidence bounds in point covering problems. In: 32nd International symposium on computational geometry, pp. 60\u201316015. https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2016.60","DOI":"10.4230\/LIPIcs.SoCG.2016.60"},{"issue":"3","key":"226_CR118","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.tcs.2005.10.009","volume":"351","author":"E Prieto-Rodriguez","year":"2006","unstructured":"Prieto-Rodriguez E, Sloper C (2006) Looking at the stars. Theor Comput Sci 351(3):437\u2013445. https:\/\/doi.org\/10.1016\/j.tcs.2005.10.009","journal-title":"Theor Comput Sci"},{"issue":"5","key":"226_CR119","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2009.12.002","volume":"110","author":"J Wang","year":"2010","unstructured":"Wang J, Ning D, Feng Q, Chen J (2010) An improved kernelization for $$p_2$$-packing. Inform Process Lett 110(5):188\u2013192. https:\/\/doi.org\/10.1016\/j.ipl.2009.12.002","journal-title":"Inform Process Lett"},{"key":"226_CR120","doi-asserted-by":"publisher","unstructured":"Li W, Ye J, Cao Y (2018) Kernelization for $$p_2$$-packing: A gerrymandering approach. In: International frontiers of algorithmics workshop, pp. 140\u2013153. https:\/\/doi.org\/10.1007\/978-3-319-78455-7_11","DOI":"10.1007\/978-3-319-78455-7_11"},{"issue":"2","key":"226_CR121","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00453-004-1096-z","volume":"40","author":"J Chen","year":"2004","unstructured":"Chen J, Friesen DK, Jia W, Kanj IA (2004) Using nondeterminism to design efficient deterministic algorithms. Algorithmica 40(2):83\u201397. https:\/\/doi.org\/10.1007\/s00453-004-1096-z","journal-title":"Algorithmica"},{"issue":"2","key":"226_CR122","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00453-007-9146-y","volume":"52","author":"MR Fellows","year":"2008","unstructured":"Fellows MR, Knauer C, Nishimura N, Ragde P, Rosamond FA, Stege U, Thilikos DM, Whitesides S (2008) Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 52(2):167\u2013176. https:\/\/doi.org\/10.1007\/s00453-007-9146-y","journal-title":"Algorithmica"},{"key":"226_CR123","doi-asserted-by":"publisher","unstructured":"Chen J, Lu S, Sze SH, Zhang F (2007) Improved algorithms for path, matching, and packing problems. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, pp. 298\u2013307. https:\/\/doi.org\/10.1145\/1283383.1283415","DOI":"10.1145\/1283383.1283415"},{"key":"226_CR124","doi-asserted-by":"publisher","unstructured":"Wang J, Feng Q (2008) Improved parameterized algorithms for weighted 3-set packing. In: 14th annual international conference on computing and combinatorics, pp. 130\u2013139. https:\/\/doi.org\/10.1007\/978-3-540-69733-6_14","DOI":"10.1007\/978-3-540-69733-6_14"},{"issue":"1","key":"226_CR125","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jalgor.2003.07.001","volume":"50","author":"W Jia","year":"2004","unstructured":"Jia W, Zhang C, Chen J (2004) An efficient parameterized algorithm for $$m$$-Set Packing. J Algor 50(1):106\u2013117. https:\/\/doi.org\/10.1016\/j.jalgor.2003.07.001","journal-title":"J Algor"},{"issue":"4","key":"226_CR126","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.disopt.2008.07.002","volume":"5","author":"J Wang","year":"2008","unstructured":"Wang J, Liu Y (2008) Parameterized algorithms for weighted matching and packing problems. Discr Optim 5(4):748\u2013754. https:\/\/doi.org\/10.1016\/j.disopt.2008.07.002","journal-title":"Discr Optim"},{"issue":"23","key":"226_CR127","doi-asserted-by":"publisher","first-page":"2503","DOI":"10.1016\/j.tcs.2010.10.042","volume":"412","author":"J Chen","year":"2011","unstructured":"Chen J, Feng Q, Liu Y, Lu S, Wang J (2011) Improved deterministic algorithms for weighted matching and packing problems. Theor Comput Sci 412(23):2503\u20132512. https:\/\/doi.org\/10.1016\/j.tcs.2010.10.042","journal-title":"Theor Comput Sci"},{"issue":"18","key":"226_CR128","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1016\/j.tcs.2010.12.048","volume":"412","author":"J Wang","year":"2011","unstructured":"Wang J, Feng Q, Chen J (2011) An $$o^*(3.53^{3k})$$-time parameterized algorithm for the $$3$$-set packing problem. Theor Comput Sci 412(18):1745\u20131753. https:\/\/doi.org\/10.1016\/j.tcs.2010.12.048","journal-title":"Theor Comput Sci"},{"key":"226_CR129","doi-asserted-by":"publisher","unstructured":"Mathieson L, Prieto-Rodriguez E, Shaw P (2004) Packing edge disjoint triangles: a parameterized view. In: First international workshop on parameterized and exact computation, pp. 127\u2013137. https:\/\/doi.org\/10.1007\/978-3-540-28639-4_12","DOI":"10.1007\/978-3-540-28639-4_12"},{"issue":"7","key":"226_CR130","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ipl.2014.02.003","volume":"114","author":"Y Yang","year":"2014","unstructured":"Yang Y (2014) Towards optimal kernel for edge-disjoint triangle packing. Inform Process Lett 114(7):344\u2013348. https:\/\/doi.org\/10.1016\/j.ipl.2014.02.003","journal-title":"Inform Process Lett"},{"key":"226_CR131","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ipl.2018.10.006","volume":"142","author":"W Lin","year":"2019","unstructured":"Lin W, Xiao M (2019) A $$(3+\\epsilon )k$$-vertex kernel for edge-disjoint triangle packing. Inform Process Lett 142:20\u201326. https:\/\/doi.org\/10.1016\/j.ipl.2018.10.006","journal-title":"Inform Process Lett"}],"container-title":["Human-centric Computing and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13673-020-00226-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13673-020-00226-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13673-020-00226-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T12:11:35Z","timestamp":1627647095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s13673-020-00226-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,2]]},"references-count":131,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1186\/s13673-020-00226-w","relation":{},"ISSN":["2192-1962"],"issn-type":[{"value":"2192-1962","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,2]]},"assertion":[{"value":"7 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"No competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"29"}}