{"id":"https://openalex.org/W2901538005","doi":"https://doi.org/10.1109/focs.2019.00057","title":"Parametric Shortest Paths in Planar Graphs","display_name":"Parametric Shortest Paths in Planar Graphs","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W2901538005","doi":"https://doi.org/10.1109/focs.2019.00057","mag":"2901538005"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2019.00057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2019.00057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011331683","display_name":"Kshitij Gajjar","orcid":"https://orcid.org/0000-0003-0890-199X"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Kshitij Gajjar","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080324608","display_name":"Jaikumar Radhakrishnan","orcid":"https://orcid.org/0000-0002-3875-4620"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jaikumar Radhakrishnan","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011331683"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":null,"apc_paid":null,"fwci":0.5829,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68211068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"876","last_page":"895"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9988999962806702,"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/combinatorics","display_name":"Combinatorics","score":0.8702828884124756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6940499544143677},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.6545629501342773},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5643866658210754},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5545644760131836},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5257131457328796},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4798835813999176},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4553968012332916},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.43925681710243225},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4246922731399536},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41557013988494873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36155253648757935},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08578816056251526}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8702828884124756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6940499544143677},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.6545629501342773},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5643866658210754},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5545644760131836},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5257131457328796},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4798835813999176},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4553968012332916},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.43925681710243225},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4246922731399536},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41557013988494873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36155253648757935},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08578816056251526}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs.2019.00057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2019.00057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1482846566","https://openalex.org/W1496614307","https://openalex.org/W1558701214","https://openalex.org/W1632874207","https://openalex.org/W1969625919","https://openalex.org/W1971057413","https://openalex.org/W1980627447","https://openalex.org/W2008597108","https://openalex.org/W2011047736","https://openalex.org/W2048802156","https://openalex.org/W2056618053","https://openalex.org/W2075188242","https://openalex.org/W2102022978","https://openalex.org/W2108928028","https://openalex.org/W2121663287","https://openalex.org/W2122967662","https://openalex.org/W2146189710","https://openalex.org/W2167816765","https://openalex.org/W2563767922","https://openalex.org/W2739149210","https://openalex.org/W2796871158","https://openalex.org/W2797296169","https://openalex.org/W2901538005","https://openalex.org/W2962678445","https://openalex.org/W2963917767","https://openalex.org/W3000021370","https://openalex.org/W4249782589","https://openalex.org/W6633393438","https://openalex.org/W6636671903","https://openalex.org/W6676700516","https://openalex.org/W6678504297","https://openalex.org/W6750215192","https://openalex.org/W6756180453","https://openalex.org/W7071690889"],"related_works":["https://openalex.org/W41478491","https://openalex.org/W35518381","https://openalex.org/W27483122","https://openalex.org/W54441373","https://openalex.org/W27723287","https://openalex.org/W64951736","https://openalex.org/W18873129","https://openalex.org/W63325702","https://openalex.org/W36392590","https://openalex.org/W606113"],"abstract_inverted_index":{"We":[0,118],"construct":[1],"a":[2,22,26,37,88,132],"family":[3],"of":[4,51,90,102,134,142,166,172],"planar":[5,85],"graphs":[6,81],"{G":[7],"<sub":[8,12],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[9,13,62,115,147,179,185],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sub>":[10],"}":[11],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n\u22654</sub>":[14],",":[15,150,181],"where":[16,151],"G_n":[17],"has":[18,59],"n":[19,60,113],"vertices":[20],"including":[21],"source":[23],"vertex":[24,28],"s,":[25],"sink":[27],"t,":[29],"and":[30,74,95],"edge":[31,110,128,161],"weights":[32,111,129,162],"that":[33,67,99],"change":[34],"linearly":[35],"with":[36,108],"parameter":[38],"\u03bb":[39,43],"such":[40],"that,":[41],"as":[42,131],"varies":[44],"in":[45,122],"(-\u221e,+\u221e),":[46],"the":[47,52,100,127,140,154,160,170],"piece-wise":[48],"linear":[49,109,164],"cost":[50],"shortest":[53],"path":[54],"from":[55],"s":[56],"to":[57],"t":[58],"<sup":[61,114,146,178,184],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03a9(logn)</sup>":[63],"pieces.":[64],"This":[65],"shows":[66],"lower":[68],"bounds":[69],"obtained":[70],"by":[71],"Carstensen":[72],"(1983)":[73],"Mulmuley":[75],"&":[76],"Shah":[77],"(2001)":[78],"for":[79,84,104,176],"general":[80],"also":[82],"hold":[83],"graphs,":[86],"refuting":[87],"conjecture":[89],"Nikolova":[91],"(2009).":[92],"Gusfield":[93],"(1980)":[94],"Dean":[96],"(2009)":[97],"showed":[98],"number":[101,141,171],"pieces":[103,143],"every":[105],"n-vertex":[106],"graph":[107],"is":[112,144,153,182],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">logn+O(1)</sup>":[116],".":[117],"generalize":[119],"this":[120],"result":[121],"two":[123],"ways.":[124],"(i)":[125],"If":[126,159],"vary":[130],"polynomial":[133],"degree":[135],"at":[136],"most":[137],"d,":[138],"then":[139,169],"n(logn+(\u03b1(n)+O(1))":[145],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">d</sup>":[148],")":[149],"\u03b1(n)":[152],"inverse":[155],"Ackermann":[156],"function.":[157],"(ii)":[158],"are":[163],"forms":[165],"three":[167],"parameters,":[168],"pieces,":[173],"appropriately":[174],"defined":[175],"R":[177],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>":[180],"n((logn)":[183],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[186],"+O(logn)).":[187]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}