{"id":"https://openalex.org/W4414903064","doi":"https://doi.org/10.4230/lipics.icalp.2026.38","title":"Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees","display_name":"Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees","publication_year":2025,"publication_date":"2025-03-19","ids":{"openalex":"https://openalex.org/W4414903064","doi":"https://doi.org/10.4230/lipics.icalp.2026.38"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2503.15226","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2503.15226","pdf_url":"https://arxiv.org/pdf/2503.15226","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2503.15226","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119880371","display_name":"Narek Bojikian","orcid":null},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bojikian, Narek","raw_affiliation_strings":["Humboldt Universit\u00e4t zu Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1072-4873","affiliations":[{"raw_affiliation_string":"Humboldt Universit\u00e4t zu Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114987648","display_name":"Alexander Firbas","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Firbas, Alexander","raw_affiliation_strings":["TU Wien, Austria"],"raw_orcid":"https://orcid.org/0009-0007-2049-2144","affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ganian, Robert","raw_affiliation_strings":["TU Wien, Austria"],"raw_orcid":"https://orcid.org/0000-0002-7762-8045","affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086971499","display_name":"Hung P. Hoang","orcid":"https://orcid.org/0000-0001-7883-4134"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Hoang, Hung P.","raw_affiliation_strings":["TU Wien, Austria"],"raw_orcid":"https://orcid.org/0000-0001-7883-4134","affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5119880372","display_name":"Krisztina Szil\u00e1gyi","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Szil\u00e1gyi, Krisztina","raw_affiliation_strings":["Czech Technical University, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-3570-0528","affiliations":[{"raw_affiliation_string":"Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9936000108718872,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9936000108718872,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9833999872207642,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6948000192642212},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5676000118255615},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5091999769210815},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48350000381469727},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4625000059604645},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4323999881744385},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.3824000060558319},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.37950000166893005}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6948000192642212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.675599992275238},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5760999917984009},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5676000118255615},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5091999769210815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4925000071525574},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48350000381469727},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4625000059604645},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4323999881744385},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.37950000166893005},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3666999936103821},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.33489999175071716},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.33250001072883606},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2971000075340271},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2624000012874603},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2565999925136566}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2503.15226","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2503.15226","pdf_url":"https://arxiv.org/pdf/2503.15226","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26427","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.38","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.38/LIPIcs.ICALP.2026.38.pdf","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":null,"raw_type":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.icalp.2026.38","is_oa":true,"landing_page_url":"http://dl.acm.org/citation.cfm?id=139404.139469","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2503.15226","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2503.15226","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"Preprint"},{"id":"doi:10.4230/lipics.icalp.2026.38","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.38","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2503.15226","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2503.15226","pdf_url":"https://arxiv.org/pdf/2503.15226","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G440135439","display_name":null,"funder_award_id":"10.47379/ICT 22029","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G7247946260","display_name":null,"funder_award_id":"10.47379/","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G7784929708","display_name":"Structural Analysis in Combinatorial Reconfiguration (SCoRe)","funder_award_id":"ESP 1136425","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8343373260","display_name":"Parameterized Analysis in Artificial Intelligence","funder_award_id":"Y 1329","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8590477180","display_name":null,"funder_award_id":"10.55776","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414903064.pdf","grobid_xml":"https://content.openalex.org/works/W4414903064.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,72,93,102,108,127,136,178,189,197,212],"computation":[3],"of":[4,48,65,81,92,96,107,160,202,214,240,245],"minimum-cost":[5],"spanning":[6,27],"trees":[7],"satisfying":[8],"prescribed":[9],"vertex":[10,34,61],"degree":[11,39],"constraints:":[12],"Given":[13],"a":[14,18,25,38,63,75,79,139,157,238],"graph":[15,105,110],"$G$":[16],"and":[17,84,118,129,138,200,217,233,251],"constraint":[19,49],"function":[20],"$D$,":[21],"we":[22,44,87,114,155,169,236],"ask":[23],"for":[24,32,121,153,177,194,255],"(minimum-cost)":[26],"tree":[28],"$T$":[29,36],"such":[30],"that":[31],"each":[33,60],"$v$,":[35],"achieves":[37],"specified":[40],"by":[41,52,126,135,144,185],"$D(v)$.":[42],"Specifically,":[43],"consider":[45],"three":[46],"kinds":[47],"functions":[50],"ordered":[51],"their":[53],"generality":[54],"--":[55],"$D$":[56],"may":[57,243],"either":[58],"assign":[59],"to":[62,148,221,229],"list":[64],"admissible":[66],"degrees,":[67,73],"an":[68,89,131,172],"upper":[69,117,151,234],"bound":[70,152],"on":[71],"or":[74],"specific":[76],"degree.":[77],"Using":[78,166],"combination":[80],"novel":[82,158],"techniques":[83],"state-of-the-art":[85],"machinery,":[86],"obtain":[88,149,171],"almost-complete":[90],"overview":[91],"fine-grained":[94],"complexity":[95],"these":[97,122],"problems":[98,123,223],"taking":[99],"into":[100],"account":[101],"most":[103],"classical":[104,198],"parameters":[106],"input":[109],"$G$.":[111],"In":[112,146],"particular,":[113],"present":[115],"SETH-tight":[116,141],"lower":[119,232],"bounds":[120,235],"when":[124],"parameterized":[125,134,143,184],"pathwidth":[128],"cutwidth,":[130],"ETH-tight":[132,173],"algorithm":[133,142,176],"cliquewidth,":[137],"nearly":[140],"treewidth.":[145],"order":[147,228],"our":[150,215,231],"clique-width,":[154,186],"develop":[156],"technique":[159,216],"double":[161],"representation":[162],"through":[163],"``requirement":[164],"shifting''.":[165],"this":[167],"technique,":[168],"also":[170],"single-exponential":[174],"XP":[175],"Exact":[179],"Leaf":[180],"Spanning":[181],"Tree":[182],"problem":[183],"which":[187,242],"settles":[188],"final":[190],"remaining":[191],"open":[192],"case":[193],"clique-width":[195],"from":[196],"Cut":[199],"Count":[201],"Cygan":[203],"et":[204],"al.":[205],"[FOCS":[206],"2011,":[207],"TALG":[208],"2022].":[209],"This":[210],"shows":[211],"versatility":[213],"its":[218],"potential":[219],"applicability":[220],"other":[222],"as":[224],"well.":[225],"Additionally,":[226],"in":[227],"establish":[230],"introduce":[237],"number":[239],"tools":[241],"be":[244],"independent":[246],"interest,":[247],"including":[248],"lazy":[249],"coloring":[250],"``asymptotic''":[252],"SETH-based":[253],"reductions":[254],"structural":[256],"parameters.":[257]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-07T00:00:00"}