{"id":"https://openalex.org/W4225739242","doi":"https://doi.org/10.24963/ijcai.2022/283","title":"Disentangling the Computational Complexity of Network Untangling","display_name":"Disentangling the Computational Complexity of Network Untangling","publication_year":2022,"publication_date":"2022-07-01","ids":{"openalex":"https://openalex.org/W4225739242","doi":"https://doi.org/10.24963/ijcai.2022/283"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2022/283","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2022/283","pdf_url":"https://www.ijcai.org/proceedings/2022/0283.pdf","source":{"id":"https://openalex.org/S4363608755","display_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.ijcai.org/proceedings/2022/0283.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042414939","display_name":"Vincent Froese","orcid":null},"institutions":[{"id":"https://openalex.org/I4210128818","display_name":"Institute of Software","ror":"https://ror.org/033dfsn42","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210128818"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["CN","DE"],"is_corresponding":true,"raw_author_name":"Vincent Froese","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Faculty IV, Institute of Software Engineering and Theoretical Computer Science, Algorithmics and Computational Complexity"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Faculty IV, Institute of Software Engineering and Theoretical Computer Science, Algorithmics and Computational Complexity","institution_ids":["https://openalex.org/I4210128818","https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057016052","display_name":"Pascal Kunz","orcid":"https://orcid.org/0000-0002-0787-8428"},"institutions":[{"id":"https://openalex.org/I4210128818","display_name":"Institute of Software","ror":"https://ror.org/033dfsn42","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210128818"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["CN","DE"],"is_corresponding":false,"raw_author_name":"Pascal Kunz","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Faculty IV, Institute of Software Engineering and Theoretical Computer Science, Algorithmics and Computational Complexity"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Faculty IV, Institute of Software Engineering and Theoretical Computer Science, Algorithmics and Computational Complexity","institution_ids":["https://openalex.org/I4210128818","https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038465467","display_name":"Philipp Zschoche","orcid":"https://orcid.org/0000-0001-9846-0600"},"institutions":[{"id":"https://openalex.org/I4210128818","display_name":"Institute of Software","ror":"https://ror.org/033dfsn42","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210128818"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["CN","DE"],"is_corresponding":false,"raw_author_name":"Philipp Zschoche","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Faculty IV, Institute of Software Engineering and Theoretical Computer Science, Algorithmics and Computational Complexity"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Faculty IV, Institute of Software Engineering and Theoretical Computer Science, Algorithmics and Computational Complexity","institution_ids":["https://openalex.org/I4210128818","https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042414939"],"corresponding_institution_ids":["https://openalex.org/I4210128818","https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":1.4497,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78142589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2037","last_page":"2043"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9973000288009644,"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/T11106","display_name":"Data Management and Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8667713403701782},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7906583547592163},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6724400520324707},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5923094749450684},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5661049485206604},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5632684230804443},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.5467553734779358},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5452022552490234},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5313297510147095},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5191720724105835},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5070233345031738},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49170857667922974},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4466533362865448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4074186086654663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3281441330909729},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.24748587608337402},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07742393016815186}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8667713403701782},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7906583547592163},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6724400520324707},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5923094749450684},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5661049485206604},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5632684230804443},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.5467553734779358},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5452022552490234},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5313297510147095},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5191720724105835},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5070233345031738},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49170857667922974},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4466533362865448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4074186086654663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3281441330909729},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.24748587608337402},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07742393016815186},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2022/283","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2022/283","pdf_url":"https://www.ijcai.org/proceedings/2022/0283.pdf","source":{"id":"https://openalex.org/S4363608755","display_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2022/283","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2022/283","pdf_url":"https://www.ijcai.org/proceedings/2022/0283.pdf","source":{"id":"https://openalex.org/S4363608755","display_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320324094","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4225739242.pdf","grobid_xml":"https://content.openalex.org/works/W4225739242.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1485150579","https://openalex.org/W2004181701","https://openalex.org/W2063525042","https://openalex.org/W2114616381","https://openalex.org/W2116087731","https://openalex.org/W2330664568","https://openalex.org/W2775865397","https://openalex.org/W2922924332","https://openalex.org/W2949263370","https://openalex.org/W2962825993","https://openalex.org/W2963993884","https://openalex.org/W2968468046","https://openalex.org/W2996918322","https://openalex.org/W3089940972","https://openalex.org/W3140257771","https://openalex.org/W3153719637","https://openalex.org/W3162196475","https://openalex.org/W3166547661","https://openalex.org/W3184510782","https://openalex.org/W3190071735","https://openalex.org/W4368363101"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2025716666","https://openalex.org/W2079263399","https://openalex.org/W1558145674","https://openalex.org/W2544075308","https://openalex.org/W1502186998","https://openalex.org/W3215145351","https://openalex.org/W4286853492","https://openalex.org/W3199337566"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,53,57,62,82,92,106,114,123,135,147],"recently":[3],"introduced":[4],"network":[5],"untangling":[6],"problem,":[7],"a":[8,101],"variant":[9],"of":[10,28,65,84,91,110,113,118,141,149],"Vertex":[11],"Cover":[12],"on":[13,52],"temporal":[14,115],"graphs---graphs":[15],"whose":[16],"edge":[17],"set":[18],"changes":[19],"over":[20],"discrete":[21],"time":[22,39],"steps.":[23],"There":[24],"are":[25,48,94],"two":[26],"versions":[27],"this":[29,97],"problem.":[30],"The":[31],"goal":[32],"is":[33,68],"to":[34],"select":[35],"at":[36],"most":[37],"k":[38],"intervals":[40,119],"for":[41,138],"each":[42],"vertex":[43],"such":[44],"that":[45,80],"all":[46,139],"time-edges":[47],"covered":[49],"and":[50,122],"(depending":[51],"problem":[54,71,93,129],"variant)":[55],"either":[56],"maximum":[58],"interval":[59,66,124],"length":[60,125],"or":[61],"total":[63],"sum":[64],"lengths":[67],"minimized.":[69],"This":[70],"has":[72],"data":[73],"mining":[74],"applications":[75],"in":[76,86],"finding":[77],"activity":[78],"timelines":[79],"explain":[81],"interactions":[83],"entities":[85],"complex":[87],"networks.":[88],"Both":[89],"variants":[90],"NP-hard.":[95],"In":[96],"paper,":[98],"we":[99,131],"initiate":[100],"multivariate":[102],"complexity":[103,137],"analysis":[104],"involving":[105],"following":[107],"parameters:":[108],"number":[109,117],"vertices,":[111],"lifetime":[112],"graph,":[116],"per":[120],"vertex,":[121],"bound.":[126],"For":[127],"both":[128],"versions,":[130],"(almost)":[132],"completely":[133],"settle":[134],"parameterized":[136],"combinations":[140],"those":[142],"four":[143],"parameters,":[144],"thereby":[145],"delineating":[146],"border":[148],"fixed-parameter":[150],"tractability.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}