{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:02Z","timestamp":1780783142206,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"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_1","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:13:38Z","timestamp":1780780418000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Complexity of\u00a0Vertex-Splitting into an\u00a0Interval Graph"],"prefix":"10.1007","author":[{"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dipayan","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lucas","family":"Isenmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nacim","family":"Oijid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"1_CR1","unstructured":"Abu-Khzam, F.N., Chakraborty, D., Isenmann, L., Oijid, N.: On the complexity of vertex-splitting into an interval graph (2026)"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Abu-Khzam, F.N., Davot, T., Isenmann, L., Thoumi, S.: On the complexity of 2-club cluster editing with vertex splitting. In: Fomin, F.V., Xiao, M. (eds.) International Computing and Combinatorics Conference, pp. 3\u201314. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-981-95-0218-9_1","DOI":"10.1007\/978-981-95-0218-9_1"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-96151-4_1","volume-title":"Combinatorial Optimization","author":"FN Abu-Khzam","year":"2018","unstructured":"Abu-Khzam, F.N., Egan, J., Gaspers, S., Shaw, A., Shaw, P.: Cluster Editing with Vertex Splitting. In: Lee, J., Rinaldi, G., Mahjoub, A.R. (eds.) ISCO 2018. LNCS, vol. 10856, pp. 1\u201313. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96151-4_1"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Isenmann, L., Merchad, Z.: Bicluster editing with overlaps: a vertex splitting approach. In: Fernau, H., Zhu, B., (eds.) Combinatorial Algorithms - 36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21\u201324, 2025, Proceedings, vol. 15885 of Lecture Notes in Computer Science, pp. 146\u2013159. Springer, Cham(2025)","DOI":"10.1007\/978-3-031-98740-3_11"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Acad. Sci. 45(11), 1607\u20131620 (1959). Introduced interval graphs in genetics","DOI":"10.1073\/pnas.45.11.1607"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s11083-017-9445-0","volume":"35","author":"DE Brown","year":"2018","unstructured":"Brown, D.E., Flesch, B., Langley, L.J.: Interval k-graphs and orders. Order 35(3), 495\u2013514 (2018)","journal-title":"Order"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comp. 85(1), 12\u201375 (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abh. Math. Semin. Univ. Hambg. 25, 71\u201376 (1961)","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/s00453-017-0328-y","volume":"80","author":"D Eppstein","year":"2018","unstructured":"Eppstein, D., et al.: On the planar split thickness of graphs. Algorithmica 80(3), 977\u2013994 (2018)","journal-title":"Algorithmica"},{"key":"1_CR11","unstructured":"Firbas, A.: Establishing hereditary graph properties via vertex splitting, Technische Universit\u00e4t Wien, PhD thesis (2023)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.dam.2025.01.012","volume":"365","author":"A Firbas","year":"2025","unstructured":"Firbas, A., et al.: The complexity of cluster vertex splitting and company. Discret. Appl. Math. 365, 190\u2013207 (2025)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is np-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: See Chapter 5 for interval graphs and scheduling applications. Algorithmic graph theory and perfect graphs, Academic Press (1980)","DOI":"10.1016\/B978-0-12-289260-8.50015-7"},{"issue":"10","key":"1_CR15","first-page":"1675","volume":"31","author":"S Iwata","year":"2004","unstructured":"Iwata, S., Yamada, T.: Interval graph-based formulation for a scheduling problem with resource constraints and deadlines. Comput. Oper. Res. 31(10), 1675\u20131687 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is np-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discret. Appl. Math. 113(1), 109\u2013128 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1_CR18","first-page":"333","volume":"16","author":"M N\u00f6llenburg","year":"2025","unstructured":"N\u00f6llenburg, M., Sorge, M., Terziadis, S., Villedieu, A., Wu, H.-Y., Wulms, J.: Planarizing graphs and their drawings by vertex splitting. J. Comput. Geometry 16(1), 333\u2013372 (2025)","journal-title":"J. Comput. Geometry"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/jgt.3190030302","volume":"3","author":"WT Trotter Jr","year":"1979","unstructured":"Trotter, W.T., Jr., Harary, F.: On double and multiple interval graphs. J. Graph Theory 3(3), 205\u2013211 (1979)","journal-title":"J. Graph Theory"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0012-365X(74)80027-0","volume":"7","author":"AC Tucker","year":"1974","unstructured":"Tucker, A.C.: Structure theorems for some circular-arc graphs. Discret. Math. 7(2), 167\u2013195 (1974)","journal-title":"Discret. Math."},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-16926-7_22","volume-title":"Graph Theoretic Concepts in Computer Science","author":"R van Bevern","year":"2010","unstructured":"van Bevern, R., Komusiewicz, C., Moser, H., Niedermeier, R.: Measuring Indifference: Unit Interval Vertex Deletion. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 232\u2013243. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_22"},{"key":"1_CR22","unstructured":"Wegner, G.: Eigenschaften der Nerven homologisch-einfacher Familien im Rn (1967)"},{"key":"1_CR23","unstructured":"Whiteley, W.: Vertex splitting in isostatic frameworks. Structutal Topology, 1990, n\u00fam. (1990)"},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/jgt.10040","volume":"40","author":"CQ Zhang","year":"2002","unstructured":"Zhang, C.Q.: Circular flows of nearly Eulerian graphs and vertex-splitting. J. Graph Theory 40(3), 147\u2013161 (2002)","journal-title":"J. Graph Theory"},{"key":"1_CR25","unstructured":"Zhang, J., Pevzner, P.A.: Using interval graphs for genome mapping and rearrangement. Proc. Nat. Acad. Sci. 102, 17373\u201317378 (2005)"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:13:41Z","timestamp":1780780421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_1","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"}}]}}