{"id":"https://openalex.org/W4406037937","doi":"https://doi.org/10.1137/24m1632759","title":"Computing Paths of Large Rank in Planar Frameworks Deterministically","display_name":"Computing Paths of Large Rank in Planar Frameworks Deterministically","publication_year":2025,"publication_date":"2025-01-03","ids":{"openalex":"https://openalex.org/W4406037937","doi":"https://doi.org/10.1137/24m1632759"},"language":"en","primary_location":{"id":"doi:10.1137/24m1632759","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1632759","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://curis.ku.dk/ws/files/522830537/Computing_path.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, 5020 Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, 5020 Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, 5020 Norway"],"raw_orcid":"https://orcid.org/0000-0002-2619-2990","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, 5020 Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080387266","display_name":"Tuukka Korhonen","orcid":"https://orcid.org/0000-0003-0861-6515"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Tuukka Korhonen","raw_affiliation_strings":["BARC, University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BARC, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070659804","display_name":"Giannos Stamoulis","orcid":"https://orcid.org/0000-0002-4175-7793"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Giannos Stamoulis","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0002-4175-7793","affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00642447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":"1","first_page":"92","last_page":"118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7552721500396729},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6320887804031372},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6247470378875732},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5560643672943115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4602438807487488},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21174171566963196}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7552721500396729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6320887804031372},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6247470378875732},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5560643672943115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4602438807487488},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21174171566963196},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/24m1632759","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1632759","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/cf083173-ab5a-459f-82ee-2e784213de69","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/cf083173-ab5a-459f-82ee-2e784213de69","pdf_url":"https://curis.ku.dk/ws/files/522830537/Computing_path.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fomin , F V , Golovach , P A , Korhonen , T & Stamoulis , G 2025 , ' Computing Paths of Large Rank in Planar Frameworks Deterministically ' , SIAM Journal on Discrete Mathematics , vol. 39 , no. 1 , pp. 92-118 . https://doi.org/10.1137/24M1632759","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/cf083173-ab5a-459f-82ee-2e784213de69","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/cf083173-ab5a-459f-82ee-2e784213de69","pdf_url":"https://curis.ku.dk/ws/files/522830537/Computing_path.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fomin , F V , Golovach , P A , Korhonen , T & Stamoulis , G 2025 , ' Computing Paths of Large Rank in Planar Frameworks Deterministically ' , SIAM Journal on Discrete Mathematics , vol. 39 , no. 1 , pp. 92-118 . https://doi.org/10.1137/24M1632759","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1302621641","display_name":null,"funder_award_id":"ANR-20-CE92-0027","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G1535968106","display_name":null,"funder_award_id":"ANR-17-CE23-0010","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5399623649","display_name":null,"funder_award_id":"314528","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G6803667113","display_name":null,"funder_award_id":"ANR-17","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4406037937.pdf","grobid_xml":"https://content.openalex.org/works/W4406037937.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1495415187","https://openalex.org/W1680189815","https://openalex.org/W1972514464","https://openalex.org/W2005079828","https://openalex.org/W2085348754","https://openalex.org/W2120141762","https://openalex.org/W2132651631","https://openalex.org/W2216833188","https://openalex.org/W2296148711","https://openalex.org/W2377915845","https://openalex.org/W2591818589","https://openalex.org/W2596605817","https://openalex.org/W2914414140","https://openalex.org/W2945296468","https://openalex.org/W2964186470","https://openalex.org/W3016023902","https://openalex.org/W3116253690","https://openalex.org/W3134554124","https://openalex.org/W3139078859","https://openalex.org/W4213368513","https://openalex.org/W4231868828","https://openalex.org/W4390575700"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"A":[0],"framework":[1],"consists":[2],"of":[3,18,25,45,65,77,104,106,108,131,164,173,185,248],"an":[4,80,94],"undirected":[5],"graph":[6,156],"G":[7,97,157],"and":[8,38,41,75,79,123,127],"a":[9,102,132],"matroid":[10,199],"M":[11,107,200],"whose":[12,98,154],"elements":[13,105],"correspond":[14],"to":[15],"the":[16,26,46,116,129,143,150,161,170,174,191,196,213,228,242],"vertices":[17,73],"G.":[19],"Recently,":[20],"Fomin":[21],"et":[22],"al.":[23],"[Proceedings":[24,44],"2023":[27],"ACM-SIAM":[28,49],"Symposium":[29,50],"on":[30,51,115,181],"Discrete":[31,52],"Algorithms":[32,53],"(SODA),":[33,54],"SIAM,":[34,55],"2023,":[35],"pp.":[36,57],"2214-2227]":[37],"Eiben,":[39],"Koana,":[40],"Wahlstr\"":[42],"om":[43],"2024":[47],"Annual":[48],"2024,":[56],"377-423]":[58],"developed":[59],"parameterized":[60,87],"algorithms":[61,86,112],"for":[62,72,119,136,195],"computing":[63],"paths":[64],"rank":[66,109],"k":[67,89],"in":[68,96,152],"frameworks.":[69],"More":[70],"precisely,":[71],"s":[74],"t":[76],"G,":[78],"integer":[81],"k,":[82],"they":[83],"gave":[84],"FPT":[85,134,146,193],"by":[88,209,218],"deciding":[90],"whether":[91],"there":[92,223],"is":[93,158,167,190,201,224],"(s,t)-path":[95],"vertex":[99],"set":[100],"contains":[101],"subset":[103],"k.":[110],"These":[111],"are":[113,125,216,245],"based":[114],"Schwartz-Zippel":[117],"lemma":[118],"polynomial":[120],"identity":[121],"testing":[122],"thus":[124],"randomized,":[126],"therefore":[128],"existence":[130],"deterministic":[133,145],"algorithm":[135,147,166,179,194,226],"this":[137,189,207,235],"problem":[138,151,229],"remains":[139],"open.":[140],"We":[141,205],"present":[142],"first":[144,192],"that":[148,211],"solves":[149],"frameworks":[153],"underlying":[155],"planar.":[159],"While":[160],"running":[162,171],"time":[163],"our":[165,178],"worse":[168],"than":[169],"times":[172],"recent":[175],"randomized":[176],"algorithms,":[177],"works":[180],"more":[182],"general":[183],"classes":[184],"matroids.":[186],"In":[187],"particular,":[188],"case":[197],"when":[198],"represented":[202],"over":[203],"rationals.":[204],"complement":[206],"result":[208],"proving":[210],"if":[212,241],"input":[214,243],"matroids":[215],"given":[217],"their":[219],"independence":[220],"oracles,":[221],"then":[222],"no":[225],"solving":[227],"with":[230],"f(k)\\cdotn<sup>o</sup>(k<sup>)</sup>":[231],"oracle":[232],"queries.":[233],"Furthermore,":[234],"computational":[236],"lower":[237],"bound":[238],"holds":[239],"even":[240],"graphs":[244,247],"planar":[246],"treewidth":[249],"at":[250],"most":[251],"two.":[252]},"counts_by_year":[],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}