Hitendra Kumar

collaborators

4 papers

math.CO2026

Tight Upper Bounds on Color Reversal by Local Inversions

Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep

A bicoloration of a graph $G = (V, E)$ is a map $I^^{2} : V \to {- 1, 1}$ . A local inversion at a vertex $v$ complements the subgraph induced by the neighbors of $v$ and simultaneously revers…

cs.DS2025

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms

Ajinkya Gaikwad, Hitendra Kumar, S. Padmapriya +3

We study a family of graph modification problems called the F-Vertex Splitting problem. Given a graph G, the task is to determine whether G can be transformed into a graph G-prime…

cs.CC2025

MaxMin Separation Problems: FPT Algorithms for $s t$ -Separator and Odd Cycle Transversal

Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity +2

In this paper, we study the parameterized complexity of the MaxMin versions of two fundamental separation problems: Maximum Minimal $s t$ -Separator and Maximum Minimal Odd Cycle Tra…

cs.DS2025

Parameterized Algorithms for Editing to Uniform Cluster Graph

Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity

We study the parameterized complexity of transforming graphs into Uniform Cluster graphs, where each component is an equal-sized clique. We consider Uniform Cluster Vertex Deletion…

Tight Upper Bounds on Color Reversal by Local Inversions

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms

MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal

Parameterized Algorithms for Editing to Uniform Cluster Graph

MaxMin Separation Problems: FPT Algorithms for $s t$ -Separator and Odd Cycle Transversal