28 citations · 30 across the 2 of their papers we have counts for
10 papers
Parameterized and Exact Algorithms for Class Domination Coloring
R. Krithika, Ashutosh Rai, Saket Saurabh +1
A class domination coloring (also called cd-Coloring or dominated coloring) of a graph is a proper coloring in which every color class is contained in the neighbourhood of some ver…
Parameterized complexity of untangling knots
Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Deciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized…
Device-independent bounds from Cabello's nonlocality argument
Ashutosh Rai, Matej Pivoluska, Martin Plesch +3
Hardy-type arguments manifest Bell nonlocality in one of the simplest possible ways. Except for demonstrating nonclassical signature of entangled states in question, they can also…
Non-Local Network Coding in Interference Channels
Jiyoung Yun, Ashutosh Rai, Joonwoo Bae
In a network, a channel introduces correlations to the parties that aim to establish a communication protocol. In this work, we present a framework of non-local network coding by e…
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
We develop an FPT algorithm and a bi-kernel for the Weighted Edge Clique Partition (WECP) problem, where a graph with vertices and integer edge weights is given together with a…
Geometry of the quantum set on no-signaling faces
Ashutosh Rai, Cristhiano Duarte, Samurai Brito +1
Since Bell's theorem we know that quantum mechanics is incompatible with local hidden-variable models, the phenomenon known as quantum nonlocality. However, despite steady progress…