The following pages link to Ashutosh Rai (Q370985):
Displaying 39 items.
- Bound on tri-partite Hardy's nonlocality respecting all bi-partite principles (Q370988) (← links)
- Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities (Q670063) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- A testable prediction of the no-signalling condition using a variant of the EPR-Bohm example (Q2283993) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Belief-invariant and quantum equilibria in games of incomplete information (Q2664942) (← links)
- A Parameterized Algorithm for Mixed-Cut (Q2802977) (← links)
- Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs (Q2828227) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)
- Optimal free will on one side in reproducing the singlet correlation (Q2890792) (← links)
- Faster Parameterized Algorithms for Deletion to Split Graphs (Q2904547) (← links)
- Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs (Q2904571) (← links)
- On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles (Q2914348) (← links)
- On the Kernelization Complexity of String Problems (Q2920454) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q2946421) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- A complementary relation between classical bits and randomness in local part in the simulating singlet state (Q2999467) (← links)
- Local randomness in Hardy's correlations: implications from the information causality principle (Q3058574) (← links)
- Propagation of Spikes in Nonresonant Atomic Media: The Reduced Maxwell-Duffing Model (Q3117937) (← links)
- Local simulation of singlet statistics for a restricted set of measurements (Q3145909) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- Strong Parameterized Deletion: Bipartite Graphs (Q4636568) (← links)
- Lossy Kernels for Graph Contraction Problems (Q4636570) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
- Quick separation in chordal and split graphs (Q5089243) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5918589) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- (Q6068263) (← links)
- (Q6192486) (← links)
- Parameterized approximation algorithms for weighted vertex cover (Q6547955) (← links)
- Parameterized complexity of untangling knots (Q6560886) (← links)
- Parameterized approximation algorithms for weighted vertex cover (Q6639732) (← links)
- Parameterized approximation scheme for feedback vertex set (Q6647689) (← links)
