Sandeep RB
Sandeep RB
Indian Institute of Technology Dharwad
Verifisert e-postadresse på iitdh.ac.in - Startside
Tittel
Sitert av
Sitert av
År
Minimum fill-in: Inapproximability and almost tight lower bounds
Y Cao, RB Sandeep
Information and Computation 271, 104514, 2020
202020
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
192017
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
192015
On Polynomial Kernelization of H - free Edge Deletion
NR Aravind, RB Sandeep, N Sivadasan
Algorithmica 79 (3), 654-666, 2017
132017
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
122016
Incompressibility of H-free edge modification problems: Towards a dichotomy
D Marx, RB Sandeep
arXiv preprint arXiv:2004.11761, 2020
72020
Compressing bounded degree graphs
PG Drange, M Dregi, RB Sandeep
LATIN 2016: Theoretical Informatics, 362-375, 2016
72016
A polynomial kernel for diamond-free editing
Y Cao, A Rai, RB Sandeep, J Ye
arXiv preprint arXiv:1803.03358, 2018
62018
Parameterized lower bound and NP-completeness of some H-free edge deletion problems
NR Aravind, RB Sandeep, N Sivadasan
Combinatorial Optimization and Applications, 424-438, 2015
62015
Perfectly colorable graphs
RB Sandeep
Information processing letters 111 (19), 960-961, 2011
32011
A cubic vertex kernel for diamond-free edge deletion and more
RB Sandeep, N Sivadasan
arXiv preprint arXiv:1507.08792, 2015
22015
The chromatic discrepancy of graphs
NR Aravind, S Kalyanasundaram, RB Sandeep, N Sivadasan
Discrete Applied Mathematics 184, 40-49, 2015
22015
On subgraph complementation to H-free graphs
D Antony, J Garchar, S Pal, RB Sandeep, S Sen, R Subashini
arXiv preprint arXiv:2103.02936, 2021
2021
On deeply critical oriented cliques
C Duffy, PD Pavan, RB Sandeep, S Sen
Extended Abstracts EuroComb 2021, 631-636, 2021
2021
28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017.-Сер. 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017
C Berkholz, M Grohe, A Abboud, G Bodwin, S Pettie, A Sidiropoulos, ...
Computing 2400, 2410, 2017
2017
Results on Hardness of Edge Modification Problems and Chromatic Discrepancy of Graphs
RB Sandeep
Indian Institute of Technology Hyderabad, 0
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–16