{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:12:22Z","timestamp":1784110342758,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819610921","type":"print"},{"value":"9789819610938","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_2","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:26Z","timestamp":1739999906000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Topological Network-Control Games Played on\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Zihui","family":"Liang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bakh","family":"Khoussainov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haidong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"2_CR1","first-page":"1476359","volume":"2016","author":"R Adams","year":"2016","unstructured":"Adams, R., Dixon, J., Elder, J., Peabody, J., Vega, O., Willis, K.: Combinatorial analysis of a subtraction game on graphs. Int. J. Comb. 2016, 1476359 (2016)","journal-title":"Int. J. Comb."},{"key":"2_CR2","unstructured":"Andres, S.D., Dross, F., Huggan, M., Mc\u00a0Inerney, F., Nowakowski, R.J.: The complexity of two colouring games. Research report, CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany (2021). https:\/\/hal.science\/hal-02053265"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Andres, S.D., Huggan, M., Mc\u00a0Inerney, F., Nowakowski, R.J.: Corrigendum to \u201cthe orthogonal colouring game\u201d Theor. Comput. Sci. 795, 312\u2013325 (2019). Theoretical Computer Science 842, 133\u2013135 (2020)","DOI":"10.1016\/j.tcs.2019.12.007"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Beaudou, L., et al.: Octal games on graphs: the game 0.33 on subdivided stars and bistars. Theoret. Comput. Sci. 746, 19\u201335 (2018)","DOI":"10.1016\/j.tcs.2018.06.018"},{"issue":"9","key":"2_CR5","doi-asserted-by":"publisher","first-page":"2533","DOI":"10.1007\/s00453-022-00973-5","volume":"84","author":"J Bensmail","year":"2022","unstructured":"Bensmail, J., Fioravantes, F., Mc Inerney, F., Nisse, N.: The largest connected subgraph game. Algorithmica 84(9), 2533\u20132555 (2022)","journal-title":"Algorithmica"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2022.12.014","volume":"943","author":"J Bensmail","year":"2023","unstructured":"Bensmail, J., Fioravantes, F., Mc Inerney, F., Nisse, N., Oijid, N.: The maker-breaker largest connected subgraph game. Theoret. Comput. Sci. 943, 102\u2013120 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2022.04.050","volume":"923","author":"J Bensmail","year":"2022","unstructured":"Bensmail, J., Mc Inerney, F.: On a vertex-capturing game. Theoret. Comput. Sci. 923, 27\u201346 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR8","volume-title":"Winning Ways for Your Mathematical Plays (4 Volumes)","author":"E Berkelamp","year":"2001","unstructured":"Berkelamp, E., Conway, J., Guy, R.: Winning Ways for Your Mathematical Plays (4 Volumes). AK Peters, Wellesley, MA (2001)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, vol. 3. CRC Press (2018)","DOI":"10.1201\/9780429487330"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1006\/jagm.2002.1215","volume":"43","author":"HL Bodlaender","year":"2002","unstructured":"Bodlaender, H.L., Kratsch, D.: Kayles and nimbers. J. Algorithms 43(1), 106\u2013119 (2002)","journal-title":"J. Algorithms"},{"key":"2_CR11","unstructured":"Brown, S., et al.: Nimber sequences of node-kayles games. J. Integer Sequences 23, 20.3.5 (2020)"},{"key":"2_CR12","first-page":"259","volume":"5","author":"K Burke","year":"2011","unstructured":"Burke, K., George, O.: A PSPACE-complete graph Nim. Games No Chance 5, 259\u2013269 (2011)","journal-title":"Games No Chance"},{"key":"2_CR13","unstructured":"Calkin, N.J., James, K., Janoski, J.E., Leggett, S., Richards, B., Sitaraman, N., Thomas, S.M.: Computing strategies for graphical Nim. In: Proceedings of the Forty-First Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol.\u00a0202, pp. 171\u2013185. Citeseer (2010)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2012.12.029","volume":"494","author":"J Cibulka","year":"2013","unstructured":"Cibulka, J., Kyn\u010dl, J., M\u00e9sz\u00e1ros, V., Stola\u0159, R., Valtr, P.: Graph sharing games: complexity and connectivity. Theoret. Comput. Sci. 494, 49\u201362 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.11.015","volume":"725","author":"N Cohen","year":"2018","unstructured":"Cohen, N., Martins, N.A., Mc Inerney, F., Nisse, N., P\u00e9rennes, S., Sampaio, R.: Spy-game on graphs: complexity and simple topologies. Theoret. Comput. Sci. 725, 1\u201315 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Conway, J.H.: On Numbers and Games. CRC Press (2000)","DOI":"10.1201\/9781439864159"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00182-018-0639-5","volume":"48","author":"A Dailly","year":"2019","unstructured":"Dailly, A., Gledel, V., Heinrich, M.: A generalization of arc-kayles. Internat. J. Game Theory 48(2), 491\u2013511 (2019)","journal-title":"Internat. J. Game Theory"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-44683-4_3","volume-title":"Mathematical Foundations of Computer Science 2001","author":"ED Demaine","year":"2001","unstructured":"Demaine, E.D.: Playing games with algorithms: algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 18\u201333. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_3"},{"key":"2_CR19","unstructured":"Duch\u00eane, \u00c9., Gledel, V., Gravier, S., Mc\u00a0Inerney, F., Mhalla, M., Parreau, A.: Smash and grab: the 0.6 scoring game on graphs (2021). https:\/\/hal.science\/hal-03371099, working paper or preprint"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2021.05.028","volume":"878","author":"E Duchene","year":"2021","unstructured":"Duchene, E., Gonzalez, S., Parreau, A., R\u00e9mila, E., Solal, P.: Influence: a partizan scoring game on graphs. Theoret. Comput. Sci. 878, 26\u201346 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2013.11.025","volume":"516","author":"\u00c9 Duch\u00eane","year":"2014","unstructured":"Duch\u00eane, \u00c9., Renault, G.: Vertex Nim played on graphs. Theoret. Comput. Sci. 516, 20\u201327 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"2_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0304-3975(99)00107-3","volume":"230","author":"JM Ettinger","year":"2000","unstructured":"Ettinger, J.M.: A metric for positional games. Theoret. Comput. Sci. 230(1\u20132), 207\u2013219 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR23","unstructured":"Ettinger, J.M.: Topics in Combinatorial Games. The University of Wisconsin-Madison (1996)"},{"issue":"46","key":"2_CR24","doi-asserted-by":"publisher","first-page":"6484","DOI":"10.1016\/j.tcs.2011.08.024","volume":"412","author":"FV Fomin","year":"2011","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D.: Guard games on graphs: keep the intruder out! Theoret. Comput. Sci. 412(46), 6484\u20136497 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR25","first-page":"475","volume":"42","author":"AS Fraenkel","year":"2002","unstructured":"Fraenkel, A.S.: Combinatorial games: selected bibliography with a succinct gourmet introduction. More Games Chance 42, 475\u2013535 (2002)","journal-title":"More Games Chance"},{"key":"2_CR26","first-page":"6","volume":"2","author":"PM Grundy","year":"1939","unstructured":"Grundy, P.M.: Mathematics and games. Eureka 2, 6\u20138 (1939)","journal-title":"Eureka"},{"issue":"21\u201323","key":"2_CR27","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.tcs.2008.12.053","volume":"410","author":"A Guignard","year":"2009","unstructured":"Guignard, A., Sopena, \u00c9.: Compound node-kayles on paths. Theoret. Comput. Sci. 410(21\u201323), 2033\u20132044 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2140\/pjm.1959.9.81","volume":"9","author":"O Hanner","year":"1959","unstructured":"Hanner, O.: Mean play of sums of positional games. Pac. J. Math. 9(1), 81\u201399 (1959)","journal-title":"Pac. J. Math."},{"key":"2_CR29","first-page":"A86","volume":"16","author":"MA Huggan","year":"2016","unstructured":"Huggan, M.A., Stevens, B.: Polynomial time graph families for arc kayles. Integers 16, A86 (2016)","journal-title":"Integers"},{"key":"2_CR30","unstructured":"Huggan, M.A.: Impartial intersection restriction games. Ph.D. thesis, Carleton University (2015)"},{"key":"2_CR31","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education India (2006)"},{"key":"2_CR32","unstructured":"Larsson, U., Nowakowski, R., Santos, C.P.: Scoring games: the state of play, games of no chance 5 (2017)"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Liang, Z., Khoussainov, B., Yang, H.: Topological network-control games. In: Wu, W., Tong, G. (eds.) International Computing and Combinatorics Conference, vol. 14423, pp. 144\u2013156. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-49193-1_11","DOI":"10.1007\/978-3-031-49193-1_11"},{"issue":"28","key":"2_CR34","first-page":"291","volume":"II","author":"J Milnor","year":"1953","unstructured":"Milnor, J.: Sums of positional games. Contrib. Theory Games II(28), 291\u2013301 (1953)","journal-title":"Contrib. Theory Games"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Siegel, A.N.: Combinatorial Game Theory, vol.\u00a0146. American Mathematical Soc. (2013)","DOI":"10.1090\/gsm\/146"},{"key":"2_CR36","first-page":"438","volume":"41","author":"R Sprague","year":"1935","unstructured":"Sprague, R.: \u00dcber mathematische kampfspiele. Tohoku Math. J. First Series 41, 438\u2013444 (1935)","journal-title":"Tohoku Math. J. First Series"},{"key":"2_CR37","unstructured":"Stewart, F.: Impartial scoring play games. arXiv preprint arXiv:1202.4655 (2012)"},{"key":"2_CR38","first-page":"447","volume":"5","author":"F Stewart","year":"2012","unstructured":"Stewart, F.: Scoring play combinatorial games. Games No Chance 5, 447\u2013467 (2012)","journal-title":"Games No Chance"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:36Z","timestamp":1739999916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}