Perfectly colorable graphs. - R. B. Sandeep (Inf. Process. Lett., 2011)

On Polynomial Kernelization of H -free Edge Deletion. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (IPEC, 2014)

On Polynomial Kernelization of $ mathcal{H}$-free Edge Deletion. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (CoRR, 2014)

Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (COCOA, 2015)

Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. - R. B. Sandeep; Naveen Sivadasan (IPEC, 2015)

The chromatic discrepancy of graphs. - N. R. Aravind; Subrahmanyam Kalyanasundaram; R. B. Sandeep; Naveen Sivadasan (Discret. Appl. Math., 2015)

Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (LATIN, 2016)

Compressing Bounded Degree Graphs. - Pål Grønås Drange; Markus S. Dregi; R. B. Sandeep (LATIN, 2016)

On Polynomial Kernelization of H-free Edge Deletion. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (Algorithmica, 2017)

Dichotomy Results on the Hardness of H-free Edge Modification Problems. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (SIAM J. Discret. Math., 2017)

Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. - Dániel Marx; R. B. Sandeep (ESA, 2020)

Minimum fill-in: Inapproximability and almost tight lower bounds. - Yixin Cao 001; R. B. Sandeep (Inf. Comput., 2020)

On Subgraph Complementation to H-free Graphs. - Dhanyamol Antony; Jay Garchar; Sagartanu Pal; R. B. Sandeep; Sagnik Sen 001; R. Subashini (Algorithmica, 2022)

A Polynomial Kernel for Diamond-Free Editing. - Yixin Cao 001; Ashutosh Rai 001; R. B. Sandeep; Junjie Ye (Algorithmica, 2022)

Incompressibility of H-free edge modification problems: Towards a dichotomy. - Dániel Marx; R. B. Sandeep (J. Comput. Syst. Sci., 2022)

Contracting Edges to Destroy a Pattern: A Complexity Study. - Dipayan Chakraborty; R. B. Sandeep (FCT, 2023)

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. - Florent Foucaud; Pierre-Marie Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CALDAM, 2024)

Switching Classes: Characterization and Computation. - Dhanyamol Antony; Yixin Cao 001; Sagartanu Pal; R. B. Sandeep (MFCS, 2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Pierre-Marie Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CoRR, 2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Clara Marcille; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CoRR, 2024)

Erdős-Gyárfás conjecture on graphs without long induced paths. - Anand Shripad Hegde; R. B. Sandeep; P. Shashank (CoRR, 2024)

Cutting a tree with subgraph complementation is hard, except for some small trees. - Dhanyamol Antony; Sagartanu Pal; R. B. Sandeep; R. Subashini (J. Graph Theory, 2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Clara Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2025)

Algorithms for subgraph complementation to some classes of graphs. - Dhanyamol Antony; Sagartanu Pal; R. B. Sandeep (Inf. Process. Lett., 2025)