Minimum fill-in: Inapproximability and almost tight lower bounds Y Cao, RB Sandeep
Information and Computation 271, 104514, 2020
28 2020 The prevalence of musculoskeletal disorders and their association with risk factors in auto rickshaw drivers-a survey in Guntur city R Shaik, CK Gotru, CG Swamy, R Sandeep
Int J Physiother 1 (1), 2-9, 2014
24 2014 Dichotomy Results on the Hardness of NR Aravind, RB Sandeep, N Sivadasan
SIAM Journal on Discrete Mathematics 31 (1), 542-561, 2017
23 2017 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
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
18 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
11 2018 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
10 2024 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 deeply critical oriented cliques C Duffy, PD Pavan, RB Sandeep, S Sen
Journal of Graph Theory 104 (1), 150-159, 2023
4 2023 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
4 2022 Phytochemical and pharmacological aspects of genus Amaranthus SM Pal, G Bharat, K Rakesh, R Sandeep
Fitoterapia, 106036, 2024
3 2024 Perfectly colorable graphs RB Sandeep
Information processing letters 111 (19), 960-961, 2011
3 2011 Bounds and extremal graphs for monitoring edge-geodetic sets in graphs F Foucaud, C Marcille, ZM Myint, RB Sandeep, S Sen, S Taruni
Discrete Applied Mathematics 366, 106-119, 2025
2 2025 Algorithms and complexity for monitoring edge-geodetic sets in graphs F Foucaud, C Marcille, RB Sandeep, S Sen, S Taruni
arXiv preprint arXiv:2409.19067, 2024
2 2024 Cutting a tree with subgraph complementation is hard, except for some small trees D Antony, S Pal, RB Sandeep, R Subashini
Journal of Graph Theory 107 (1), 126-168, 2024
2 2024 Switching classes: Characterization and computation D Antony, Y Cao, S Pal, RB Sandeep
arXiv preprint arXiv:2403.04263, 2024
2 2024 26th Annual European Symposium on Algorithms (ESA 2018) S Ahmadian, U Bhaskar, L Sanità, C Swamy, A Amir, GM Landau, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018
2 2018 
Naveen SivadasanPrincipal Scientist, TCS ResearchZweryfikowany adres z tcs.com
