{"id":"https://openalex.org/W2936352478","doi":"https://doi.org/10.1007/s00453-019-00574-9","title":"An Algorithm to Compute the Nucleolus of Shortest Path Games","display_name":"An Algorithm to Compute the Nucleolus of Shortest Path Games","publication_year":2019,"publication_date":"2019-04-13","ids":{"openalex":"https://openalex.org/W2936352478","doi":"https://doi.org/10.1007/s00453-019-00574-9","mag":"2936352478"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00574-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-019-00574-9","pdf_url":null,"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":null,"license_id":null,"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":"green","oa_url":"https://hal.science/hal-02348972","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020748279","display_name":"Mourad Ba\u0131\u0308ou","orcid":"https://orcid.org/0000-0003-0735-7689"},"institutions":[{"id":"https://openalex.org/I4210143836","display_name":"Clermont Universit\u00e9","ror":"https://ror.org/03yf5zr20","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210143836"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mourad Ba\u00efou","raw_affiliation_strings":["CNRS and Universit\u00e9 Clermont Auvergne, Campus des C\u00e9zeaux, 1 Rue de la Chebarde, 63178, Aubi\u00e8re Cedex, France","Laboratoire d'Informatique, de Mod\u00e9lisation et d'optimisation des Syst\u00e8mes"],"affiliations":[{"raw_affiliation_string":"CNRS and Universit\u00e9 Clermont Auvergne, Campus des C\u00e9zeaux, 1 Rue de la Chebarde, 63178, Aubi\u00e8re Cedex, France","institution_ids":["https://openalex.org/I4210143836","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'optimisation des Syst\u00e8mes","institution_ids":["https://openalex.org/I4210099416"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076877502","display_name":"Francisco Barahona","orcid":"https://orcid.org/0000-0002-4829-7515"},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francisco Barahona","raw_affiliation_strings":["IBM T. J. Watson research Center, Yorktown Heights, NY, 10589, USA","IBM Thomas J. Watson Research Center"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson research Center, Yorktown Heights, NY, 10589, USA","institution_ids":[]},{"raw_affiliation_string":"IBM Thomas J. Watson Research Center","institution_ids":["https://openalex.org/I4210114115"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020748279"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210099416","https://openalex.org/I4210143836"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5475,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.80299911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"81","issue":"8","first_page":"3099","last_page":"3113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6452895402908325},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6359716653823853},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5877661108970642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5621448159217834},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5615658760070801},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5512109398841858},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4781852066516876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45974665880203247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38957536220550537},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35214000940322876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32777589559555054},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12850934267044067},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10792595148086548}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6452895402908325},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6359716653823853},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5877661108970642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5621448159217834},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5615658760070801},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5512109398841858},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4781852066516876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45974665880203247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38957536220550537},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35214000940322876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32777589559555054},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12850934267044067},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10792595148086548},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-019-00574-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-019-00574-9","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02348972v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02348972","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2019, 81 (8), pp.3099-3113. ⟨10.1007/s00453-019-00574-9⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02348972v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02348972","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2019, 81 (8), pp.3099-3113. ⟨10.1007/s00453-019-00574-9⟩","raw_type":"Journal articles"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W49331330","https://openalex.org/W1609615991","https://openalex.org/W1900044096","https://openalex.org/W1977545325","https://openalex.org/W2029140075","https://openalex.org/W2042923780","https://openalex.org/W2048790997","https://openalex.org/W2064699170","https://openalex.org/W2066311617","https://openalex.org/W2074062423","https://openalex.org/W2094691341","https://openalex.org/W2103985627","https://openalex.org/W2115064460","https://openalex.org/W2125363721","https://openalex.org/W2146709340","https://openalex.org/W2162828214","https://openalex.org/W2416389285","https://openalex.org/W2509923016","https://openalex.org/W2747628745","https://openalex.org/W3137934641","https://openalex.org/W4230127733","https://openalex.org/W4285719527","https://openalex.org/W6700181353"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}