{"id":"https://openalex.org/W2283371316","doi":"https://doi.org/10.1007/978-3-662-53536-3_8","title":"The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs","display_name":"The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2283371316","doi":"https://doi.org/10.1007/978-3-662-53536-3_8","mag":"2283371316"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-53536-3_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-53536-3_8","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/A5064579274","display_name":"Fr\u00e9d\u00e9ric Maffray","orcid":"https://orcid.org/0000-0002-8265-0415"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Maffray","raw_affiliation_strings":["CNRS, Laboratoire G-SCOP, Univ. of Grenoble-Alpes, Grenoble, France"],"affiliations":[{"raw_affiliation_string":"CNRS, Laboratoire G-SCOP, Univ. of Grenoble-Alpes, Grenoble, France","institution_ids":["https://openalex.org/I4210094718","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014495214","display_name":"Lucas Pastor","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Lucas Pastor","raw_affiliation_strings":["Laboratoire G-SCOP, Univ. of Grenoble-Alpes, Grenoble, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire G-SCOP, Univ. of Grenoble-Alpes, Grenoble, France","institution_ids":["https://openalex.org/I4210094718"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014495214"],"corresponding_institution_ids":["https://openalex.org/I4210094718"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.5041,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.9221519,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"96"},"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.9973999857902527,"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/combinatorics","display_name":"Combinatorics","score":0.6997665762901306},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5908580422401428},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5877589583396912},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.587552547454834},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5704864859580994},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5098044276237488},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48621025681495667},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4576214551925659},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45686647295951843},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4159936308860779},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3922165632247925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3794008493423462},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.2449651062488556},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23138076066970825},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16373559832572937},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.15723031759262085},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.06032809615135193}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6997665762901306},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5908580422401428},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5877589583396912},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.587552547454834},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5704864859580994},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5098044276237488},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48621025681495667},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4576214551925659},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45686647295951843},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4159936308860779},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3922165632247925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3794008493423462},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.2449651062488556},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23138076066970825},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16373559832572937},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.15723031759262085},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.06032809615135193},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-53536-3_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-53536-3_8","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-01397153v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01397153","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":"Lecture Notes in Computer Science, 2016, WG 2016, 9941, pp.85-96. ⟨10.1007/978-3-662-53536-3_8⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W116738217","https://openalex.org/W1511942180","https://openalex.org/W1555792552","https://openalex.org/W1617257399","https://openalex.org/W1835083164","https://openalex.org/W1972095231","https://openalex.org/W1973199140","https://openalex.org/W1983504800","https://openalex.org/W1994887153","https://openalex.org/W2011039300","https://openalex.org/W2017777390","https://openalex.org/W2017999484","https://openalex.org/W2053991811","https://openalex.org/W2072480005","https://openalex.org/W2077416162","https://openalex.org/W2095358340","https://openalex.org/W2096613302","https://openalex.org/W2100432797","https://openalex.org/W2128302269","https://openalex.org/W2187700168","https://openalex.org/W2190717998","https://openalex.org/W2248791588","https://openalex.org/W2486237862","https://openalex.org/W2799127232","https://openalex.org/W2949732571","https://openalex.org/W2963527469"],"related_works":["https://openalex.org/W2349332978","https://openalex.org/W1969119072","https://openalex.org/W4297789824","https://openalex.org/W2951489338","https://openalex.org/W1967676881","https://openalex.org/W3000187531","https://openalex.org/W2997279771","https://openalex.org/W4298142409","https://openalex.org/W2998656784","https://openalex.org/W4250290902"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}