R. B. Sandeep

According to our database, R. B. Sandeep authored at least 28 papers between 2011 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

On the complexity of edge subdivision to H-free graphs.

Marta Piecyk, R. B. Sandeep

CoRR, April, 2026

Algorithms and complexity for monitoring edge-geodetic sets in graphs.

Florent Foucaud, Clara Marcille, R. B. Sandeep, Sagnik Sen, S. Taruni

Inf. Comput., 2026

Tight Upper Bounds on Color Reversal by Local Inversions.

Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

Parameterized Algorithms for k-Inversion.

Dhanyamol Antony, L. Sunil Chandran, Dalu Jacob, R. B. Sandeep

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

Improved Upper Bounds on Color Reversal by Local Inversions.

Kumud Singh Porte, R. B. Sandeep, Kamal Santra

Proceedings of the Algorithms and Discrete Applied Mathematics, 2026

2025

Algorithms for subgraph complementation to some classes of graphs.

Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep

Inf. Process. Lett., 2025

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs.

Florent Foucaud, Clara Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni

Discret. Appl. Math., 2025

2024

Erdős-Gyárfás conjecture on graphs without long induced paths.

Anand Shripad Hegde, R. B. Sandeep, P. Shashank

CoRR, 2024

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs.

Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni

CoRR, 2024

Switching Classes: Characterization and Computation.

Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.

Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Contracting Edges to Destroy a Pattern: A Complexity Study.

Dipayan Chakraborty, R. B. Sandeep

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Incompressibility of <i>H</i>-free edge modification problems: Towards a dichotomy.

Dániel Marx, R. B. Sandeep

J. Comput. Syst. Sci., 2022

Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees.

Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

On Subgraph Complementation to H-free Graphs.

Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020

Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy.

Dániel Marx, R. B. Sandeep

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2018

A Polynomial Kernel for Diamond-Free Editing.

Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Dichotomy Results on the Hardness of H-free Edge Modification Problems.

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

SIAM J. Discret. Math., 2017

On Polynomial Kernelization of H-free Edge Deletion.

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

Algorithmica, 2017

Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds.

Yixin Cao, R. B. Sandeep

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Compressing Bounded Degree Graphs.

Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems.

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

The chromatic discrepancy of graphs.

N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan

Discret. Appl. Math., 2015

Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion.

R. B. Sandeep, Naveen Sivadasan

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.

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

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

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

CoRR, 2014

On Polynomial Kernelization of <i>H</i> -free Edge Deletion.

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2011

Perfectly colorable graphs.

R. B. Sandeep

Inf. Process. Lett., 2011