| 2026 | IWOCA | Parameterized Algorithms for k-Inversion. | Dhanyamol Antony, L. Sunil Chandran, Dalu Jacob, R. B. Sandeep |
| 2026 | IWOCA | Tight Upper Bounds on Color Reversal by Local Inversions. | Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep |
| 2024 | MFCS | Switching Classes: Characterization and Computation. | Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep |
| 2023 | FCT | Contracting Edges to Destroy a Pattern: A Complexity Study. | Dipayan Chakraborty, R. B. Sandeep |
| 2022 | LATIN | Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. | Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini |
| 2021 | WG | On Subgraph Complementation to H-free Graphs. | Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini |
| 2020 | ESA | Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. | Dniel Marx, R. B. Sandeep |
| 2018 | ESA | A Polynomial Kernel for Diamond-Free Editing. | Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye |
| 2017 | SODA | Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. | Yixin Cao, R. B. Sandeep |
| 2016 | LATIN | Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. | N. R. Aravind, R. B. Sandeep, Naveen Sivadasan |
| 2016 | LATIN | Compressing Bounded Degree Graphs. | Pl Grns Drange, Markus S. Dregi, R. B. Sandeep |
| 2015 | COCOA | Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. | N. R. Aravind, R. B. Sandeep, Naveen Sivadasan |