Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
R. B. Sandeep
Observed names:
R B Sandeep,
R.B. Sandeep,
Sandeep, R. B.
Institution:
Indian Institute of Technology Dharwad
Observed institutions:
National Institute of Technology Calicut,
HUN-REN Institute for Computer Science and Control,
Indian Institute of Technology Dharwad,
Indian Institute of Technology Hyderabad,
Hungarian Academy of Sciences
ORCID:
0000-0003-4383-1819
Observed ORCID:
0000-0003-4383-1819
OpenAlex ID:
A5060047035
Dichotomy Results on the Hardness of $H$-free Edge Modification Problems
2017
·
N. R. Aravind
, R. B. Sandeep
, et al.
·
SIAM Journal on Discrete Mathematics
·
32
Incompressibility of H-free edge modification problems: Towards a dichotomy
2021
·
Dániel Marx
, R.B. Sandeep
·
Journal of Computer and System Sciences
·
27
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion
2015
·
Sandeep, R. B.
, Sivadasan, Naveen
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
21
PDF
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
2025
·
Florent Foucaud
, Clara Marcille
, et al.
·
Discrete Applied Mathematics
·
18
PDF
Algorithms and complexity for monitoring edge-geodetic sets in graphs
2026
·
Florent Foucaud
, Clara Marcille
, et al.
·
Information and Computation
·
15
PDF
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity
2024
·
Florent Foucaud
, Clara Marcille
, et al.
·
Lecture notes in computer science
·
13
PDF
Minimum fill-in: Inapproximability and almost tight lower bounds
2020
·
Yixin Cao
, R.B. Sandeep
·
Information and Computation
·
13
PDF
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
2017
·
Yixin Cao
, R. B. Sandeep
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
11
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems
2016
·
N. R. Aravind
, R. B. Sandeep
, et al.
·
Lecture notes in computer science
·
11
PDF
A Polynomial Kernel for Diamond-Free Editing
2018
·
Cao, Yixin
, Rai, Ashutosh
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
10
PDF
A Polynomial Kernel for Diamond-Free Editing
2021
·
Yixin Cao
, Ashutosh Rai
, et al.
·
Algorithmica
·
9
PDF
On Subgraph Complementation to H-free Graphs
2022
·
Dhanyamol Antony
, Jay Garchar
, et al.
·
Algorithmica
·
8
PDF
Compressing Bounded Degree Graphs
2016
·
Pål Grønås Drange
, Markus Dregi
, et al.
·
Lecture notes in computer science
·
7
On Polynomial Kernelization of H-free Edge Deletion
2014
·
N. R. Aravind
, R. B. Sandeep
, et al.
·
7
Switching Classes: Characterization and Computation
2024
·
Antony, Dhanyamol
, Cao, Yixin
, et al.
·
arXiv (Cornell University)
·
5
PDF
Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems
2015
·
N. R. Aravind
, R. B. Sandeep
, et al.
·
Lecture notes in computer science
·
5
PDF
Algorithms for subgraph complementation to some classes of graphs
2024
·
Dhanyamol Antony
, Sagartanu Pal
, et al.
·
Information Processing Letters
·
4
On deeply critical oriented cliques
2023
·
Christopher Duffy
, P. D. Pavan
, et al.
·
Journal of Graph Theory
·
4
PDF
On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion
2014
·
N. R. Aravind
, R. B. Sandeep
, et al.
·
Lecture notes in computer science
·
4
PDF
Isometric and induced path partitions: A new upper bound and a characterization of some extremal graphs
2026
·
Irena Penev
, R.B. Sandeep
, et al.
·
Discrete Applied Mathematics
·
3
PDF
Cutting a tree with subgraph complementation is hard, except for some small trees
2024
·
Dhanyamol Antony
, Sagartanu Pal
, et al.
·
Journal of Graph Theory
·
3
PDF
Contracting Edges to Destroy a Pattern: A Complexity Study
2023
·
Dipayan Chakraborty
, R. B. Sandeep
·
Lecture notes in computer science
·
3
PDF
Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees
2022
·
Dhanyamol Antony
, Sagartanu Pal
, et al.
·
Lecture notes in computer science
·
3
On Subgraph Complementation to H-free Graphs
2021
·
Dhanyamol Antony
, Jay Garchar
, et al.
·
Lecture notes in computer science
·
3
On Polynomial Kernelization of $$\mathcal {H}$$ H -free Edge Deletion
2016
·
N. R. Aravind
, R. B. Sandeep
, et al.
·
Algorithmica
·
3
Show more works
View as search
Works count:
42
Citation count:
250
H-index:
10
I10-index:
10
Year
Topic
Type