Author

Ashwin Jacob

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

On the Parameterized Complexity of Conflict-Free Edge Cut in Undirected Graphs

In this paper, we study CONFLICT-FREE EDGE CUT (CF-CUT), which is a recently introduced conflict-free version of the MIN-CUT problem that asks to find the minimum number of edges to disconnect a connected graph. The CF-CUT takes as input a connected undirected graph G = (V, E), a conflict graph $\widehat{G}$ such that...

Sourav Das, Ashwin Jacob, Arpit Kumar et al. · 0 citations

Preprint Sep 2026

Improved bounds for the lazy cops and robbers on generalized hypercubes

In Lazy Cops and Robbers, at most one cop moves on each cop turn. We study the lazy cop number of the generalized hypercube $Q(n,m)$, whose vertex set is ${\{0,1,\ldots,m\}}^n$. For each fixed integer $m\geq2$, we prove the asymptotic upper bound $$c_{\mathrm{L}}(Q(n,m))=O\!\left(\frac{{(m+1)}^n}{n^{3/2}}\right).$$ Thi...

Anand Babu, Ashwin Jacob, K. M. Krishnan et al. · 0 citations