The following pages link to V. S. Anil Kumar (Q313961):
Displaying 24 items.
- Labeled cuts in graphs (Q313962) (← links)
- On strategy improvement algorithms for simple stochastic games (Q635740) (← links)
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)
- The algorithmics of folding proteins on lattices. (Q1868718) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- Provable algorithms for parallel generalized sweep scheduling (Q2495501) (← links)
- (Q2754182) (← links)
- (Q2762522) (← links)
- (Q2768385) (← links)
- Covering rectilinear polygons with axis-parallel rectangles (Q2819577) (← links)
- Optimal constrained graph exploration (Q2944522) (← links)
- Bifurcations in Boolean Networks (Q3449994) (← links)
- A unified approach to scheduling on unrelated parallel machines (Q3452224) (← links)
- On Strategy Improvement Algorithms for Simple Stochastic Games (Q3563006) (← links)
- Limit Set Reachability in Asynchronous Graph Dynamical Systems (Q3646265) (← links)
- Covering Rectilinear Polygons with Axis-Parallel Rectangles (Q4441891) (← links)
- (Q4686061) (← links)
- (Q4737207) (← links)
- (Q4761354) (← links)
- Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks (Q4962606) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479366) (← links)
- (Q5501331) (← links)
- (Q5501366) (← links)
