R. B. Sandeep

40 papers A* 1A 2B 8C 1Journal 26Unranked 2
YearRankTypeTitle / Venue / Authors
2026 — conf
Improved Upper Bounds on Color Reversal by Local Inversions.
CALDAM
Kumud Singh Porte, R. B. Sandeep, Kamal Santra
2025 J jnl
Algorithms for subgraph complementation to some classes of graphs.
Inf. Process. Lett.
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep
2025 J jnl
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs.
Discret. Appl. Math.
Florent Foucaud, Clara Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
2024 J jnl
Algorithms and complexity for monitoring edge-geodetic sets in graphs.
CoRR
Florent Foucaud, Clara Marcille, R. B. Sandeep, Sagnik Sen, S. Taruni
2024 J jnl
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs.
CoRR
Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
2024 J jnl
Cutting a tree with subgraph complementation is hard, except for some small trees.
J. Graph Theory
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
2024 J jnl
Erdős-Gyárfás conjecture on graphs without long induced paths.
CoRR
Anand Shripad Hegde, R. B. Sandeep, P. Shashank
2024 — conf
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.
CALDAM
Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
2024 B conf
Switching Classes: Characterization and Computation.
MFCS
Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep
2024 J jnl
Switching Classes: Characterization and Computation.
CoRR
Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep
2023 J jnl
Algorithms for subgraph complementation to some classes of graphs.
CoRR
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep
2023 B conf
Contracting Edges to Destroy a Pattern: A Complexity Study.
FCT
Dipayan Chakraborty, R. B. Sandeep
2023 J jnl
Contracting edges to destroy a pattern: A complexity study.
CoRR
Dipayan Chakraborty, R. B. Sandeep
2022 J jnl
A Polynomial Kernel for Diamond-Free Editing.
Algorithmica
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
2022 B conf
Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees.
LATIN
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
2022 J jnl
Cutting a tree with Subgraph Complementation is hard, except for some small trees.
CoRR
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
2022 J jnl
Incompressibility of
J. Comput. Syst. Sci.
Dániel Marx, R. B. Sandeep
2022 J jnl
On Subgraph Complementation to H-free Graphs.
Algorithmica
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
2021 B conf
On Subgraph Complementation to H-free Graphs.
WG
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
2021 J jnl
On subgraph complementation to H-free graphs.
CoRR
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
2020 A conf
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy.
ESA
Dániel Marx, R. B. Sandeep
2020 J jnl
Incompressibility of H-free edge modification problems: Towards a dichotomy.
CoRR
Dániel Marx, R. B. Sandeep
2020 J jnl
Minimum fill-in: Inapproximability and almost tight lower bounds.
Inf. Comput.
Yixin Cao, R. B. Sandeep
2018 A conf
A Polynomial Kernel for Diamond-Free Editing.
ESA
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
2018 J jnl
A Polynomial Kernel for Diamond-Free Editing.
CoRR
Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye
2017 J jnl
Dichotomy Results on the Hardness of H-free Edge Modification Problems.
SIAM J. Discret. Math.
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2017 A* conf
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds.
SODA
Yixin Cao, R. B. Sandeep
2017 J jnl
On Polynomial Kernelization of H-free Edge Deletion.
Algorithmica
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2016 B conf
Compressing Bounded Degree Graphs.
LATIN
Pål Grønås Drange, Markus S. Dregi, R. B. Sandeep
2016 J jnl
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds.
CoRR
Yixin Cao, R. B. Sandeep
2016 B conf
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems.
LATIN
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2015 B conf
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion.
IPEC
R. B. Sandeep, Naveen Sivadasan
2015 C conf
Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems.
COCOA
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2015 J jnl
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of $H$-free Edge Modification Problems.
CoRR
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2015 J jnl
Parameterized lower bound and NP-completeness of some H-free Edge Deletion problems.
CoRR
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2015 J jnl
Parameterized lower bound and improved kernel for Diamond-free Edge Deletion.
CoRR
R. B. Sandeep, Naveen Sivadasan
2015 J jnl
The chromatic discrepancy of graphs.
Discret. Appl. Math.
N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan
2014 B conf
On Polynomial Kernelization of
IPEC
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2014 J jnl
On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion.
CoRR
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
2011 J jnl
Perfectly colorable graphs.
Inf. Process. Lett.
R. B. Sandeep