| Dichotomy Results on the Hardness of -free Edge Modification Problems NR Aravind, RB Sandeep, N Sivadasan SIAM Journal on Discrete Mathematics 31 (1), 542-561, 2017 | 23 | 2017 |
| Minimum fill-in: Inapproximability and almost tight lower bounds Y Cao, RB Sandeep Information and Computation 271, 104514, 2020 | 22 | 2020 |
| Parameterized lower bound and improved kernel for diamond-free edge deletion RB Sandeep, N Sivadasan 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), 2015 | 21 | 2015 |
| Incompressibility of H-free edge modification problems: Towards a dichotomy D Marx, RB Sandeep Journal of Computer and System Sciences 125, 25-58, 2022 | 15 | 2022 |
| On Polynomial Kernelization of -free Edge Deletion NR Aravind, RB Sandeep, N Sivadasan Algorithmica 79 (3), 654-666, 2017 | 13 | 2017 |
| Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems NR Aravind, RB Sandeep, N Sivadasan LATIN 2016: Theoretical Informatics, 82-95, 2016 | 12 | 2016 |
| A polynomial kernel for diamond-free editing Y Cao, A Rai, RB Sandeep, J Ye Algorithmica, 1-19, 2018 | 9 | 2018 |
| Compressing bounded degree graphs PG Drange, M Dregi, RB Sandeep LATIN 2016: Theoretical Informatics, 362-375, 2016 | 8 | 2016 |
| Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems NR Aravind, RB Sandeep, N Sivadasan Combinatorial Optimization and Applications: 9th International Conference …, 2015 | 6 | 2015 |
| On subgraph complementation to H-free graphs D Antony, J Garchar, S Pal, RB Sandeep, S Sen, R Subashini Algorithmica 84 (10), 2842-2870, 2022 | 3 | 2022 |
| Perfectly colorable graphs RB Sandeep Information processing letters 111 (19), 960-961, 2011 | 3 | 2011 |
| A cubic vertex kernel for Diamond-free Edge Deletion and more RB Sandeep, N Sivadasan arXiv preprint arXiv:1507.08792, 2015 | 2 | 2015 |
| The chromatic discrepancy of graphs NR Aravind, S Kalyanasundaram, RB Sandeep, N Sivadasan Discrete Applied Mathematics 184, 40-49, 2015 | 2 | 2015 |
| Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity F Foucaud, PM Marcille, ZM Myint, RB Sandeep, S Sen, S Taruni Conference on Algorithms and Discrete Applied Mathematics, 29-43, 2024 | 1 | 2024 |
| Contracting edges to destroy a pattern: A complexity study D Chakraborty, RB Sandeep International Symposium on Fundamentals of Computation Theory, 118-131, 2023 | 1 | 2023 |
| On deeply critical oriented cliques C Duffy, PD Pavan, RB Sandeep, S Sen Journal of Graph Theory 104 (1), 150-159, 2023 | 1 | 2023 |
| Cutting a tree with subgraph complementation is hard, except for some small trees D Antony, S Pal, RB Sandeep, R Subashini Latin American Symposium on Theoretical Informatics, 3-19, 2022 | 1 | 2022 |
| Bounds and extremal graphs for monitoring edge-geodetic sets in graphs F Foucaud, PM Marcille, ZM Myint, RB Sandeep, S Sen, S Taruni arXiv preprint arXiv:2403.09122, 2024 | | 2024 |
| Switching Classes: Characterization and Computation D Antony, Y Cao, S Pal, RB Sandeep arXiv preprint arXiv:2403.04263, 2024 | | 2024 |
| Check for updates D Chakraborty¹, RB Sandeep Fundamentals of Computation Theory: 24th International Symposium, FCT 2023 …, 2023 | | 2023 |
Naveen SivadasanPrincipal Scientist, TCS ResearchVerified email at tcs.com
