{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:01Z","timestamp":1780783141486,"version":"3.54.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","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-3-032-27732-9_5","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:15Z","timestamp":1780780515000},"page":"60-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Algorithms for\u00a0k-Inversion"],"prefix":"10.1007","author":[{"given":"Dhanyamol","family":"Antony","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Sunil Chandran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dalu","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R. B.","family":"Sandeep","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/23M1547135","volume":"38","author":"N Alon","year":"2024","unstructured":"Alon, N., Powierski, E., Savery, M., Scott, A.D., Wilmer, E.: Invertibility of digraphs and tournaments. SIAM J. Discret. Math. 38(1), 327\u2013347 (2024). https:\/\/doi.org\/10.1137\/23M1547135","journal-title":"SIAM J. Discret. Math."},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Aubian, G., et al.: Problems, proofs, and disproofs on the inversion number. Electron. J. Comb. 32(1) (2025). https:\/\/doi.org\/10.37236\/12983","DOI":"10.37236\/12983"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Bang-Jensen, J., Havet, F., H\u00f6rsch, F., Rambaud, C., Reinald, A., Silva, C.: Making an oriented graph acyclic using inversions of bounded or prescribed size. arXiv preprint arXiv:2511.22562 (2025). https:\/\/doi.org\/10.48550\/arXiv.2511.22562","DOI":"10.48550\/arXiv.2511.22562"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Bang-Jensen, J., da\u00a0Silva, J.C.F., Havet, F.: On the inversion number of oriented graphs. Discret. Math. Theor. Comput. Sci. 23(2) (2021). https:\/\/doi.org\/10.46298\/DMTCS.7474","DOI":"10.46298\/DMTCS.7474"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Behague, N., Gaudart-Wifling, P.: A case of the dijoin conjecture on inverting oriented graphs. arXiv preprint arXiv:2509.10232 (2025). https:\/\/doi.org\/10.48550\/arXiv.2509.10232","DOI":"10.48550\/arXiv.2509.10232"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Behague, N., Johnston, T., Morrison, N., Ogden, S.: A note on inverting the dijoin of oriented graphs. Electron. J. Comb. 32(1) (2025). https:\/\/doi.org\/10.37236\/13018","DOI":"10.37236\/13018"},{"issue":"13\u201314","key":"5_CR7","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.crma.2010.06.022","volume":"348","author":"H Belkhechine","year":"2010","unstructured":"Belkhechine, H., Bouaziz, M., Boudabbous, I., Pouzet, M.: Inversion dans les tournois. Comptes Rendus. Math\u00e9matique 348(13\u201314), 703\u2013707 (2010)","journal-title":"Comptes Rendus. Math\u00e9matique"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/S00373-021-02282-0","volume":"37","author":"H Belkhechine","year":"2021","unstructured":"Belkhechine, H., Salha, C.B.: Making a tournament indecomposable by one subtournament-reversal operation. Graphs Comb. 37(3), 823\u2013838 (2021). https:\/\/doi.org\/10.1007\/S00373-021-02282-0","journal-title":"Graphs Comb."},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/jgt.23290","volume":"111","author":"J Duron","year":"2026","unstructured":"Duron, J., Havet, F., H\u00f6rsch, F., Rambaud, C.: On the minimum number of inversions to make a digraph k-(Arc-) strong. J. Graph Theory 111(2), 31\u201362 (2026). https:\/\/doi.org\/10.1002\/jgt.23290","journal-title":"J. Graph Theory"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Havet, F., H\u00f6rsch, F., Rambaud, C.: Diameter of the inversion graph. arXiv preprint arXiv:2405.04119 (2024). https:\/\/doi.org\/10.48550\/arXiv.2405.04119","DOI":"10.48550\/arXiv.2405.04119"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Korhonen, T.: A single-exponential time 2-approximation algorithm for treewidth. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, 7\u201310 February 2022, pp. 184\u2013192. IEEE (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00026","DOI":"10.1109\/FOCS52979.2021.00026"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Wang, H., Yang, Y., Lu, M.: The inversion number of dijoins and blow-up digraphs. arXiv preprint arXiv:2404.14937 (2024). https:\/\/doi.org\/10.48550\/arXiv.2404.14937","DOI":"10.48550\/arXiv.2404.14937"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1002\/JGT.23251","volume":"110","author":"R Yuster","year":"2025","unstructured":"Yuster, R.: On tournament inversion. J. Graph Theory 110(1), 82\u201391 (2025). https:\/\/doi.org\/10.1002\/JGT.23251","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:16Z","timestamp":1780780516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_5","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":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}