{"version.version":"0.1.1","version.cm_url":"https://github.com/ceurws/ceur-spt","spt.html_url":"/Vol-4269/paper59.html","spt.description":null,"spt.id":"Vol-4269/paper59","spt.wikidataid":null,"spt.title":"Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms","spt.pdfUrl":"https://ceur-ws.org/Vol-4269/paper59.pdf","spt.volume":{"number":4269,"acronym":"ICTCS 2026","wikidataid":"Q141603341","title":"Proceedings of the 27th Italian Conference on Theoretical Computer Science","description":"Proceedings of ICTCS 2026 workshop","url":"https://ceur-ws.org/Vol-4269/","date":"2026-09-19","dblp":null,"k10plus":null,"urn":"urn:nbn:de:0074-4269-x"},"spt.session":null,"cvb.id":"Vol-4269/paper59","cvb.title":"Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms","cvb.type":null,"cvb.position":null,"cvb.pagesFrom":null,"cvb.pagesTo":null,"cvb.authors":"Ajinkya Gaikwad,Hitendra Kumar,Soumen Maity,S Padmapriya,Praneet Kumar Patra,Harsh Sanklecha","cvb.pages":"98–111","cvb.vol_number":"4269","cvb.pdf_name":"paper59.pdf","cvb.fail":null}