{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:01:51Z","timestamp":1774983711006,"version":"3.50.1"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172077"],"award-info":[{"award-number":["62172077"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62350710215"],"award-info":[{"award-number":["62350710215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115793","type":"journal-article","created":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T06:27:46Z","timestamp":1769927266000},"page":"115793","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Topological network-control games"],"prefix":"10.1016","volume":"1068","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9022-6470","authenticated-orcid":false,"given":"Zihui","family":"Liang","sequence":"first","affiliation":[]},{"given":"Bakh","family":"Khoussainov","sequence":"additional","affiliation":[]},{"given":"Haidong","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115793_bib0001","article-title":"Winning ways for your mathematical plays (4 volumes)","author":"Berkelamp","year":"2001","journal-title":"Wellesley, MA: AK Peters"},{"key":"10.1016\/j.tcs.2026.115793_bib0002","series-title":"International Symposium on Mathematical Foundations of Computer Science","first-page":"18","article-title":"Playing games with algorithms: algorithmic combinatorial game theory","author":"Demaine","year":"2001"},{"key":"10.1016\/j.tcs.2026.115793_bib0003","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1017\/9781316135167.033","article-title":"Combinatorial games: selected bibliography with a succinct gourmet introduction","volume":"42","author":"Fraenkel","year":"2002","journal-title":"More games of no chance"},{"key":"10.1016\/j.tcs.2026.115793_bib0004","series-title":"Combinatorial Game Theory","volume":"146","author":"Siegel","year":"2013"},{"issue":"1","key":"10.1016\/j.tcs.2026.115793_bib0005","article-title":"Combinatorial analysis of a subtraction game on graphs","volume":"2016","author":"Adams","year":"2016","journal-title":"Int. J. Combinatorics"},{"key":"10.1016\/j.tcs.2026.115793_bib0006","first-page":"259","article-title":"A PSPACE-complete graph nim","volume":"5","author":"Burke","year":"2011","journal-title":"Games No Chance"},{"key":"10.1016\/j.tcs.2026.115793_bib0007","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.tcs.2013.11.025","article-title":"Vertex Nim played on graphs","volume":"516","author":"Duch\u00eane","year":"2014","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115793_bib0008","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1006\/jagm.2002.1215","article-title":"Kayles and nimbers","volume":"43","author":"Bodlaender","year":"2002","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.tcs.2026.115793_bib0009","first-page":"3","article-title":"Nimber sequences of Node-Kayles games","volume":"23","author":"Brown","year":"2020","journal-title":"J. Integer Sequences"},{"issue":"46","key":"10.1016\/j.tcs.2026.115793_bib0010","doi-asserted-by":"crossref","first-page":"6484","DOI":"10.1016\/j.tcs.2011.08.024","article-title":"Guard games on graphs: keep the intruder out!","volume":"412","author":"Fomin","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115793_bib0011","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.tcs.2018.06.018","article-title":"Octal games on graphs: the game 0.33 on subdivided stars and bistars","volume":"746","author":"Beaudou","year":"2018","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115793_bib0012","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s00182-018-0639-5","article-title":"A generalization of arc-Kayles","volume":"48","author":"Dailly","year":"2019","journal-title":"Int. J. Game Theory"},{"issue":"3","key":"10.1016\/j.tcs.2026.115793_bib0013","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.apal.2009.07.011","article-title":"On complexity of Ehrenfeucht-Fra\u00efss\u00e9 games","volume":"161","author":"Khoussainov","year":"2009","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.tcs.2026.115793_bib0014","first-page":"438","article-title":"\u00dcber mathematische kampfspiele","volume":"41","author":"Sprague","year":"1935","journal-title":"Tohoku Math. J. First Series"},{"key":"10.1016\/j.tcs.2026.115793_bib0015","first-page":"6","article-title":"Mathematics and games","volume":"2","author":"Grundy","year":"1939","journal-title":"Eureka"},{"key":"10.1016\/j.tcs.2026.115793_bib0016","series-title":"On Numbers and Games","author":"Conway","year":"2000"},{"key":"10.1016\/j.tcs.2026.115793_bib0017","series-title":"Winning Ways for Your Mathematical Plays, Volume 3","author":"Berlekamp","year":"2018"},{"issue":"9","key":"10.1016\/j.tcs.2026.115793_bib0018","doi-asserted-by":"crossref","first-page":"2533","DOI":"10.1007\/s00453-022-00973-5","article-title":"The largest connected subgraph game","volume":"84","author":"Bensmail","year":"2022","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115793_bib0019","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.tcs.2022.12.014","article-title":"The Maker-Breaker largest connected subgraph game","volume":"943","author":"Bensmail","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115793_bib0020","series-title":"Algorithm Design","author":"Kleinberg","year":"2006"},{"key":"10.1016\/j.tcs.2026.115793_bib0021","unstructured":"\u00c9. Duch\u00eane, V. Gledel, S. Gravier, F. Mc Inerney, M. Mhalla, A. Parreau, Smash and Grab: the 0.6 Scoring Game on Graphs, 2021. Working paper or preprint, https:\/\/hal.science\/hal-03371099."},{"key":"10.1016\/j.tcs.2026.115793_bib0022","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2022.04.050","article-title":"On a vertex-capturing game","volume":"923","author":"Bensmail","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115793_bib0023","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.tcs.2021.05.028","article-title":"Influence: a partizan scoring game on graphs","volume":"878","author":"Duchene","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115793_bib0024","series-title":"Research Report","article-title":"The Complexity of two Colouring Games","author":"Andres","year":"2021"},{"key":"10.1016\/j.tcs.2026.115793_bib0025","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.tcs.2019.12.007","article-title":"Corrigendum to \u201cthe orthogonal colouring game\u201d[Theor. Comput. Sci. 795 (2019) 312\u2013325]","volume":"842","author":"Andres","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115793_bib0026","series-title":"International Computing and Combinatorics Conference","first-page":"144","article-title":"Topological network-control games","author":"Liang","year":"2023"},{"key":"10.1016\/j.tcs.2026.115793_bib0027","series-title":"Computing and Combinatorics","first-page":"15","article-title":"Topological network-control games played on graphs","author":"Liang","year":"2025"},{"key":"10.1016\/j.tcs.2026.115793_bib0028","first-page":"291","article-title":"Sums of positional games","volume":"28","author":"Milnor","year":"1953","journal-title":"Contrib. Theory Games II"},{"issue":"1","key":"10.1016\/j.tcs.2026.115793_bib0029","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2140\/pjm.1959.9.81","article-title":"Mean play of sums of positional games","volume":"9","author":"Hanner","year":"1959","journal-title":"Pacific J. Math."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115793_bib0030","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0304-3975(99)00107-3","article-title":"A metric for positional games","volume":"230","author":"Ettinger","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115793_bib0031","series-title":"Topics in Combinatorial Games","author":"Ettinger","year":"1996"},{"key":"10.1016\/j.tcs.2026.115793_bib0032","doi-asserted-by":"crossref","unstructured":"U. Larsson, R.J. Nowakowski, C.P. Santos, Scoring games: the state of play, Games of no chance 5, 2017.","DOI":"10.37236\/5417"},{"key":"10.1016\/j.tcs.2026.115793_bib0033","unstructured":"U. Larsson, J.P. Neto, R.J. Nowakowski, C.P. Santos, Guaranteed scoring games, arXiv preprint arXiv: 1505.07905(2015)."},{"key":"10.1016\/j.tcs.2026.115793_bib0034","unstructured":"F. Stewart, Impartial scoring play games, arXiv preprint arXiv: 1202.4655(2012a)."},{"key":"10.1016\/j.tcs.2026.115793_bib0035","first-page":"447","article-title":"Scoring play combinatorial games","volume":"5","author":"Stewart","year":"2012","journal-title":"Games No Chance"},{"key":"10.1016\/j.tcs.2026.115793_bib0036","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2025.115123","article-title":"Network control games played on graphs","author":"Liang","year":"2025","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115793_bib0037","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2017.11.015","article-title":"Spy-game on graphs: complexity and simple topologies","volume":"725","author":"Cohen","year":"2018","journal-title":"Theor. Comput. Sci."},{"issue":"21\u201323","key":"10.1016\/j.tcs.2026.115793_bib0038","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.tcs.2008.12.053","article-title":"Compound node\u2013kayles on paths","volume":"410","author":"Guignard","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115793_bib0039","article-title":"Polynomial time graph families for arc kayles","volume":"16","author":"Huggan","year":"2016","journal-title":"Integers"},{"key":"10.1016\/j.tcs.2026.115793_bib0040","series-title":"Impartial Intersection Restriction Games","author":"Huggan","year":"2015"},{"key":"10.1016\/j.tcs.2026.115793_bib0041","series-title":"Proceedings of the Forty-First Southeastern International Conference on Combinatorics, Graph Theory and Computing","first-page":"171","article-title":"Computing strategies for graphical Nim","volume":"202","author":"Calkin","year":"2010"},{"key":"10.1016\/j.tcs.2026.115793_bib0042","series-title":"Proceedings of the Fifth Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time (preliminary report)","author":"Stockmeyer","year":"1973"},{"key":"10.1016\/j.tcs.2026.115793_bib0043","unstructured":"N. Fijalkow, N. Bertrand, P. Bouyer-Decitre, R. Brenguier, A. Carayol, J. Fearnley, H. Gimbert, F. Horn, R. Ibsen-Jensen, N. Markey, B. Monmege, P. Novotn\u00fd, M. Randour, O. Sankur, S. Schmitz, O. Serre, M. Skomra, Games on graphs, 2023,. To be published by Cambridge University Press. Editor: Nathana\u00ebl Fijalkow. arXiv: 2305.10546."},{"key":"10.1016\/j.tcs.2026.115793_bib0044","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del, W. Thomas, T. Wilke, Automata, logics, and infinite Games. LNCS, vol. 2500, (2002).","DOI":"10.1007\/3-540-36387-4"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T12:34:54Z","timestamp":1774010094000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":44,"alternative-id":["S0304397526000526"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115793","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Topological network-control games","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115793","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115793"}}