{"id":"https://openalex.org/W4388671702","doi":"https://doi.org/10.1007/s00224-023-10150-y","title":"Disentangling the Computational Complexity of Network Untangling","display_name":"Disentangling the Computational Complexity of Network Untangling","publication_year":2023,"publication_date":"2023-11-14","ids":{"openalex":"https://openalex.org/W4388671702","doi":"https://doi.org/10.1007/s00224-023-10150-y"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-023-10150-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-023-10150-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-023-10150-y.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-023-10150-y.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/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Vincent Froese","raw_affiliation_strings":["Algorithmics and Computational Complexity, Technische\u00a0Universit\u00e4t Berlin, Ernst-Reuter-Platz 7, 10587, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Technische\u00a0Universit\u00e4t Berlin, Ernst-Reuter-Platz 7, 10587, Berlin, Germany","institution_ids":["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/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]},{"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":["DE"],"is_corresponding":false,"raw_author_name":"Pascal Kunz","raw_affiliation_strings":["Algorithm Engineering, Humboldt-Universit\u00e4t zu Berlin, Rudower Chaussee 25, 12489, Berlin, Germany","Algorithmics and Computational Complexity, Technische\u00a0Universit\u00e4t Berlin, Ernst-Reuter-Platz 7, 10587, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithm Engineering, Humboldt-Universit\u00e4t zu Berlin, Rudower Chaussee 25, 12489, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Algorithmics and Computational Complexity, Technische\u00a0Universit\u00e4t Berlin, Ernst-Reuter-Platz 7, 10587, Berlin, Germany","institution_ids":["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/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Philipp Zschoche","raw_affiliation_strings":["Algorithmics and Computational Complexity, Technische\u00a0Universit\u00e4t Berlin, Ernst-Reuter-Platz 7, 10587, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Technische\u00a0Universit\u00e4t Berlin, Ernst-Reuter-Platz 7, 10587, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042414939"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.5838,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72398686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"68","issue":"1","first_page":"103","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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.9986000061035156,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9977999925613403,"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.9966999888420105,"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.8703866004943848},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7565882205963135},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6914888024330139},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5814847946166992},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5779143571853638},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5565440654754639},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5489599108695984},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5059565901756287},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4709542691707611},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47064775228500366},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.46690163016319275},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4596618413925171},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4549429714679718},{"id":"https://openalex.org/keywords/timeline","display_name":"Timeline","score":0.45293760299682617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4436100721359253},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4420592188835144},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4166211783885956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32809895277023315},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.20529839396476746},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10403645038604736},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10217681527137756},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07798203825950623}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8703866004943848},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7565882205963135},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6914888024330139},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5814847946166992},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5779143571853638},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5565440654754639},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5489599108695984},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5059565901756287},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4709542691707611},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47064775228500366},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.46690163016319275},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4596618413925171},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4549429714679718},{"id":"https://openalex.org/C4438859","wikidata":"https://www.wikidata.org/wiki/Q186117","display_name":"Timeline","level":2,"score":0.45293760299682617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4436100721359253},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4420592188835144},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4166211783885956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32809895277023315},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.20529839396476746},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10403645038604736},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10217681527137756},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07798203825950623},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":1,"locations":[{"id":"doi:10.1007/s00224-023-10150-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-023-10150-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-023-10150-y.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00224-023-10150-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-023-10150-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-023-10150-y.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2657640209","display_name":null,"funder_award_id":"DFG Research Training Group 2434 \u201dFacets of Complexity\u201d","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320323700","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4388671702.pdf"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W1485150579","https://openalex.org/W1517036688","https://openalex.org/W1570425181","https://openalex.org/W1985572324","https://openalex.org/W2004181701","https://openalex.org/W2063525042","https://openalex.org/W2114616381","https://openalex.org/W2116087731","https://openalex.org/W2125648129","https://openalex.org/W2156896570","https://openalex.org/W2330664568","https://openalex.org/W2775865397","https://openalex.org/W2886237949","https://openalex.org/W2914414140","https://openalex.org/W2922924332","https://openalex.org/W2947863886","https://openalex.org/W2949263370","https://openalex.org/W2962825993","https://openalex.org/W2963993884","https://openalex.org/W2966573219","https://openalex.org/W2968468046","https://openalex.org/W3015837792","https://openalex.org/W3027725861","https://openalex.org/W3037819556","https://openalex.org/W3089940972","https://openalex.org/W3101358844","https://openalex.org/W3135496652","https://openalex.org/W3140257771","https://openalex.org/W3153719637","https://openalex.org/W3162196475","https://openalex.org/W3165963211","https://openalex.org/W3166547661","https://openalex.org/W3170430684","https://openalex.org/W3190071735","https://openalex.org/W4225739242","https://openalex.org/W4313400218","https://openalex.org/W6762757482"],"related_works":["https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W2025716666","https://openalex.org/W2544075308","https://openalex.org/W2079263399","https://openalex.org/W1558145674","https://openalex.org/W1502186998","https://openalex.org/W2043560626","https://openalex.org/W4221167366","https://openalex.org/W2024517697"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"study":[2],"the":[3,64,68,73,93,103,117,125,134,146,158],"network":[4],"untangling":[5],"problem":[6,40,65,82,104,140],"introduced":[7],"by":[8],"Rozenshtein":[9],"et":[10],"al.":[11],"(Data":[12],"Min.":[13],"Knowl.":[14],"Disc.":[15],"35(1),":[16],"213\u2013247,":[17],"2021),":[18],"which":[19],"is":[20,44,79],"a":[21,112],"variant":[22],"of":[23,76,95,102,121,124,129,152,160],"Vertex":[24],"Cover":[25],"on":[26,63],"temporal":[27,126],"graphs\u2013graphs":[28],"whose":[29],"edge":[30],"set":[31],"changes":[32],"over":[33],"discrete":[34],"time":[35,50],"steps.":[36],"They":[37],"introduce":[38],"two":[39],"variants.":[41],"The":[42],"goal":[43],"to":[45],"select":[46],"at":[47],"most":[48],"k":[49],"intervals":[51,130],"for":[52,149],"each":[53],"vertex":[54],"such":[55],"that":[56,91],"all":[57,150],"time-edges":[58],"are":[59,105],"covered":[60],"and":[61,133],"(depending":[62],"variant)":[66],"either":[67],"maximum":[69],"interval":[70,77,135],"length":[71,136],"or":[72],"total":[74],"sum":[75],"lengths":[78],"minimized.":[80],"This":[81],"has":[83],"data":[84],"mining":[85],"applications":[86],"in":[87,97],"finding":[88],"activity":[89],"timelines":[90],"explain":[92],"interactions":[94],"entities":[96],"complex":[98],"networks.":[99],"Both":[100],"variants":[101],"NP-hard.":[106],"In":[107],"this":[108],"paper,":[109],"we":[110,142],"initiate":[111],"multivariate":[113],"complexity":[114,148],"analysis":[115],"involving":[116],"following":[118],"parameters:":[119],"number":[120,128],"vertices,":[122],"lifetime":[123],"graph,":[127],"per":[131],"vertex,":[132],"bound.":[137],"For":[138],"both":[139],"versions,":[141],"(almost)":[143],"completely":[144],"settle":[145],"parameterized":[147],"combinations":[151],"those":[153],"four":[154],"parameters,":[155],"thereby":[156],"delineating":[157],"border":[159],"fixed-parameter":[161],"tractability.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}