{"id":"https://openalex.org/W2266980279","doi":"https://doi.org/10.1007/978-3-319-18173-8_14","title":"Contraction Blockers for Graphs with Forbidden Induced Paths","display_name":"Contraction Blockers for Graphs with Forbidden Induced Paths","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2266980279","doi":"https://doi.org/10.1007/978-3-319-18173-8_14","mag":"2266980279"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-18173-8_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18173-8_14","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":true,"oa_status":"green","oa_url":"https://hal.science/hal-01338229","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053370998","display_name":"\u00d6znur Ya\u015far Diner","orcid":"https://orcid.org/0000-0002-9271-2691"},"institutions":[{"id":"https://openalex.org/I132286405","display_name":"Kadir Has University","ror":"https://ror.org/03zzckc47","country_code":"TR","type":"education","lineage":["https://openalex.org/I132286405"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"\u00d6znur Ya\u015far Diner","raw_affiliation_strings":["Computer Engineering Department, Kadir Has University, Istanbul, Turkey"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, Kadir Has University, Istanbul, Turkey","institution_ids":["https://openalex.org/I132286405"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["School of Engineering and Computing Sciences, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Computing Sciences, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049855826","display_name":"Christophe Picouleau","orcid":"https://orcid.org/0000-0001-8092-1923"},"institutions":[{"id":"https://openalex.org/I4210145724","display_name":"Centre d'Etudes et De Recherche en Informatique et Communications","ror":"https://ror.org/044j5mm75","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210145724"]},{"id":"https://openalex.org/I124158823","display_name":"Conservatoire National des Arts et M\u00e9tiers","ror":"https://ror.org/0175hh227","country_code":"FR","type":"education","lineage":["https://openalex.org/I124158823","https://openalex.org/I4210134562"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christophe Picouleau","raw_affiliation_strings":["Laboratoire CEDRIC, CNAM, Paris, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire CEDRIC, CNAM, Paris, France","institution_ids":["https://openalex.org/I4210145724","https://openalex.org/I124158823"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040690366","display_name":"Bernard Ries","orcid":"https://orcid.org/0000-0003-4395-5547"},"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/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Bernard Ries","raw_affiliation_strings":["PSL, Universit\u00e9 Paris-Dauphine and CNRS, LAMSADE UMR 7243, Paris, France"],"affiliations":[{"raw_affiliation_string":"PSL, Universit\u00e9 Paris-Dauphine and CNRS, LAMSADE UMR 7243, Paris, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5053370998"],"corresponding_institution_ids":["https://openalex.org/I132286405"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.7765,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90407621,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"194","last_page":"207"},"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.9991999864578247,"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.9940000176429749,"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.8005794882774353},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7273950576782227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6877143383026123},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.6138445734977722},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5875287652015686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5595359206199646},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5578429698944092},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4911353290081024},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.43830522894859314},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.43487679958343506},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35800251364707947},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2531624138355255}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8005794882774353},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7273950576782227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6877143383026123},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.6138445734977722},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5875287652015686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5595359206199646},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5578429698944092},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4911353290081024},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.43830522894859314},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.43487679958343506},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35800251364707947},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2531624138355255}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-319-18173-8_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18173-8_14","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:dro.dur.ac.uk.OAI2:14241","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/14241/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Paschos, Vangelis Th. & Widmayer, Peter (Eds.). (2015). Algorithms and complexity : 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015 ; proceedings. : Springer, pp. 194-207, Lecture notes in computer science(9079)","raw_type":"Book chapter"},{"id":"pmh:oai:HAL:hal-01338229v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01338229","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":"9th International Conference on Algorithms and Complexity (CIAC 2015), May 2015, Paris, France. pp.194-207, ⟨10.1007/978-3-319-18173-8_14⟩","raw_type":"Conference papers"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/15585","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/15585","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},{"id":"pmh:oai:durham-repository.worktribe.com:1152979","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1152979","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01338229v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01338229","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":"9th International Conference on Algorithms and Complexity (CIAC 2015), May 2015, Paris, France. pp.194-207, ⟨10.1007/978-3-319-18173-8_14⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6191833929","display_name":null,"funder_award_id":"EP/K025090/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W643543764","https://openalex.org/W1579049696","https://openalex.org/W1853176571","https://openalex.org/W1882281809","https://openalex.org/W1974182574","https://openalex.org/W1990953050","https://openalex.org/W2003852880","https://openalex.org/W2011039300","https://openalex.org/W2012154006","https://openalex.org/W2015769804","https://openalex.org/W2015906942","https://openalex.org/W2022137727","https://openalex.org/W2028775537","https://openalex.org/W2037935057","https://openalex.org/W2038483792","https://openalex.org/W2044825393","https://openalex.org/W2065067474","https://openalex.org/W2086790666","https://openalex.org/W2089465933","https://openalex.org/W2143474538","https://openalex.org/W2162275416","https://openalex.org/W2165648442","https://openalex.org/W2181288515","https://openalex.org/W2187700168","https://openalex.org/W2296729072","https://openalex.org/W2486237862","https://openalex.org/W4285719527","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W31595256","https://openalex.org/W2169699292","https://openalex.org/W1977862280","https://openalex.org/W2083238533","https://openalex.org/W2293414251","https://openalex.org/W1971319751","https://openalex.org/W2898526288","https://openalex.org/W3022162048","https://openalex.org/W2061237693","https://openalex.org/W2042018534"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}