{"id":"https://openalex.org/W1883368305","doi":"https://doi.org/10.1007/978-3-642-11409-0_4","title":"Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs","display_name":"Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs","publication_year":2009,"publication_date":"2009-12-03","ids":{"openalex":"https://openalex.org/W1883368305","doi":"https://doi.org/10.1007/978-3-642-11409-0_4","mag":"1883368305"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-11409-0_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11409-0_4","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/1159535","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068613759","display_name":"Hajo Broersma","orcid":"https://orcid.org/0000-0002-4678-3210"},"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":"Hajo Broersma","raw_affiliation_strings":["Department of Computer Science, University of Durham, Science Laboratories, South Road, Durham, DH1 3LE, England","Department of Computer Science, University of Durham, Durham, England DH1 3LE#TAB#"],"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"]},{"raw_affiliation_string":"Department of Computer Science, University of Durham, Durham, England DH1 3LE#TAB#","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Institutt for informatikk, Universitet i Bergen, Postboks 7803, 5020, Bergen, Norway","Institutt for informatikk, Universitet i Bergen, Bergen, Norway 5020#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institutt for informatikk, Universitet i Bergen, Postboks 7803, 5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Institutt for informatikk, Universitet i Bergen, Bergen, Norway 5020#TAB#","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","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","Department of Computer Science, University of Durham, Durham, England DH1 3LE#TAB#"],"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"]},{"raw_affiliation_string":"Department of Computer Science, University of Durham, Durham, England DH1 3LE#TAB#","institution_ids":["https://openalex.org/I190082696"]}]},{"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","Department of Computer Science, University of Durham, Durham, England DH1 3LE#TAB#"],"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"]},{"raw_affiliation_string":"Department of Computer Science, University of Durham, Durham, England DH1 3LE#TAB#","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.9034,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.69629156,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"44","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.996999979019165,"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.9957000017166138,"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.7122482061386108},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.6731393933296204},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6308721303939819},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5228909850120544},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5074297785758972},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5001418590545654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44415953755378723},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4347788393497467},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.3775619864463806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37344953417778015},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3630960285663605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3620065748691559}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7122482061386108},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.6731393933296204},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6308721303939819},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5228909850120544},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5074297785758972},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5001418590545654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44415953755378723},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4347788393497467},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3775619864463806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37344953417778015},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3630960285663605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3620065748691559}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-11409-0_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11409-0_4","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:ris.utwente.nl:openaire_cris_publications/4939c61c-45c0-4cb0-a799-22fc768c0888","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/4939c61c-45c0-4cb0-a799-22fc768c0888","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:6273","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/6273/","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":"Habib, M. & Paul, C. (Eds.). (2009). Graph-theoretic concepts in computer science : 35th International Workshop, WG 2009, 24-26 June 2009, Montpellier, France ; revised papers. Berlin: Springer, pp. 44-53, Lecture notes in computer science(5911)","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1159535","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1159535","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:1159535","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1159535","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":23,"referenced_works":["https://openalex.org/W1506292197","https://openalex.org/W1542928981","https://openalex.org/W1589421353","https://openalex.org/W1824848400","https://openalex.org/W1967979192","https://openalex.org/W1969186119","https://openalex.org/W1975587904","https://openalex.org/W2001868457","https://openalex.org/W2005906639","https://openalex.org/W2008914847","https://openalex.org/W2014287896","https://openalex.org/W2067458708","https://openalex.org/W2092366448","https://openalex.org/W2132624129","https://openalex.org/W2168336253","https://openalex.org/W2296469570","https://openalex.org/W2479149412","https://openalex.org/W2508797883","https://openalex.org/W2799004609","https://openalex.org/W2989468009","https://openalex.org/W3039948875","https://openalex.org/W3043060850","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W4299647289","https://openalex.org/W1618127724","https://openalex.org/W2155631825","https://openalex.org/W2952856011","https://openalex.org/W2011032737","https://openalex.org/W4241541331","https://openalex.org/W2259723333","https://openalex.org/W2588150626","https://openalex.org/W2527800796"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}