{"id":"https://openalex.org/W7128767546","doi":"https://doi.org/10.1007/978-981-95-7127-7_20","title":"Complexity and\u00a0Algorithms for\u00a0Arc-Kayles and\u00a0Non-disconnecting Arc-Kayles","display_name":"Complexity and\u00a0Algorithms for\u00a0Arc-Kayles and\u00a0Non-disconnecting Arc-Kayles","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7128767546","doi":"https://doi.org/10.1007/978-981-95-7127-7_20"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-95-7127-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-95-7127-7_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":null,"display_name":"Kyle Burke","orcid":null},"institutions":[{"id":"https://openalex.org/I158397150","display_name":"Florida Southern College","ror":"https://ror.org/026hjc247","country_code":"US","type":"education","lineage":["https://openalex.org/I158397150"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kyle Burke","raw_affiliation_strings":["Florida Southern College, Lakeland, FL, 33801, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Florida Southern College, Lakeland, FL, 33801, USA","institution_ids":["https://openalex.org/I158397150"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Antoine Dailly","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210088668","display_name":"Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement","ror":"https://ror.org/003vg9w96","country_code":"FR","type":"government","lineage":["https://openalex.org/I4210088668"]},{"id":"https://openalex.org/I4210103002","display_name":"University of Clermont Auvergne","ror":null,"country_code":"FR","type":null,"lineage":["https://openalex.org/I4210103002"]},{"id":"https://openalex.org/I4210143836","display_name":"Clermont Universit\u00e9","ror":"https://ror.org/03yf5zr20","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210143836"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Antoine Dailly","raw_affiliation_strings":["CNRS, Mines de Saint-\u00c9tienne, Clermont-Auvergne-INP, LIMOS, Universit\u00e9 Clermont-Auvergne, 63000, Clermont-Ferrand, France","INRAE, UR TSCF, Universit\u00e9 Clermont Auvergne, 63000, Clermont-Ferrand, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, Mines de Saint-\u00c9tienne, Clermont-Auvergne-INP, LIMOS, Universit\u00e9 Clermont-Auvergne, 63000, Clermont-Ferrand, France","institution_ids":["https://openalex.org/I4210103002","https://openalex.org/I4210143836","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"INRAE, UR TSCF, Universit\u00e9 Clermont Auvergne, 63000, Clermont-Ferrand, France","institution_ids":["https://openalex.org/I4210103002","https://openalex.org/I4210088668","https://openalex.org/I4210143836"]}]},{"author_position":"last","author":{"id":null,"display_name":"Nacim Oijid","orcid":null},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Nacim Oijid","raw_affiliation_strings":["Department of Mathematics and Mathematical Statistics, Ume\u00e5 University, Ume\u00e5, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Mathematical Statistics, Ume\u00e5 University, Ume\u00e5, Sweden","institution_ids":["https://openalex.org/I90267481"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38154139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"293","last_page":"307"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.25119999051094055,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.25119999051094055,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.19539999961853027,"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/T10142","display_name":"Formal Methods in Verification","score":0.17080000042915344,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6215000152587891},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6159999966621399},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5820000171661377},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.501800000667572},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4681999981403351},{"id":"https://openalex.org/keywords/asymptotic-computational-complexity","display_name":"Asymptotic computational complexity","score":0.4530999958515167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4341999888420105},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4081000089645386},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4000000059604645}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6611999869346619},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6215000152587891},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6159999966621399},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5820000171661377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5157999992370605},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.501800000667572},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4681999981403351},{"id":"https://openalex.org/C164215192","wikidata":"https://www.wikidata.org/wiki/Q13414364","display_name":"Asymptotic computational complexity","level":4,"score":0.4530999958515167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4341999888420105},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4000000059604645},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C68060419","wikidata":"https://www.wikidata.org/wiki/Q40754","display_name":"Subtraction","level":2,"score":0.38580000400543213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3700999915599823},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.3504999876022339},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3237000107765198},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32330000400543213},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.31769999861717224},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3075000047683716},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.2955000102519989},{"id":"https://openalex.org/C2983064736","wikidata":"https://www.wikidata.org/wiki/Q20779668","display_name":"Algorithmic complexity","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27250000834465027},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2549999952316284}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-981-95-7127-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-95-7127-7_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:HAL:hal-05515855v1","is_oa":false,"landing_page_url":"https://hal.inrae.fr/hal-05515855","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The 20th International Conference and Workshops on Algorithms and Computation (WALCOM 2026), Mar 2026, Perugia (Italy), Italy. pp.293-307, &#x27E8;10.1007/978-981-95-7127-7_20&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W163366850","https://openalex.org/W1986020220","https://openalex.org/W2018654155","https://openalex.org/W2042714866","https://openalex.org/W2567188812","https://openalex.org/W2901375845","https://openalex.org/W2917125947","https://openalex.org/W2963092809","https://openalex.org/W2963745914","https://openalex.org/W3137807310","https://openalex.org/W3158936983","https://openalex.org/W4210534356","https://openalex.org/W4213277361","https://openalex.org/W4231202982","https://openalex.org/W4246361653","https://openalex.org/W4251554051","https://openalex.org/W4379911512","https://openalex.org/W4387978268","https://openalex.org/W7083167077"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}
