{"id":"https://openalex.org/W2008003941","doi":"https://doi.org/10.1016/0304-3975(93)90357-y","title":"Complexity of path-forming games","display_name":"Complexity of path-forming games","publication_year":1993,"publication_date":"1993-03-01","ids":{"openalex":"https://openalex.org/W2008003941","doi":"https://doi.org/10.1016/0304-3975(93)90357-y","mag":"2008003941"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(93)90357-y","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(93)90357-y","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/handle/1874/16615","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"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":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands","Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032730524"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":3.6487,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.92849112,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"110","issue":"1","first_page":"215","last_page":"245"},"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.9950000047683716,"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.9769999980926514,"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/treewidth","display_name":"Treewidth","score":0.7829192876815796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6601291298866272},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6168900728225708},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.6118221282958984},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.605222225189209},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5271674990653992},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4978039264678955},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.48126548528671265},{"id":"https://openalex.org/keywords/combinatorial-game-theory","display_name":"Combinatorial game theory","score":0.4535823464393616},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45219406485557556},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4277160167694092},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42106562852859497},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3329082727432251},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.28936445713043213},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2530536651611328},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.24092388153076172},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.22979319095611572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20754531025886536},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.16007575392723083},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10928961634635925},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.09220147132873535}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7829192876815796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6601291298866272},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6168900728225708},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.6118221282958984},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.605222225189209},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5271674990653992},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4978039264678955},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.48126548528671265},{"id":"https://openalex.org/C102234262","wikidata":"https://www.wikidata.org/wiki/Q1320931","display_name":"Combinatorial game theory","level":4,"score":0.4535823464393616},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45219406485557556},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4277160167694092},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42106562852859497},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3329082727432251},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.28936445713043213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2530536651611328},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.24092388153076172},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.22979319095611572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20754531025886536},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.16007575392723083},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10928961634635925},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.09220147132873535},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0304-3975(93)90357-y","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(93)90357-y","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/16615","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/16615","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/16615","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/16615","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W152064238","https://openalex.org/W194684792","https://openalex.org/W1484040084","https://openalex.org/W1492169292","https://openalex.org/W1504086046","https://openalex.org/W1532282263","https://openalex.org/W1566008247","https://openalex.org/W1587078595","https://openalex.org/W1588705292","https://openalex.org/W1836127928","https://openalex.org/W1965172764","https://openalex.org/W1983796355","https://openalex.org/W1983860528","https://openalex.org/W1988939889","https://openalex.org/W1991755800","https://openalex.org/W1993960367","https://openalex.org/W2005079828","https://openalex.org/W2011039300","https://openalex.org/W2016056456","https://openalex.org/W2019834939","https://openalex.org/W2022486658","https://openalex.org/W2028357390","https://openalex.org/W2034501206","https://openalex.org/W2038674294","https://openalex.org/W2042714866","https://openalex.org/W2064796716","https://openalex.org/W2064968744","https://openalex.org/W2077313418","https://openalex.org/W2083659666","https://openalex.org/W2085550081","https://openalex.org/W2091133474","https://openalex.org/W2099035480","https://openalex.org/W2103122911","https://openalex.org/W2115666768","https://openalex.org/W2148043549","https://openalex.org/W2150235218","https://openalex.org/W2151617868","https://openalex.org/W2156827107","https://openalex.org/W2159366821","https://openalex.org/W2166566648","https://openalex.org/W4211146495","https://openalex.org/W4232336108","https://openalex.org/W4250074066","https://openalex.org/W4300303686","https://openalex.org/W4361867857","https://openalex.org/W6606175027","https://openalex.org/W6630306118","https://openalex.org/W6631969875","https://openalex.org/W6631996444","https://openalex.org/W6633951208","https://openalex.org/W6635162788","https://openalex.org/W6635283363","https://openalex.org/W6682191330","https://openalex.org/W6684418227","https://openalex.org/W6684468096","https://openalex.org/W7067127618"],"related_works":["https://openalex.org/W1511821218","https://openalex.org/W1587078595","https://openalex.org/W2124176527","https://openalex.org/W2985636744","https://openalex.org/W2125058377","https://openalex.org/W2465927132","https://openalex.org/W4387667086","https://openalex.org/W3123083091","https://openalex.org/W4298666138","https://openalex.org/W1987968444"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}