{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:40:53Z","timestamp":1762908053996,"version":"3.45.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031929342"},{"type":"electronic","value":"9783031929359"}],"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-3-031-92935-9_8","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:07:16Z","timestamp":1747454836000},"page":"121-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounded Degree QBF and\u00a0Positional Games"],"prefix":"10.1007","author":[{"given":"Nacim","family":"Oijid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bagan, G., Duch\u00eane, E., Gledel, V., Lehtil\u00e4, T., Parreau, A.: Partition strategies for the maker-breaker domination game (2024)","DOI":"10.2139\/ssrn.4503377"},{"key":"8_CR2","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":"8_CR3","unstructured":"Bonnet, E., Gaspers, S., Lambilliotte, A., R\u00fcmmele, S., Saffidine, A.: The parameterized complexity of positional games. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a080, pp. 90:1\u201390:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2017)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Byskov, J.M.: Maker-maker and maker-breaker games are pspace-complete. BRICS Rep. Ser. 11(14) (2004)","DOI":"10.7146\/brics.v11i14.21839"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing. STOC 1971, pp. 151\u2013158. Association for Computing Machinery, New York (1971)","DOI":"10.1145\/800157.805047"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/j.dam.2024.11.012","volume":"361","author":"E Duch\u00eane","year":"2025","unstructured":"Duch\u00eane, E., et al.: Complexity of maker-breaker games on edge sets of graphs. Discret. Appl. Math. 361, 502\u2013522 (2025)","journal-title":"Discret. Appl. Math."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Duch\u00eane, E., Gledel, V., Parreau, A., Renault, G.: Maker-Breaker domination game. Discrete Math. 343 (2020)","DOI":"10.1016\/j.disc.2020.111955"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-662-48971-0_58","volume-title":"Algorithms and Computation","author":"SA Fenner","year":"2015","unstructured":"Fenner, S.A., Grier, D., Messner, J., Schaeffer, L., Thierauf, T.: Game values and computational complexity: an analysis via black-white combinatorial games. In: Elbassioni, K., Makino, K. (eds.) Algorithms and Computation, pp. 689\u2013699. Springer, Heidelberg (2015)"},{"key":"8_CR9","unstructured":"Gledel, V., Oijid, N.: Avoidance games Are PSPACE-complete. In: Berenbrink, P., Bouyer, P., Dawar, A., Kant\u00e9, M.M. (eds.) 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0254, pp. 34:1\u201334:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2023)"},{"key":"8_CR10","unstructured":"Gledel, V., Oijid, N., Tavenas, S., Thomass\u00e9, S.: On the complexity of client-waiter and waiter-client games (2024). https:\/\/arxiv.org\/abs\/2407.06777"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1090\/S0002-9947-1963-0143712-1","volume":"106","author":"RI Hales","year":"1963","unstructured":"Hales, R.I., Jewett, A.W.: Regularity and positional games. Trans. Am. Math. Soc. 106, 222\u2013229 (1963)","journal-title":"Trans. Am. Math. Soc."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity Comput. Comput. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"8_CR13","unstructured":"Oijid, N.: Complexity of positional games on graphs. Ph.D. thesis, Universit\u00e9 Claude Bernard, Lyon 1 (2024), th\u00e8se de doctorat dirig\u00e9e par Duch\u00eane, Eric et Parreau, Aline"},{"key":"8_CR14","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"8_CR15","unstructured":"Rahman, M.L., Watson, T.: 6-uniform maker-breaker game is pspace-complete. In: Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS) (2021)"},{"key":"8_CR16","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, 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Slany, W.: The complexity of graph ramsey games. In: Computers and Games (2000)","DOI":"10.1007\/3-540-45579-5_12"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp.\u00a01\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified np-complete satisfiability problem. Discret. Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92935-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:37:27Z","timestamp":1762907847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92935-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929342","9783031929359"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92935-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}