{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:41Z","timestamp":1771036361718,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T00:00:00Z","timestamp":1651881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T00:00:00Z","timestamp":1651881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"european research council","doi-asserted-by":"publisher","award":["725978"],"award-info":[{"award-number":["725978"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"agence national de la recherche","award":["ANR-15-IDEX-01"],"award-info":[{"award-number":["ANR-15-IDEX-01"]}]},{"name":"stic-amsud"},{"name":"phc xu guangqi"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s00453-022-00973-5","type":"journal-article","created":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T07:03:40Z","timestamp":1651907020000},"page":"2533-2555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The Largest Connected Subgraph Game"],"prefix":"10.1007","volume":"84","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[]},{"given":"Foivos","family":"Fioravantes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5634-9506","authenticated-orcid":false,"given":"Fionn","family":"Mc Inerney","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,7]]},"reference":[{"key":"973_CR1","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.tcs.2019.07.014","volume":"795","author":"SD Andres","year":"2019","unstructured":"Andres, S.D., Huggan, M., Mc Inerney, F., Nowakowski, R.J.: The orthogonal colouring game. Theor. Comput. Sci. 795, 312\u2013325 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"973_CR2","doi-asserted-by":"crossref","unstructured":"Bensmail, J., Fioravantes, F., Mc\u00a0Inerney, F., Nisse, N.: The largest connected subgraph game. In: Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021), Lecture Notes in Computer Science, vol. 12911, pp. 296\u2013307. Springer (2021)","DOI":"10.1007\/978-3-030-86838-3_23"},{"key":"973_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2016.06.033","volume":"644","author":"E Bonnet","year":"2016","unstructured":"Bonnet, E., Jamain, F., Saffidine, A.: On the complexity of connection games. Theor. Comput. Sci. 644, 2\u201328 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"973_CR4","volume-title":"Connection Games: Variations on a Theme","author":"C Browne","year":"2005","unstructured":"Browne, C.: Connection Games: Variations on a Theme. AK Peters, Natick (2005)"},{"issue":"1","key":"973_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TCT.1970.1083056","volume":"17","author":"J Bruno","year":"1970","unstructured":"Bruno, J., Weinberg, L.: A constructive graph-theoretic solution of the Shannon switching game. IEEE Trans. Circuit Theory 17(1), 74\u201381 (1970)","journal-title":"IEEE Trans. Circuit Theory"},{"key":"973_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.disopt.2015.05.002","volume":"17","author":"M Changat","year":"2015","unstructured":"Changat, M., Lekha, D.S., Peterin, I., Subhamathi, A.R., Spacapan, S.: The median game. Discrete Optim. 17, 80\u201388 (2015)","journal-title":"Discrete Optim."},{"issue":"4","key":"973_CR7","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"973_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2021.05.028","volume":"878\u2013879","author":"E Duch\u00eane","year":"2021","unstructured":"Duch\u00eane, E., Gonzalez, S., Parreau, A., R\u00e9mila, E., Solal, P.: INFLUENCE: a Partizan scoring game on graphs. Theor. Comput. Sci. 878\u2013879, 26\u201346 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"973_CR9","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1145\/321978.321989","volume":"23","author":"S Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: A combinatorial problem which is complete in polynomial space. J. ACM JACM 23(4), 710\u2013719 (1976)","journal-title":"J. ACM JACM"},{"key":"973_CR10","volume-title":"The Scientific American Book of Mathematical Puzzles & Diversions","author":"M Gardner","year":"1959","unstructured":"Gardner, M.: The Scientific American Book of Mathematical Puzzles & Diversions. Simon and Schuster, New York (1959)"},{"key":"973_CR11","volume-title":"The Second Scientific American Book of Mathematical Puzzles and Diversions","author":"M Gardner","year":"1961","unstructured":"Gardner, M.: The Second Scientific American Book of Mathematical Puzzles and Diversions. Simon and Schuster, New York (1961)"},{"issue":"3","key":"973_CR12","doi-asserted-by":"publisher","first-page":"P3.27","DOI":"10.37236\/5417","volume":"23","author":"U Larsson","year":"2016","unstructured":"Larsson, U., Nowakowski, R.J., Neto, J.P., Santos, C.P.: Guaranteed scoring games. Electron. J. Combin. 23(3), P3.27 (2016)","journal-title":"Electron. J. Combin."},{"key":"973_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tcs.2017.11.029","volume":"725","author":"U Larsson","year":"2018","unstructured":"Larsson, U., Nowakowski, R.J., Santos, C.P.: Game comparison through play. Theor. Comput. Sci. 725, 52\u201363 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"973_CR14","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s00182-017-0590-x","volume":"47","author":"U Larsson","year":"2018","unstructured":"Larsson, U., Nowakowski, R.J., Santos, C.P.: Games with guaranteed scores and waiting moves. Int. J. Game Theory 47(2), 653\u2013671 (2018)","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"973_CR15","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1017\/S0963548311000071","volume":"20","author":"P Micek","year":"2011","unstructured":"Micek, P., Walczak, B.: A graph-grabbing game. Combin. Probab. Comput. 20(4), 623\u2013629 (2011)","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"973_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00288964","volume":"15","author":"S Reisch","year":"1981","unstructured":"Reisch, S.: Hex ist PSPACE-vollst\u00e4ndig. Acta Inf. 15(2), 167\u2013191 (1981)","journal-title":"Acta Inf."},{"issue":"2","key":"973_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"TJ Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16(2), 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"15","key":"973_CR18","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1016\/j.dam.2011.03.002","volume":"159","author":"A Shapovalov","year":"2011","unstructured":"Shapovalov, A.: Occupation games on graphs in which the second player takes almost all vertices. Discrete Appl. Math. 159(15), 1526\u20131527 (2011)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00973-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00973-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00973-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T14:15:51Z","timestamp":1660313751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00973-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,7]]},"references-count":18,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["973"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00973-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,7]]},"assertion":[{"value":"10 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}