{"id":"https://openalex.org/W1537213321","doi":"https://doi.org/10.1007/978-3-642-11409-0_30","title":"Finding Induced Paths of Given Parity in Claw-Free Graphs","display_name":"Finding Induced Paths of Given Parity in Claw-Free Graphs","publication_year":2009,"publication_date":"2009-12-03","ids":{"openalex":"https://openalex.org/W1537213321","doi":"https://doi.org/10.1007/978-3-642-11409-0_30","mag":"1537213321"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-11409-0_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11409-0_30","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1160317","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017522059","display_name":"Pim van \u2019t Hof","orcid":"https://orcid.org/0000-0002-1778-7212"},"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":"Pim van \u2019t Hof","raw_affiliation_strings":["Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011646983","display_name":"Marcin Kami\u0144ski","orcid":"https://orcid.org/0000-0002-8180-6991"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Marcin Kami\u0144ski","raw_affiliation_strings":["Computer Science Department, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe CP212, B-1050, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe CP212, B-1050, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","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":["Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6023,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59782609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"341","last_page":"352"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9969000220298767,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9966999888420105,"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.8027827739715576},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5847862362861633},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5718653798103333},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.544444739818573},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.52520352602005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5182057023048401},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.47805124521255493},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.4663580656051636},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4405747950077057},{"id":"https://openalex.org/keywords/claw","display_name":"Claw","score":0.42872127890586853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4265249967575073},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4222477674484253},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2686750590801239},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.22722205519676208},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.17033150792121887},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.14680272340774536},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13649630546569824}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8027827739715576},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5847862362861633},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5718653798103333},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.544444739818573},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.52520352602005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5182057023048401},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.47805124521255493},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.4663580656051636},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4405747950077057},{"id":"https://openalex.org/C29738020","wikidata":"https://www.wikidata.org/wiki/Q217605","display_name":"Claw","level":2,"score":0.42872127890586853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4265249967575073},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4222477674484253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2686750590801239},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.22722205519676208},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.17033150792121887},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.14680272340774536},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13649630546569824},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"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/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-11409-0_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11409-0_30","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:6318","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/6318/","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":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Paul, C. & Habib, M. (Eds.). (2009). Graph-theoretic concepts in computer science. Berlin: Springer, pp. 341-352, Lecture notes in computer science(5911)","raw_type":"Book chapter"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/166635","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/166635","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"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, 5911 LNCS","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:durham-repository.worktribe.com:1160317","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1160317","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":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1160317","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1160317","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":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3476746706","display_name":null,"funder_award_id":"EP/D053633/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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1575089356","https://openalex.org/W1575561304","https://openalex.org/W1639912615","https://openalex.org/W1968240611","https://openalex.org/W1970625924","https://openalex.org/W1973199140","https://openalex.org/W1979428714","https://openalex.org/W1983848199","https://openalex.org/W1985324491","https://openalex.org/W1991728994","https://openalex.org/W1994460648","https://openalex.org/W2002152208","https://openalex.org/W2002326865","https://openalex.org/W2007804392","https://openalex.org/W2013421520","https://openalex.org/W2013949481","https://openalex.org/W2014287896","https://openalex.org/W2033715869","https://openalex.org/W2034123408","https://openalex.org/W2042430808","https://openalex.org/W2045664805","https://openalex.org/W2047194922","https://openalex.org/W2060685279","https://openalex.org/W2061782500","https://openalex.org/W2076296189","https://openalex.org/W2077665273","https://openalex.org/W2082173549","https://openalex.org/W2082616837","https://openalex.org/W2086119402","https://openalex.org/W2089465933","https://openalex.org/W2095243185","https://openalex.org/W2104062785","https://openalex.org/W2118348286","https://openalex.org/W2145520578","https://openalex.org/W2153855282","https://openalex.org/W2798588639","https://openalex.org/W4241764762","https://openalex.org/W4256581173"],"related_works":["https://openalex.org/W142613662","https://openalex.org/W1785360057","https://openalex.org/W2092747350","https://openalex.org/W2072516858","https://openalex.org/W2070240448","https://openalex.org/W2399451272","https://openalex.org/W4299525029","https://openalex.org/W2080337524","https://openalex.org/W2463313349","https://openalex.org/W2735325783"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}