Vikash Tripathi

activity

20192026

collaborators

6 papers

cs.AR2026

CAFE: Conducting-Cell-Aware Adaptive Differential Encoding for Robust DNN Inference in FeFET-Based Compute-in-Memory

Wenshuai Yao, Wenyong Zhou, Hanyong Shao +3

Ferroelectric field-effect transistor (FeFET)-based compute-in-memory (CIM) promises energy-efficient deep neural network (DNN) inference, but device variation can severely degrade…

cs.DS2024

Budget-feasible Egalitarian Allocation of Conflicting Jobs

Sushmita Gupta, Pallavi Jain, A. Mohanapriya +1

Allocating conflicting jobs among individuals while respecting a budget constraint for each individual is an optimization problem that arises in various real-world scenarios. In th…

cs.DM2021

Complexity of Paired Domination in AT-free and Planar Graphs

Vikash Tripathi, Ton Kloks, Arti Pandey +2

For a graph $G = (V, E)$ , a subset $D$ of vertex set $V$ , is a dominating set of $G$ if every vertex not in $D$ is adjacent to atleast one vertex of $D$ . A dominating set $D$ of a gra…

math.CO2021

A linear-time algorithm for semitotal domination in strongly chordal graphs

Vikash Tripathi, Arti Pandey, Anil Maheshwari

In a graph $G = (V, E)$ with no isolated vertex, a dominating set $D \subseteq V$ , is called a semitotal dominating set if for every vertex $u \in D$ there is another vertex $v \in D$ …

cs.DM2020

Semipaired Domination in Some Subclasses of Chordal Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$ -element subsets such that the vertices in each…

cs.DM2019

Complexity and Algorithms for Semipaired Domination in Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

For a graph $G = (V, E)$ with no isolated vertices, a set $D \subseteq V$ is called a semipaired dominating set of G if $(i)$ $D$ is a dominating set of $G$ , and $(ii)$ $D$ can be part…