The following pages link to Abhijin Adiga (Q475393):
Displayed 22 items.
- Limit cycle structure for dynamic bi-threshold systems (Q475394) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Cubicity of threshold graphs (Q1025516) (← links)
- A \(k\)-median based online algorithm for the stochastic \(k\)-server problem (Q1644940) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
- Cubicity, degeneracy, and crossing number (Q2509731) (← links)
- Cubicity of Interval Graphs and the Claw Number (Q2851505) (← links)
- Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions (Q2874600) (← links)
- Cubicity, Degeneracy, and Crossing Number (Q2911622) (← links)
- Sensitivity of Diffusion Dynamics to Network Uncertainty (Q2922396) (← links)
- Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems (Q2947406) (← links)
- Parameterized Algorithms for Boxicity (Q3060748) (← links)
- Cubicity of interval graphs and the claw number (Q3061191) (← links)
- Polynomial Time and Parameterized Approximation Algorithms for Boxicity (Q4899248) (← links)
- A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs (Q5199227) (← links)
- Effect of Graph Structure on the Limit Sets of Threshold Dynamical Systems (Q5500613) (← links)
- Network Structure and Activity in Boolean Networks (Q5500625) (← links)
- Boxicity and Poset Dimension (Q5895539) (← links)
- Activity in Boolean networks (Q6191206) (← links)