{"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":1780783141483,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"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_25","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:21Z","timestamp":1780780521000},"page":"356-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0$$(\\le p)$$-Inversion Diameter of\u00a0Oriented Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3447-8112","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0706-3477","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Rambaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4661-2822","authenticated-orcid":false,"given":"Caroline","family":"Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM J. Discret. Math. 20(1), 137\u2013142 (2006). https:\/\/doi.org\/10.1137\/050623905","journal-title":"SIAM J. Discret. Math."},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Alon, N., Powierski, E., Savery, M., Scott, A., Wilmer, E.: Invertibility of digraphs and tournaments. SIAM J. Discrete Math. 38(1), 327\u2013347 (2024). https:\/\/doi.org\/10.1137\/23M1547135, arXiv:2212.11969","DOI":"10.1137\/23M1547135"},{"key":"25_CR3","unstructured":"Arana, C., Bellitto, T., Buffi\u00e8re, H., Chuet, Q., Pierron, T., Reinald, A.: Inversion diameter and 2-edge-colored homomorphisms (2026). https:\/\/arxiv.org\/abs\/2602.24171"},{"key":"25_CR4","doi-asserted-by":"publisher","unstructured":"Aubian, G., et al.: Problems, proofs, and disproofs on the inversion number. arXiv preprint (2022). https:\/\/doi.org\/10.48550\/ARXIV.2212.09188, https:\/\/arxiv.org\/abs\/2212.09188, arXiv:2212.09188","DOI":"10.48550\/ARXIV.2212.09188"},{"key":"25_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications. Springer-Verlag, London (2009)"},{"key":"25_CR6","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:\/\/arxiv.org\/pdf\/2511.22562, arXiv:2511.22562"},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Bang-Jensen, J., da\u00a0Silva, J.C.F., Havet, F.: On the inversion number of oriented graphs. Discrete Math. Theoret. Comput. Sci. 23(2) (2021). https:\/\/doi.org\/10.46298\/DMTCS.7474, https:\/\/doi.org\/10.46298\/dmtcs.7474, arXiv:2105.04137","DOI":"10.46298\/DMTCS.7474"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Belkhechine, H., Bouaziz, M., Boudabbous, I., Pouzet, M.: Inversion dans les tournois. Comptes Rendus Math\u00e9matique 348(13-14), 703\u2013707 (2010). arXiv:1007.2103","DOI":"10.1016\/j.crma.2010.06.022"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.jctb.2022.01.009","volume":"155","author":"M Bonamy","year":"2022","unstructured":"Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: Bounds and applications. J. Comb. Theory Ser. B 155, 278\u2013317 (2022)","journal-title":"J. Comb. Theory Ser. B"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Charbit, P., Thomass\u00e9, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Comb. Probab. Comput. 16(1), 1\u20134 (2007). https:\/\/doi.org\/10.1017\/S0963548306007887, https:\/\/doi.org\/10.1017\/S0963548306007887","DOI":"10.1017\/S0963548306007887"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Duron, J., Havet, F., H\u00f6rsch, F., Rambaud, C.: On the minimum number of inversions to make a digraph $$k$$-(arc-)strong. arXiv preprint, arXiv:2303.11719 (2023)","DOI":"10.5817\/CZ.MUNI.EUROCOMB23-054"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Fernandez de la Vega, W.: On the maximum cardinality of a consistent set of arcs in a random tournament. J. Comb. Theory Ser. B 35(3), 328\u2013332 (1983). https:\/\/doi.org\/10.1016\/0095-8956(83)90060-6, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0095895683900606","DOI":"10.1016\/0095-8956(83)90060-6"},{"key":"25_CR13","unstructured":"Havet, F., H\u00f6rsch, F., Rambaud, C.: Diameter of the inversion graph. arXiv preprint (2024). https:\/\/arxiv.org\/abs\/2405.04119, arXiv:2405.04119"},{"key":"25_CR14","unstructured":"Havet, F., Rambaud, C., Silva, C.: On the $$(\\le p)$$-inversion diameter of oriented graphs (2026), https:\/\/arxiv.org\/abs\/2604.04633, arXiv:2604.04633"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Hurley, E., de\u00a0Joannis\u00a0de Verclos, R., Kang, R.J.: An improved procedure for colouring graphs of bounded local density. Adv. Comb. (2022). https:\/\/doi.org\/10.19086\/aic.2022.7","DOI":"10.19086\/aic.2022.7"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems, p. 85\u2013103. Springer US (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"76","DOI":"10.21136\/CPM.1957.117236","volume":"82","author":"A Kotzig","year":"1957","unstructured":"Kotzig, A.: From the theory of finite regular graphs of degree three and four. \u010casopis Pestov. Mat 82, 76\u201392 (1957)","journal-title":"\u010casopis Pestov. Mat"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"K\u00f3vari, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of K. Zarankiewicz. Colloquium Mathematicum 3(1), 50\u201357 (1954). https:\/\/doi.org\/10.4064\/cm-3-1-50-57","DOI":"10.4064\/cm-3-1-50-57"},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M Molloy","year":"1997","unstructured":"Molloy, M., Reed, B.: A bound on the strong chromatic index of a graph. J. Comb. Theory Ser. B 69(2), 103\u2013109 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"25_CR20","doi-asserted-by":"publisher","unstructured":"Spencer, J.: Optimal ranking of tournaments. Networks 1(2), 135\u2013138 (1971). https:\/\/doi.org\/10.1002\/net.3230010204, https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/net.3230010204","DOI":"10.1002\/net.3230010204"},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Spencer, J.: Optimally ranking unrankable tournaments. Periodica Mathematica Hungarica 11(2), 131\u2013144 (1980). https:\/\/doi.org\/10.1007\/bf02017965","DOI":"10.1007\/bf02017965"},{"key":"25_CR22","unstructured":"Wang, Y., Wang, H., Yang, Y., Lu, M.: Inversion diameter and treewidth (2025). https:\/\/arxiv.org\/abs\/2407.15384"},{"key":"25_CR23","doi-asserted-by":"publisher","unstructured":"Yuster, R.: On tournament inversion. J. Graph Theory 110(1), 82\u201391 (2025). https:\/\/doi.org\/10.1002\/jgt.23251, arXiv:2312.01910","DOI":"10.1002\/jgt.23251"}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:23Z","timestamp":1780780523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_25","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"}}]}}