{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:04Z","timestamp":1780783144536,"version":"3.54.1"},"publisher-location":"Cham","reference-count":21,"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_28","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:14Z","timestamp":1780780454000},"page":"400-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Upper Bounds on\u00a0Color Reversal by\u00a0Local Inversions"],"prefix":"10.1007","author":[{"given":"Hitendra","family":"Kumar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5392-3384","authenticated-orcid":false,"given":"Kumud","family":"Singh Porte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4383-1819","authenticated-orcid":false,"given":"R. B.","family":"Sandeep","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","unstructured":"Adcock, J.C., Morley-Short, S., Dahlberg, A., Silverstone, J.W.: Mapping graph state orbits under local complementation. Quantum 4, 305 (2020). https:\/\/doi.org\/10.22331\/q-2020-08-07-305","DOI":"10.22331\/q-2020-08-07-305"},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.4230\/DAGREP.4.2.38","volume":"4","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Heggernes, P., Lokshtanov, D.: Graph modification problems (DAGSTUHL seminar 14071). DAGSTUHL Reports 4(2), 38\u201359 (2014). https:\/\/doi.org\/10.4230\/DAGREP.4.2.38","journal-title":"DAGSTUHL Reports"},{"issue":"8","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1016\/j.ejc.2011.03.002","volume":"32","author":"R Brijder","year":"2011","unstructured":"Brijder, R., Hoogeboom, H.J.: The group structure of pivot and loop complementation on graphs and set systems. Eur. J. Combin. 32(8), 1353\u20131367 (2011). https:\/\/doi.org\/10.1016\/j.ejc.2011.03.002","journal-title":"Eur. J. Combin."},{"issue":"7","key":"28_CR4","doi-asserted-by":"publisher","DOI":"10.1063\/1.4813438","volume":"54","author":"A Cabello","year":"2013","unstructured":"Cabello, A., Parker, M.G., Scarpa, G., Severini, S.: Exclusivity structures and graph representatives of local complementation orbits. J. Math. Phys. 54(7), 072202 (2013). https:\/\/doi.org\/10.1063\/1.4813438","journal-title":"J. Math. Phys."},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00050-6","journal-title":"Inf. Process. Lett."},{"key":"28_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2023.100556","volume":"48","author":"C Crespelle","year":"2023","unstructured":"Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.A.: A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48, 100556 (2023). https:\/\/doi.org\/10.1016\/j.cosrev.2023.100556","journal-title":"Comput. Sci. Rev."},{"issue":"1\u20133","key":"28_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10623-008-9190-x","volume":"49","author":"LE Danielsen","year":"2008","unstructured":"Danielsen, L.E., Parker, M.G.: Edge local complementation and equivalence of binary linear codes. Des. Codes Cryptogr. 49(1\u20133), 161\u2013170 (2008). https:\/\/doi.org\/10.1007\/s10623-008-9190-x","journal-title":"Des. Codes Cryptogr."},{"issue":"1\u20133","key":"28_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.disc.2003.04.001","volume":"278","author":"A Ehrenfeucht","year":"2004","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: Transitivity of local complementation and switching on graphs. Discrete Math. 278(1\u20133), 45\u201360 (2004). https:\/\/doi.org\/10.1016\/j.disc.2003.04.001","journal-title":"Discrete Math."},{"key":"28_CR9","doi-asserted-by":"publisher","unstructured":"Hahn, F., Pappa, A., Eisert, J.: Quantum network routing and local complementation. npj Quantum Inf. 5(1), 1\u20137 (2019). https:\/\/doi.org\/10.1038\/s41534-019-0191-6","DOI":"10.1038\/s41534-019-0191-6"},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F Harary","year":"1953","unstructured":"Harary, F.: On the notion of balance of a signed graph. Michigan Math. J. 2(2), 143\u2013146 (1953). https:\/\/doi.org\/10.1307\/mmj\/1028989917","journal-title":"Michigan Math. J."},{"key":"28_CR11","doi-asserted-by":"publisher","unstructured":"Javelle, J., Mhalla, M., Perdrix, S.: On the minimum degree up to local complementation: bounds and complexity. In: Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 7551, pp. 138\u2013147. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-34611-8_16","DOI":"10.1007\/978-3-642-34611-8_16"},{"issue":"6","key":"28_CR12","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/6\/063025","volume":"13","author":"J Joo","year":"2011","unstructured":"Joo, J., Feder, D.L.: Edge local complementation for logical cluster states. New J. Phys. 13(6), 063025 (2011). https:\/\/doi.org\/10.1088\/1367-2630\/13\/6\/063025","journal-title":"New J. Phys."},{"key":"28_CR13","doi-asserted-by":"publisher","unstructured":"Kim, D., il Oum, S.: Vertex-minors of graphs: a survey. Discrete Appl. Math. 351, 54\u201373 (2024). https:\/\/doi.org\/10.1016\/j.dam.2024.03.011, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X24001136","DOI":"10.1016\/j.dam.2024.03.011"},{"key":"28_CR14","doi-asserted-by":"publisher","unstructured":"il Oum, S.: Rank-width and vertex-minors. J. Comb. Theory Ser. B 95(1), 79\u2013100 (2005). https:\/\/doi.org\/10.1016\/J.JCTB.2005.03.003","DOI":"10.1016\/J.JCTB.2005.03.003"},{"key":"28_CR15","unstructured":"Porte, K.S., Sandeep, R.B., Santra, K.: Improved upper bounds on color reversal by local inversions (2025). https:\/\/arxiv.org\/abs\/2510.00149"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(87)90240-8","volume":"64","author":"G Sabidussi","year":"1987","unstructured":"Sabidussi, G.: Color-reversal by local complementation. Discrete Math. 64(1), 81\u201386 (1987). https:\/\/doi.org\/10.1016\/0012-365X(87)90240-8","journal-title":"Discrete Math."},{"key":"28_CR17","doi-asserted-by":"publisher","unstructured":"Seidel, J.J.: A survey of two-graphs. In: Geometry and Combinatorics: Selected Works of J. J. Seidel, pp. 146\u2013176. Academic Press (1991). https:\/\/doi.org\/10.1016\/B978-0-12-189420-7.50018-9","DOI":"10.1016\/B978-0-12-189420-7.50018-9"},{"issue":"5","key":"28_CR18","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1016\/j.laa.2011.06.048","volume":"436","author":"L Traldi","year":"2012","unstructured":"Traldi, L.: On the linear algebra of local complementation. Linear Algebra Appl. 436(5), 1072\u20131089 (2012). https:\/\/doi.org\/10.1016\/j.laa.2011.06.048","journal-title":"Linear Algebra Appl."},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ejc.2014.10.001","volume":"45","author":"L Traldi","year":"2015","unstructured":"Traldi, L.: Binary matroids and local complementation. Eur. J. Combin. 45, 21\u201340 (2015). https:\/\/doi.org\/10.1016\/j.ejc.2014.10.001","journal-title":"Eur. J. Combin."},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graphs. Discrete Appl. Math. 4(1), 47\u201374 (1982). https:\/\/doi.org\/10.1016\/0166-218X(82)90033-6","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.78.034301","volume":"78","author":"J Zhang","year":"2008","unstructured":"Zhang, J.: Local complementation rule for continuous-variable four-mode unweighted graph states. Phys. Rev. A 78(3), 034301 (2008). https:\/\/doi.org\/10.1103\/PhysRevA.78.034301","journal-title":"Phys. Rev. A"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:20Z","timestamp":1780780460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_28","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"}}]}}