R. B. Sandeep

Available identifiers

Publication	Date of Publication	Type
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
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
https://portal.mardi4nfdi.de/entity/Q5009567	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
https://portal.mardi4nfdi.de/entity/Q5363789	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
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

No records found.

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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