{"id":"https://openalex.org/W2768940598","doi":"https://doi.org/10.1007/978-3-319-71147-8_20","title":"Tropical Paths in Vertex-Colored Graphs","display_name":"Tropical Paths in Vertex-Colored Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2768940598","doi":"https://doi.org/10.1007/978-3-319-71147-8_20","mag":"2768940598"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-71147-8_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-71147-8_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5050604088","display_name":"Johanne Cohen","orcid":"https://orcid.org/0000-0002-9548-5260"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Johanne Cohen","raw_affiliation_strings":["LRI, University Paris-Saclay, Orsay, France","Graphes, Algorithmes et Combinatoire (LRI)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, University Paris-Saclay, Orsay, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210144804"]},{"raw_affiliation_string":"Graphes, Algorithmes et Combinatoire (LRI)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086186456","display_name":"Giuseppe F. Italiano","orcid":"https://orcid.org/0000-0002-9492-9894"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe F. Italiano","raw_affiliation_strings":["Department of Civil Engineering and Computer Science Engineering, University of Rome \u201cTor Vergata\u201d, Rome, Italy","Department of Civil Engineering [Rome]","Equipe de recherche europ\u00e9enne en algorithmique et biologie formelle et exp\u00e9rimentale"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering and Computer Science Engineering, University of Rome \u201cTor Vergata\u201d, Rome, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Department of Civil Engineering [Rome]","institution_ids":[]},{"raw_affiliation_string":"Equipe de recherche europ\u00e9enne en algorithmique et biologie formelle et exp\u00e9rimentale","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111739071","display_name":"Yannis Manoussakis","orcid":null},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yannis Manoussakis","raw_affiliation_strings":["LRI, University Paris-Saclay, Orsay, France","Graphes, Algorithmes et Combinatoire (LRI)","Laboratoire de Recherche en Informatique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, University Paris-Saclay, Orsay, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210144804"]},{"raw_affiliation_string":"Graphes, Algorithmes et Combinatoire (LRI)","institution_ids":[]},{"raw_affiliation_string":"Laboratoire de Recherche en Informatique","institution_ids":["https://openalex.org/I4210144804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109582467","display_name":"Kim Thang Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Kim Thang Nguyen","raw_affiliation_strings":["IBISC, University Paris-Saclay, Evry, France","Informatique, Biologie Int\u00e9grative et Syst\u00e8mes Complexes"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBISC, University Paris-Saclay, Evry, France","institution_ids":["https://openalex.org/I4210107733"]},{"raw_affiliation_string":"Informatique, Biologie Int\u00e9grative et Syst\u00e8mes Complexes","institution_ids":["https://openalex.org/I4210107733"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039564180","display_name":"Hong Phong Pham","orcid":"https://orcid.org/0000-0002-2238-8865"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hong Phong Pham","raw_affiliation_strings":["LRI, University Paris-Saclay, Orsay, France","Graphes, Algorithmes et Combinatoire (LRI)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, University Paris-Saclay, Orsay, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210144804"]},{"raw_affiliation_string":"Graphes, Algorithmes et Combinatoire (LRI)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.1234,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87443009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"291","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9905999898910522,"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.9905999898910522,"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.7008520364761353},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.699723482131958},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6195023059844971},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5974186658859253},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5731365084648132},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5363558530807495},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5308317542076111},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.52341628074646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4811755120754242},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.46472838521003723},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4646645784378052},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43051791191101074},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4179357886314392},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.36197328567504883},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3221881091594696},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31731081008911133},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23469170928001404}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7008520364761353},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.699723482131958},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6195023059844971},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5974186658859253},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5731365084648132},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5363558530807495},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5308317542076111},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.52341628074646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4811755120754242},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.46472838521003723},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4646645784378052},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43051791191101074},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4179357886314392},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.36197328567504883},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3221881091594696},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31731081008911133},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23469170928001404}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-71147-8_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-71147-8_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01635425v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01635425","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"COCOA 2017 - 11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.291-305, ⟨10.1007/978-3-319-71147-8_20⟩","raw_type":"Conference papers"},{"id":"pmh:oai:art.torvergata.it:2108/201118","is_oa":false,"landing_page_url":"http://hdl.handle.net/2108/201118","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W57095562","https://openalex.org/W1561452800","https://openalex.org/W1580484824","https://openalex.org/W1708444016","https://openalex.org/W1779055272","https://openalex.org/W1976157781","https://openalex.org/W1986378997","https://openalex.org/W2003813631","https://openalex.org/W2018472652","https://openalex.org/W2028292094","https://openalex.org/W2057303484","https://openalex.org/W2077143033","https://openalex.org/W2113213844","https://openalex.org/W2134524089","https://openalex.org/W2156300919","https://openalex.org/W2490114670","https://openalex.org/W2765692335","https://openalex.org/W2768940598","https://openalex.org/W2951204651"],"related_works":["https://openalex.org/W4283803822","https://openalex.org/W2016277208","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W2407258439","https://openalex.org/W2028363955","https://openalex.org/W1681620790","https://openalex.org/W110470963","https://openalex.org/W2530575142","https://openalex.org/W2084631735"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}