R. B. Sandeep

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 25

Top Topics

Polynomial Kernels

Top Venues

Publications

Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. CoRR (2024)
Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep
Switching Classes: Characterization and Computation. CoRR (2024)
Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep
Switching Classes: Characterization and Computation. MFCS (2024)
Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. CALDAM (2024)
Dipayan Chakraborty, R. B. Sandeep
Contracting Edges to Destroy a Pattern: A Complexity Study. FCT (2023)
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep
Algorithms for subgraph complementation to some classes of graphs. CoRR (2023)
Dipayan Chakraborty, R. B. Sandeep
Contracting edges to destroy a pattern: A complexity study. CoRR (2023)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On Subgraph Complementation to H-free Graphs. Algorithmica 84 (10) (2022)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. Algorithmica 84 (1) (2022)
Dániel Marx, R. B. Sandeep
-free edge modification problems: Towards a dichotomy. J. Comput. Syst. Sci. 125 (2022)
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. LATIN (2022)
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
Cutting a tree with Subgraph Complementation is hard, except for some small trees. CoRR (2022)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On Subgraph Complementation to H-free Graphs. WG (2021)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On subgraph complementation to H-free graphs. CoRR (2021)
Yixin Cao, R. B. Sandeep
Minimum fill-in: Inapproximability and almost tight lower bounds. Inf. Comput. 271 (2020)
Dániel Marx, R. B. Sandeep
Incompressibility of H-free edge modification problems: Towards a dichotomy. CoRR (2020)
Dániel Marx, R. B. Sandeep
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy. ESA (2020)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. CoRR (2018)
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
A Polynomial Kernel for Diamond-Free Editing. ESA (2018)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
On Polynomial Kernelization of H-free Edge Deletion. Algorithmica 79 (3) (2017)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Dichotomy Results on the Hardness of H-free Edge Modification Problems. SIAM J. Discret. Math. 31 (1) (2017)
Yixin Cao, R. B. Sandeep
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. SODA (2017)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. LATIN (2016)
Yixin Cao, R. B. Sandeep
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds. CoRR (2016)
Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep
Compressing Bounded Degree Graphs. LATIN (2016)
N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan
The chromatic discrepancy of graphs. Discret. Appl. Math. 184 (2015)
R. B. Sandeep, Naveen Sivadasan
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. IPEC (2015)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of $H$-free Edge Modification Problems. CoRR (2015)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Parameterized lower bound and NP-completeness of some H-free Edge Deletion problems. CoRR (2015)
R. B. Sandeep, Naveen Sivadasan
Parameterized lower bound and improved kernel for Diamond-free Edge Deletion. CoRR (2015)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. COCOA (2015)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion. CoRR (2014)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
-free Edge Deletion. IPEC (2014)
R. B. Sandeep
Perfectly colorable graphs. Inf. Process. Lett. 111 (19) (2011)