R. B. Sandeep

Orcid: 0000-0003-4383-1819

According to our database1, R. B. Sandeep authored at least 19 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023
Algorithms for subgraph complementation to some classes of graphs.
CoRR, 2023

Contracting Edges to Destroy a Pattern: A Complexity Study.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
Incompressibility of <i>H</i>-free edge modification problems: Towards a dichotomy.
J. Comput. Syst. Sci., 2022

A Polynomial Kernel for Diamond-Free Editing.
Algorithmica, 2022

On Subgraph Complementation to H-free Graphs.
Algorithmica, 2022

Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2020
Minimum fill-in: Inapproximability and almost tight lower bounds.
Inf. Comput., 2020

Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2017
Dichotomy Results on the Hardness of H-free Edge Modification Problems.
SIAM J. Discret. Math., 2017

On Polynomial Kernelization of H-free Edge Deletion.
Algorithmica, 2017

2016
Compressing Bounded Degree Graphs.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
The chromatic discrepancy of graphs.
Discret. Appl. Math., 2015

Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion.
CoRR, 2014

On Polynomial Kernelization of <i>H</i> -free Edge Deletion.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2011
Perfectly colorable graphs.
Inf. Process. Lett., 2011


  Loading...