This paper studies the effect of bias correction on confidence interval estimators in the context of kernel-based nonparametric density estimation. We consider explicit plug-in bias correction but,… (More)

We study the parameterized complexity of domination-type problems. (σ, ρ)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (σ, ρ)dominating if… (More)

Given a graph G = (V,E), a subset B ⊆ V of vertices is a weak odd dominated (WOD) set if there exists D ⊆ V \B such that every vertex in B has an odd number of neighbours in D. κ(G) denotes the size… (More)

The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least… (More)