R. B. Sandeep

Available identifiers

zbMath Open sandeep.r-bMaRDI QIDQ1679220

List of research outcomes

Publication	Date of Publication	Type
Algorithms for subgraph complementation to some classes of graphs	2025-01-14	Paper
Cutting a tree with subgraph complementation is hard, except for some small trees	2024-08-30	Paper
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity	2024-05-31	Paper
On deeply critical oriented cliques	2023-10-10	Paper
Cutting a tree with subgraph complementation is hard, except for some small trees	2023-07-26	Paper
Contracting edges to destroy a pattern: A complexity study	2023-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q5874544	2023-02-07	Paper
On subgraph complementation to \(H\)-free Graphs	2022-10-06	Paper
On subgraph complementation to \(H\)-free graphs	2022-06-08	Paper
A polynomial kernel for diamond-free editing	2022-02-01	Paper
Incompressibility of \(H\)-free edge modification problems: towards a dichotomy	2022-01-31	Paper
A Polynomial Kernel for Diamond-Free Editing	2021-08-04	Paper
Minimum fill-in: inapproximability and almost tight lower bounds	2020-03-12	Paper
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds	2018-07-16	Paper
On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}	2017-11-09	Paper
Parameterized lower bound and improved kernel for diamond-free edge deletion	2017-09-29	Paper
Dichotomy results on the hardness of \(H\)-free edge modification problems	2017-05-24	Paper
Parameterized lower bounds and dichotomy results for the NP-completeness of \(H\)-free edge modification problems	2016-05-03	Paper
Compressing Bounded Degree Graphs	2016-05-03	Paper
Parameterized lower bound and NP-completeness of some \(H\)-free edge deletion problems	2016-02-05	Paper
On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion	2015-09-15	Paper
The chromatic discrepancy of graphs	2015-04-28	Paper
Perfectly colorable graphs	2013-04-04	Paper
Switching Classes: Characterization and Computation	N/A	Paper
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs	N/A	Paper

Research outcomes over time

This page was built for person: R. B. Sandeep