{"id":"https://openalex.org/W3114276557","doi":"https://doi.org/10.1007/s00453-022-00970-8","title":"On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan","display_name":"On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan","publication_year":2022,"publication_date":"2022-05-07","ids":{"openalex":"https://openalex.org/W3114276557","doi":"https://doi.org/10.1007/s00453-022-00970-8","mag":"3114276557","pmid":"https://pubmed.ncbi.nlm.nih.gov/35880200"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-00970-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00970-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00970-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00970-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Algorithms and Complexity Group, Utrecht University, Utrecht, Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1848-0076","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, Utrecht University, Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053202642","display_name":"C\u00e9line M. F. Swennenhuis","orcid":"https://orcid.org/0000-0001-9654-8094"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"C\u00e9line M. F. Swennenhuis","raw_affiliation_strings":["Combinatorial Optimization Group, Eindhoven University of Technology, Eindhoven, Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-9654-8094","affiliations":[{"raw_affiliation_string":"Combinatorial Optimization Group, Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053202642"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.1355,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48616587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"84","issue":"8","first_page":"2309","last_page":"2334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9912999868392944,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.896014928817749},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8453234434127808},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6536046862602234},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6331369280815125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6134871244430542},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4966469407081604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3763818144798279},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3573782742023468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35622555017471313},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.30082643032073975}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.896014928817749},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8453234434127808},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6536046862602234},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6331369280815125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6134871244430542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4966469407081604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3763818144798279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3573782742023468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35622555017471313},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.30082643032073975},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/s00453-022-00970-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00970-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00970-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmid:35880200","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/35880200","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":null},{"id":"pmh:oai:pure.tue.nl:openaire/1dfda552-8d00-4820-a6fd-0f10fccf657b","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/1dfda552-8d00-4820-a6fd-0f10fccf657b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nederlof, J & Swennenhuis, C M F 2022, 'On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan', Algorithmica, vol. 84, no. 8, 8, pp. 2309-2334. https://doi.org/10.1007/s00453-022-00970-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:drops-oai.dagstuhl.de:13328","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"pmh:oai:dspace.library.uu.nl:1874/431859","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/431859","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:pubmedcentral.nih.gov:9304082","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/9304082","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"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":"Algorithmica","raw_type":"Text"},{"id":"pmh:oai:pure.tue.nl:publications/1dfda552-8d00-4820-a6fd-0f10fccf657b","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85129546026&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Nederlof, J & Swennenhuis, C M F 2022, 'On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan', Algorithmica, vol. 84, no. 8, 8, pp. 2309-2334. https://doi.org/10.1007/s00453-022-00970-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/1dfda552-8d00-4820-a6fd-0f10fccf657b","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/1dfda552-8d00-4820-a6fd-0f10fccf657b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Algorithmica, 84(8):8, 2309 - 2334. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/414804","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/414804","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 180, 25:1. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik GmbH","raw_type":"info:eu-repo/semantics/bookpart"},{"id":"doi:10.4230/lipics.ipec.2020.25","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2020.25","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.1007/s00453-022-00970-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00970-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00970-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4009995372","display_name":null,"funder_award_id":"853234","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G628422989","display_name":null,"funder_award_id":"617951","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G754337842","display_name":null,"funder_award_id":"613.009.031b","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3114276557.pdf","grobid_xml":"https://content.openalex.org/works/W3114276557.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W123039402","https://openalex.org/W1488422606","https://openalex.org/W1604977153","https://openalex.org/W1790661775","https://openalex.org/W1988565742","https://openalex.org/W2010484711","https://openalex.org/W2011039300","https://openalex.org/W2029604753","https://openalex.org/W2035177751","https://openalex.org/W2045326192","https://openalex.org/W2053640772","https://openalex.org/W2076515080","https://openalex.org/W2097078863","https://openalex.org/W2150004999","https://openalex.org/W2151677066","https://openalex.org/W2168633992","https://openalex.org/W2280590529","https://openalex.org/W2296148711","https://openalex.org/W2398844060","https://openalex.org/W2611844708","https://openalex.org/W2743045177","https://openalex.org/W2751935900","https://openalex.org/W2888685133","https://openalex.org/W2914414140","https://openalex.org/W2962877422","https://openalex.org/W2999396429","https://openalex.org/W3101862638","https://openalex.org/W4205585032"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W1976468483","https://openalex.org/W1986447712","https://openalex.org/W2110193191","https://openalex.org/W3204654320"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"study":[2],"a":[3,20,139,213],"natural":[4],"variant":[5,16,156],"of":[6,19,56,66,94,231,274],"scheduling":[7,12,21,58,67,276],"that":[8,69,142,220],"we":[9,48,88,153,207,236],"call":[10],"partial":[11,57,275],":":[13],"in":[14,160],"this":[15],"an":[17,25,33,238],"instance":[18],"problem":[22],"along":[23],"with":[24,92,281,307],"integer":[26],"k":[27,41,62,183,200],"is":[28,143,150,304],"given":[29],"and":[30,73,83,179,216,287],"one":[31,230],"seeks":[32],"optimal":[34,223],"schedule":[35],"where":[36,290],"not":[37],"all,":[38],"but":[39],"only":[40],"jobs,":[42,284],"have":[43],"to":[44,50,157,271],"be":[45,158],"processed.":[46],"Specifically,":[47],"aim":[49],"determine":[51],"the":[52,71,95,210,225,279,305],"fine-grained":[53],"parameterized":[54,60,198],"complexity":[55],"problems":[59,68,277],"by":[61,182,199],"for":[63,138,203],"all":[64],"variants":[65],"minimize":[70],"makespan":[72,280],"involve":[74],"unit/arbitrary":[75],"processing":[76],"times,":[77],"identical/unrelated":[78],"parallel":[79],"machines,":[80],"release/due":[81],"dates,":[82,289],"precedence":[84,285,308],"constraints.":[85,309],"That":[86],"is,":[87],"investigate":[89,209],"whether":[90],"algorithms":[91],"runtimes":[93],"type":[96],"$$f(k)n^{{\\mathcal":[97],"{O}}(1)}$$":[98],"<mml:math":[99,122,163,171,188,241,292],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[100,123,164,172,189,242,293],"<mml:mrow>":[101,103,110,126,173,190,243,244,252,260,294],"<mml:mi>f</mml:mi>":[102,129],"<mml:mo>(</mml:mo>":[104,112,128,130,246,254,297],"<mml:mi>k</mml:mi>":[105,131,250,253],"<mml:mo>)</mml:mo>":[106,114,132,133,264,265,301],"</mml:mrow>":[107,115,117,134,176,195,247,258,266,267,302],"<mml:msup>":[108,124,248],"<mml:mi>n</mml:mi>":[109,125],"<mml:mi>O</mml:mi>":[111,127,245],"<mml:mn>1</mml:mn>":[113,193],"</mml:msup>":[116,135,251],"</mml:math>":[118,136,166,177,196,268,303],"or":[119,185],"$$n^{{\\mathcal":[120],"{O}}(f(k))}$$":[121],"exist":[137],"function":[140],"f":[141],"as":[144,146],"small":[145],"possible.":[147],"Our":[148],"contribution":[149],"two-fold:":[151],"First,":[152],"categorize":[154],"each":[155],"either":[159],"$${\\mathsf":[161,186],"{P}}$$":[162],"<mml:mi>P</mml:mi>":[165,175],",":[167,184],"$${{\\mathsf":[168],"{N}}}{{\\mathsf":[169],"{P}}}$$":[170],"<mml:mi>N</mml:mi>":[174],"-complete":[178],"fixed-parameter":[180],"tractable":[181],"{W}}[1]$$":[187],"<mml:mi>W</mml:mi>":[191],"<mml:mo>[</mml:mo>":[192],"<mml:mo>]</mml:mo>":[194],"-hard":[197],".":[201],"Second,":[202],"many":[204],"interesting":[205],"cases":[206],"further":[208],"runtime":[211],"on":[212],"finer":[214],"scale":[215],"obtain":[217],"run":[218],"times":[219],"are":[221],"(almost)":[222],"assuming":[224],"Exponential":[226],"Time":[227],"Hypothesis.":[228],"As":[229],"our":[232],"main":[233],"technical":[234],"contributions,":[235],"give":[237],"$${\\mathcal":[239],"{O}}(8^kk(|V|+|E|))$$":[240],"<mml:mn>8</mml:mn>":[249],"<mml:mo>|</mml:mo>":[255,257,261,263],"<mml:mi>V</mml:mi>":[256,298],"<mml:mo>+</mml:mo>":[259],"<mml:mi>E</mml:mi>":[262,300],"time":[269],"algorithm":[270],"solve":[272],"instances":[273],"minimizing":[278],"unit":[282],"length":[283],"constraints":[286],"release":[288],"$$G=(V,E)$$":[291],"<mml:mi>G</mml:mi>":[295],"<mml:mo>=</mml:mo>":[296],"<mml:mo>,</mml:mo>":[299],"graph":[306]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-16T08:24:45.110214","created_date":"2025-10-10T00:00:00"}