{"id":"https://openalex.org/W3005658287","doi":"https://doi.org/10.1007/s00453-022-01077-w","title":"Multistage s\u2013t Path: Confronting Similarity with Dissimilarity","display_name":"Multistage s\u2013t Path: Confronting Similarity with Dissimilarity","publication_year":2023,"publication_date":"2023-01-03","ids":{"openalex":"https://openalex.org/W3005658287","doi":"https://doi.org/10.1007/s00453-022-01077-w","mag":"3005658287"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-01077-w","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-022-01077-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01077-w.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"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01077-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080689259","display_name":"Till Fluschnik","orcid":"https://orcid.org/0000-0003-2203-4386"},"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":"Till Fluschnik","raw_affiliation_strings":["Faculty\u00a0IV, Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty\u00a0IV, Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","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":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Faculty\u00a0IV, Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty\u00a0IV, Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063537468","display_name":"Carsten Schubert","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":false,"raw_author_name":"Carsten Schubert","raw_affiliation_strings":["Faculty\u00a0IV, Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty\u00a0IV, Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, 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":true,"raw_author_name":"Philipp Zschoche","raw_affiliation_strings":["Faculty\u00a0IV, Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty\u00a0IV, Algorithmics and Computational Complexity, Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038465467"],"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.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.00224017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"85","issue":"7","first_page":"2028","last_page":"2064"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9987999796867371,"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.9861999750137329,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8189747333526611},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6708153486251831},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6125380396842957},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5228077173233032},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5091983675956726},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.4624168574810028},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4371710419654846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.434080570936203},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38633763790130615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3661542534828186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36311060190200806},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22384992241859436}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8189747333526611},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6708153486251831},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6125380396842957},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5228077173233032},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5091983675956726},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.4624168574810028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4371710419654846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.434080570936203},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38633763790130615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3661542534828186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36311060190200806},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22384992241859436},{"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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-022-01077-w","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-022-01077-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01077-w.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"}],"best_oa_location":{"id":"doi:10.1007/s00453-022-01077-w","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-022-01077-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01077-w.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/G7575660904","display_name":null,"funder_award_id":"NI 369/18","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"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3005658287.pdf"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W1586904125","https://openalex.org/W1594302759","https://openalex.org/W1639167359","https://openalex.org/W1881841366","https://openalex.org/W1972514464","https://openalex.org/W1986602165","https://openalex.org/W1998964055","https://openalex.org/W2011039300","https://openalex.org/W2016973429","https://openalex.org/W2032055092","https://openalex.org/W2039100365","https://openalex.org/W2050719228","https://openalex.org/W2073840571","https://openalex.org/W2086991377","https://openalex.org/W2107284348","https://openalex.org/W2133773025","https://openalex.org/W2166566648","https://openalex.org/W2255673366","https://openalex.org/W2498592833","https://openalex.org/W2607316446","https://openalex.org/W2612220663","https://openalex.org/W2889043416","https://openalex.org/W2904651975","https://openalex.org/W2911520398","https://openalex.org/W2947863886","https://openalex.org/W2950969150","https://openalex.org/W2953737785","https://openalex.org/W2964196611","https://openalex.org/W2965922572","https://openalex.org/W2968468046","https://openalex.org/W2970341242","https://openalex.org/W2973017021","https://openalex.org/W2991501493","https://openalex.org/W2996596490","https://openalex.org/W2996918322","https://openalex.org/W3080255537","https://openalex.org/W3091847779","https://openalex.org/W3132439135","https://openalex.org/W3139078859","https://openalex.org/W3153719637","https://openalex.org/W3164377310","https://openalex.org/W3166547661","https://openalex.org/W3183892126","https://openalex.org/W3190186573","https://openalex.org/W3196886187","https://openalex.org/W3199947862","https://openalex.org/W3213120235","https://openalex.org/W4225672663","https://openalex.org/W4285605542","https://openalex.org/W6780631547","https://openalex.org/W7025008038"],"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/W1976468483","https://openalex.org/W2480116122","https://openalex.org/W2563912921","https://openalex.org/W2110193191","https://openalex.org/W2132921321"],"abstract_inverted_index":{"Abstract":[0],"Addressing":[1],"a":[2,32,38,61,180,213],"quest":[3],"by":[4,106,164,223],"Gupta":[5],"et":[6],"al.":[7],"(in:":[8],"Proceedings":[9],"of":[10,24,36,63,109,113,124,135,154,170,231,262],"the":[11,45,52,66,74,91,95,107,110,115,120,206,220,232,253,263],"41st":[12],"international":[13],"colloquium":[14],"on":[15],"automata,":[16],"languages,":[17],"and":[18,158,167,191,275],"programming":[19],"(ICALP":[20],"2014),":[21,29],"vol":[22],"8572":[23],"LNCS.":[25],"Springer,":[26],"pp":[27],"563\u2013575,":[28],"we":[30,178,193,217,244],"provide":[31,269],"first,":[33],"comprehensive":[34],"study":[35],"finding":[37],"short":[39,79],"s":[40,54,80,97,137],"\u2013":[41,55,81,98,138],"t":[42,56,82,99,139],"path":[43,93,208],"in":[44,84,90,174],"multistage":[46,221],"graph":[47,86],"model,":[48],"referred":[49],"to":[50,77],"as":[51],"Multistage":[53,136],"Path":[57,140],"problem.":[58],"Herein,":[59],"given":[60],"sequence":[62,94,153],"graphs":[64],"over":[65],"same":[67],"vertex":[68,116,160],"set":[69,117,122],"but":[70],"changing":[71],"edge":[72,121],"sets,":[73],"task":[75],"is":[76],"find":[78],"paths":[83,100],"each":[85],"(\u201csnapshot\u201d)":[87],"such":[88],"that":[89,131,246],"found":[92],"consecutive":[96,127,227],"are":[101,141],"\u201csimilar\u201d.":[102],"We":[103,129,267],"measure":[104],"similarity":[105,265],"size":[108],"symmetric":[111],"difference":[112],"either":[114],"(vertex-similarity)":[118],"or":[119],"(edge-similarity)":[123],"any":[125],"two":[126,133,156],"paths.":[128,228],"prove":[130,194,245],"these":[132],"variants":[134],"already":[142],"$${\\text":[143,198],"{NP}}$$":[144],"<mml:math":[145,200],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[146,201],"<mml:mtext>NP</mml:mtext>":[147],"</mml:math>":[148,203],"-hard":[149],"for":[150,187,225,249,252],"an":[151],"input":[152],"only":[155],"snapshots":[157],"maximum":[159],"degree":[161],"four.":[162],"Motivated":[163],"this":[165,171],"fact":[166],"natural":[168],"applications":[169],"scenario":[172],"e.g.":[173],"traffic":[175],"route":[176],"planning,":[177],"perform":[179],"parameterized":[181,195],"complexity":[182],"analysis.":[183],"Among":[184],"other":[185],"results,":[186],"both":[188],"variants,":[189],"vertex-":[190],"edge-similarity,":[192],"hardness":[196],"(":[197],"{W[1]}}$$":[199],"<mml:mtext>W[1]</mml:mtext>":[202],"-hardness)":[204],"regarding":[205],"parameter":[207,254],"length":[209],"(solution":[210],"size).":[211],"As":[212,229],"further":[214],"conceptual":[215],"investigation,":[216],"then":[218],"modify":[219],"model":[222],"asking":[224],"dissimilar":[226],"one":[230],"main":[233],"technical":[234],"results":[235,272],"(employing":[236],"so-called":[237],"representative":[238],"sets":[239],"known":[240],"from":[241],"non-temporal":[242],"settings),":[243],"dissimilarity":[247],"allows":[248],"fixed-parameter":[250],"tractability":[251],"solution":[255],"size,":[256],"contrasting":[257],"with":[258],"our":[259],"W[1]-hardness":[260],"proof":[261],"corresponding":[264],"case.":[266],"also":[268],"partially":[270],"positive":[271],"concerning":[273],"efficient":[274],"effective":[276],"data":[277],"reduction":[278],"(kernelization).":[279]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-02-03T23:48:18.283914","created_date":"2025-10-10T00:00:00"}