{"id":"https://openalex.org/W2607365952","doi":"https://doi.org/10.1007/978-3-319-57586-5_31","title":"On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs","display_name":"On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2607365952","doi":"https://doi.org/10.1007/978-3-319-57586-5_31","mag":"2607365952"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-57586-5_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-57586-5_31","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/A5057527289","display_name":"\u202aS\u00e1ndor Kisfaludi-Bak","orcid":"https://orcid.org/0000-0002-6856-2902"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"S\u00e1ndor Kisfaludi-Bak","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037940407","display_name":"Tom C. van der Zanden","orcid":"https://orcid.org/0000-0003-3080-3210"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Tom C. van der Zanden","raw_affiliation_strings":["Department of Computer Science, Utrecht University, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057527289"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.6581,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88764471,"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":"369","last_page":"380"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5608888268470764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4390513002872467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42203980684280396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39543941617012024},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20716425776481628}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5608888268470764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4390513002872467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42203980684280396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39543941617012024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20716425776481628}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/978-3-319-57586-5_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-57586-5_31","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:pure.tue.nl:openaire_cris_publications/7af60b22-24b0-41bf-93a8-c7813ca836b2","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/7af60b22-24b0-41bf-93a8-c7813ca836b2","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"Kisfaludi-Bak, S & van der Zanden, T C 2017, On the exact complexity of hamiltonian cycle and q-colouring in disk graphs. in D Fotakis, A Pagourtzis & V T Paschos (eds), Algorithms and Complexity : 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10236 LNCS, Springer, Dordrecht, pp. 369-380, 10th International Conference on Algorithms and Complexity, CIAC 2017, Athens, Greece, 24/05/17. https://doi.org/10.1007/978-3-319-57586-5_31","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:880013","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=880013","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:868211","is_oa":false,"landing_page_url":"http://repository.tue.nl/868211","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:880013","is_oa":false,"landing_page_url":"http://repository.tue.nl/880013","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/7af60b22-24b0-41bf-93a8-c7813ca836b2","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/7af60b22-24b0-41bf-93a8-c7813ca836b2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and Complexity: 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings, 369 - 380","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/361266","is_oa":false,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/361266","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and Complexity, 10236 LNCS, 369. Springer","raw_type":"info:eu-repo/semantics/bookpart"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W132145278","https://openalex.org/W1760079236","https://openalex.org/W1968952709","https://openalex.org/W1975442866","https://openalex.org/W1985758609","https://openalex.org/W2037995626","https://openalex.org/W2055336889","https://openalex.org/W2059273723","https://openalex.org/W2068019092","https://openalex.org/W2080228825","https://openalex.org/W2180988813","https://openalex.org/W2187605032","https://openalex.org/W2340006107","https://openalex.org/W2401610261","https://openalex.org/W2514415970","https://openalex.org/W2914414140","https://openalex.org/W4238913085","https://openalex.org/W6704052874"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W3086542228","https://openalex.org/W2017331178","https://openalex.org/W2976797620","https://openalex.org/W2982126233","https://openalex.org/W2101463671","https://openalex.org/W4205152167","https://openalex.org/W2129394762","https://openalex.org/W1997928449","https://openalex.org/W2592145755"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}