{"labels":{"en":"Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms"},"descriptions":{"en":"scientific paper published in CEUR-WS Volume 4269"},"claims":{"P31":"Q13442814","P1433":"Q141603341","P1476":{"text":"Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms","language":"en"},"P407":"Q1860","P953":"https://ceur-ws.org/Vol-4269/paper59.pdf","P50":[],"P2093":[{"value":"Ajinkya Gaikwad","qualifiers":{"P1545":"1"}},{"value":"Hitendra Kumar","qualifiers":{"P1545":"2"}},{"value":"Soumen Maity","qualifiers":{"P1545":"3"}},{"value":"S Padmapriya","qualifiers":{"P1545":"4"}},{"value":"Praneet Kumar Patra","qualifiers":{"P1545":"5"}},{"value":"Harsh Sanklecha","qualifiers":{"P1545":"6"}}]}}