{"id":"https://openalex.org/W1556454392","doi":"https://doi.org/10.1007/11496915_20","title":"On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem","display_name":"On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1556454392","doi":"https://doi.org/10.1007/11496915_20","mag":"1556454392"},"language":"en","primary_location":{"id":"doi:10.1007/11496915_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11496915_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/A5085372854","display_name":"Andreas Brandst\u00e4dt","orcid":null},"institutions":[{"id":"https://openalex.org/I4665924","display_name":"University of Rostock","ror":"https://ror.org/03zdwsf69","country_code":"DE","type":"education","lineage":["https://openalex.org/I4665924"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Brandst\u00e4dt","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Rostock, D-18051, Rostock, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Rostock, D-18051, Rostock, Germany","institution_ids":["https://openalex.org/I4665924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088012278","display_name":"Ch\u0131\u0301nh T. Ho\u00e0ng","orcid":"https://orcid.org/0000-0001-6782-1194"},"institutions":[{"id":"https://openalex.org/I75381157","display_name":"Wilfrid Laurier University","ror":"https://ror.org/00fn7gb05","country_code":"CA","type":"education","lineage":["https://openalex.org/I75381157"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ch\u00ednh T. Ho\u00e0ng","raw_affiliation_strings":["Department of Physics and Computing, Wilfrid Laurier University, Waterloo, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Physics and Computing, Wilfrid Laurier University, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I75381157"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085372854"],"corresponding_institution_ids":["https://openalex.org/I4665924"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.2186,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87861272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"265","last_page":"275"},"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.9983999729156494,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9947999715805054,"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/chordal-graph","display_name":"Chordal graph","score":0.8741154670715332},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.6893426179885864},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6223194599151611},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6074976325035095},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5922707915306091},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.570137083530426},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.4570898711681366},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4362427592277527},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.435258150100708},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4281115233898163},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42562854290008545},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4157381057739258},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.36791008710861206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3524083197116852},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19463077187538147},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.15153473615646362},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10924741625785828}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8741154670715332},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.6893426179885864},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6223194599151611},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6074976325035095},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5922707915306091},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.570137083530426},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.4570898711681366},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4362427592277527},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.435258150100708},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4281115233898163},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42562854290008545},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4157381057739258},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.36791008710861206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3524083197116852},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19463077187538147},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.15153473615646362},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10924741625785828}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11496915_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11496915_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:CiteSeerX.psu:10.1.1.68.1653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-rostock.de/~ab/ps-files/nearlychordal2.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W133100469","https://openalex.org/W1499662001","https://openalex.org/W1573405943","https://openalex.org/W1579049696","https://openalex.org/W1714443748","https://openalex.org/W1983504800","https://openalex.org/W1983733602","https://openalex.org/W1990953050","https://openalex.org/W1999679245","https://openalex.org/W2012329067","https://openalex.org/W2015906942","https://openalex.org/W2022093908","https://openalex.org/W2028775537","https://openalex.org/W2029454721","https://openalex.org/W2050715071","https://openalex.org/W2057405567","https://openalex.org/W2059553705","https://openalex.org/W2118348286","https://openalex.org/W2153855282","https://openalex.org/W2170633983","https://openalex.org/W2951116413","https://openalex.org/W3176255773"],"related_works":["https://openalex.org/W2051627428","https://openalex.org/W77483341","https://openalex.org/W1546874952","https://openalex.org/W2004663694","https://openalex.org/W2019597617","https://openalex.org/W2913212512","https://openalex.org/W2949556766","https://openalex.org/W2599254863","https://openalex.org/W4300330793","https://openalex.org/W2744198939"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}