{"id":"https://openalex.org/W3049149475","doi":"https://doi.org/10.3390/a13080197","title":"A Brief Survey of Fixed-Parameter Parallelism","display_name":"A Brief Survey of Fixed-Parameter Parallelism","publication_year":2020,"publication_date":"2020-08-14","ids":{"openalex":"https://openalex.org/W3049149475","doi":"https://doi.org/10.3390/a13080197","mag":"3049149475"},"language":"en","primary_location":{"id":"doi:10.3390/a13080197","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13080197","pdf_url":"https://www.mdpi.com/1999-4893/13/8/197/pdf?version=1597392852","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/8/197/pdf?version=1597392852","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090561191","display_name":"Faisal N. Abu-Khzam","orcid":"https://orcid.org/0000-0001-5221-8421"},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":true,"raw_author_name":"Faisal N. Abu-Khzam","raw_affiliation_strings":["Department of Computer Science and Mathematics, Lebanese American University, Beirut 1102 2801, Lebanon"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Lebanese American University, Beirut 1102 2801, Lebanon","institution_ids":["https://openalex.org/I56306041"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054844555","display_name":"Karam Al Kontar","orcid":null},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Karam Al Kontar","raw_affiliation_strings":["Department of Computer Science and Mathematics, Lebanese American University, Beirut 1102 2801, Lebanon"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Lebanese American University, Beirut 1102 2801, Lebanon","institution_ids":["https://openalex.org/I56306041"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090561191"],"corresponding_institution_ids":["https://openalex.org/I56306041"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2814,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62011346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"8","first_page":"197","last_page":"197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9023140668869019},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.9010487794876099},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6995270848274231},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6054703593254089},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5695589780807495},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5011985301971436},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4409412741661072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41298601031303406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32248079776763916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28433918952941895},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2504207491874695}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9023140668869019},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9010487794876099},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6995270848274231},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6054703593254089},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5695589780807495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5011985301971436},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4409412741661072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41298601031303406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32248079776763916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28433918952941895},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2504207491874695},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a13080197","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13080197","pdf_url":"https://www.mdpi.com/1999-4893/13/8/197/pdf?version=1597392852","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:9e5b0443cce04be19e0c304ce36894e7","is_oa":true,"landing_page_url":"https://doaj.org/article/9e5b0443cce04be19e0c304ce36894e7","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 8, p 197 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/8/197/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a13080197","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 13; Issue 8; Pages: 197","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13080197","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13080197","pdf_url":"https://www.mdpi.com/1999-4893/13/8/197/pdf?version=1597392852","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3049149475.pdf","grobid_xml":"https://content.openalex.org/works/W3049149475.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W81677511","https://openalex.org/W272087405","https://openalex.org/W1436538595","https://openalex.org/W1492022068","https://openalex.org/W1527197079","https://openalex.org/W1532393971","https://openalex.org/W1558630420","https://openalex.org/W1598441350","https://openalex.org/W1737447011","https://openalex.org/W1899379166","https://openalex.org/W1971393213","https://openalex.org/W1973852671","https://openalex.org/W1974692335","https://openalex.org/W1974810008","https://openalex.org/W1980069488","https://openalex.org/W2000763343","https://openalex.org/W2015480586","https://openalex.org/W2017492235","https://openalex.org/W2020681752","https://openalex.org/W2077654620","https://openalex.org/W2083216910","https://openalex.org/W2096768449","https://openalex.org/W2128626931","https://openalex.org/W2143406303","https://openalex.org/W2168123742","https://openalex.org/W2296148711","https://openalex.org/W2477674116","https://openalex.org/W2542186661","https://openalex.org/W2618066705","https://openalex.org/W2827001132","https://openalex.org/W2900662096","https://openalex.org/W2911549278","https://openalex.org/W2914414140","https://openalex.org/W2962759123","https://openalex.org/W2963069757","https://openalex.org/W2963098562","https://openalex.org/W4205585032","https://openalex.org/W4298227433","https://openalex.org/W6603244703","https://openalex.org/W6884302492"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004","https://openalex.org/W2748846180"],"abstract_inverted_index":{"This":[0],"paper":[1],"provides":[2],"an":[3],"overview":[4],"of":[5,8,36],"the":[6],"field":[7],"parameterized":[9],"parallel":[10,58],"complexity":[11],"by":[12],"surveying":[13],"previous":[14],"work":[15],"in":[16],"addition":[17],"to":[18,55],"presenting":[19],"a":[20,33],"few":[21],"new":[22,27],"observations":[23],"and":[24,49],"exploring":[25],"potential":[26],"directions.":[28],"In":[29],"particular,":[30],"we":[31],"present":[32],"general":[34],"view":[35],"how":[37],"known":[38],"FPT":[39],"techniques,":[40],"such":[41],"as":[42],"bounded":[43],"search":[44],"trees,":[45],"color":[46],"coding,":[47],"kernelization,":[48],"iterative":[50],"compression,":[51],"can":[52],"be":[53],"modified":[54],"produce":[56],"fixed-parameter":[57],"algorithms.":[59]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}