{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:30:30Z","timestamp":1774333830748,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_21","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:02Z","timestamp":1770977222000},"page":"308-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Can One Flip Spoil it All?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5887-9230","authenticated-orcid":false,"given":"Pragya","family":"Arora","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0071-9464","authenticated-orcid":false,"given":"Palash","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1727-5388","authenticated-orcid":false,"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"3","key":"21_CR1","first-page":"890","volume":"38","author":"N Alon","year":"2009","unstructured":"Alon, N., Gutin, G., Kim, E.J., Kratsch, S., Yeo, A.: Solving max-at and max-cut in parameterized subexponential time. SIAM J. Comput. 38(3), 890\u2013905 (2009)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1006\/jagm.1997.0865","volume":"24","author":"R Balasubramanian","year":"1997","unstructured":"Balasubramanian, R., Raman, V., Srinivasaragavan, G.: Finding scores in tournaments. J. Algorithms 24(2), 380\u2013394 (1997)","journal-title":"J. Algorithms"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1137\/0403002","volume":"3","author":"A Bar-Noy","year":"1990","unstructured":"Bar-Noy, A., Naor, J.: Sorting, minimal feedback sets, and Hamilton paths in tournaments. SIAM J. Discret. Math. 3, 7\u201320 (1990)","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Brandt, F., Brill, M., Harrenstein, P.: The Computational Complexity of Choice Sets, vol.\u00a055. Elsevier (2010)","DOI":"10.1002\/malq.200810027"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer, V.: Eliciting single-peaked preferences using comparison queries. In: Proceedings of the 2009 ACM Conference on Electronic Commerce (EC) (2009)","DOI":"10.1613\/jair.2606"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Dey, P.: Query complexity of tournament solutions. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.10702"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC) (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"21_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114422","volume":"991","author":"A Maiti","year":"2024","unstructured":"Maiti, A., Dey, P.: Query complexity of tournament solutions. Theoret. Comput. Sci. 991, 114422 (2024)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"21_CR9","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ipl.2008.07.012","volume":"108","author":"AD Procaccia","year":"2008","unstructured":"Procaccia, A.D.: A note on the query complexity of the condorcet winner problem. Inf. Process. Lett. 108(6), 390\u2013393 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s003550200197","volume":"20","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Banks winners in tournaments are difficult to recognize. Soc. Choice Welfare 20(3), 523\u2013528 (2003)","journal-title":"Soc. Choice Welfare"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:09:34Z","timestamp":1774325374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}