{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:13Z","timestamp":1759637773180,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_23","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"296-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Largest Connected Subgraph Game"],"prefix":"10.1007","author":[{"given":"Julien","family":"Bensmail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Foivos","family":"Fioravantes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fionn","family":"Mc Inerney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"23_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. Theoret. Comput. Sci. 795, 312\u2013325 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bensmail, J., Fioravantes, F., Mc Inerney, F., Nisse, N.: The largest connected subgraph game. Research report (2021). https:\/\/hal.inria.fr\/hal-03137305","DOI":"10.1007\/978-3-030-86838-3_23"},{"key":"23_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. Theoret. Comput. Sci. 644, 2\u201328 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR4","unstructured":"Browne, C.: Connection Games: Variations on a Theme. AK Peters (2005)"},{"issue":"1","key":"23_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"},{"issue":"4","key":"23_CR6","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":"23_CR7","unstructured":"Duch\u00eane, \u00c9., Gonzalez, S., Parreau, A., R\u00e9mila, E., Solal, P.: INFLUENCE: a partizan scoring game on graphs. CoRR abs\/2005.12818 (2020)"},{"issue":"4","key":"23_CR8","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 23(4), 710\u2013719 (1976)","journal-title":"J. ACM"},{"key":"23_CR9","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":"23_CR10","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)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Larsson, U., Nowakowski, R.J., Neto, J.P., Santos, C.P.: Guaranteed scoring games. Electron. J. Comb. 23(3) (2016)","DOI":"10.37236\/5417"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s00182-017-0590-x","volume":"47","author":"U Larsson","year":"2017","unstructured":"Larsson, U., Nowakowski, R.J., Santos, C.P.: Games with guaranteed scores and waiting moves. Int. J. Game Theory 47(2), 653\u2013671 (2017). https:\/\/doi.org\/10.1007\/s00182-017-0590-x","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"23_CR13","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. Comb. Probab. Comput. 20(4), 623\u2013629 (2011)","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"23_CR14","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 Informatica 15(2), 167\u2013191 (1981)","journal-title":"Acta Informatica"},{"issue":"2","key":"23_CR15","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":"23_CR16","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":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:03:12Z","timestamp":1702065792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}