The following pages link to Sanjeev Khanna (Q178479):
Displaying 50 items.
- Efficient Enumeration of Phylogenetically Informative Substrings (Q3596267) (← links)
- Robust Self-assembly of Graphs (Q3643098) (← links)
- Nash Dynamics in Constant Player and Bounded Jump Congestion Games (Q3648855) (← links)
- On Syntactic versus Computational Views of Approximability (Q4210142) (← links)
- Towards and syntactic characterization of PTAS (Q4228486) (← links)
- Page replacement for general caching problems (Q4252268) (← links)
- (Q4252288) (← links)
- (Q4252398) (← links)
- (Q4259987) (← links)
- (Q4471268) (← links)
- (Q4471352) (← links)
- (Q4472435) (← links)
- (Q4473278) (← links)
- A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction (Q4526965) (← links)
- (Q4535067) (← links)
- (Q4542565) (← links)
- (Q4542586) (← links)
- Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model (Q4575676) (← links)
- (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space (Q4575855) (← links)
- On Estimating Maximum Matching Size in Graph Streams (Q4575856) (← links)
- Sensitivity and computational complexity in financial networks (Q4586453) (← links)
- (Q4607911) (← links)
- (Q4608050) (← links)
- (Q4633805) (← links)
- (Q4633807) (← links)
- On Multidimensional Packing Problems (Q4651495) (← links)
- On the Hardness of 4-Coloring a 3-Colorable Graph (Q4652619) (← links)
- (Q4737152) (← links)
- On certificates and lookahead in dynamic graph problems (Q4875189) (← links)
- A Greedy Approximation Algorithm for Minimum-Gap Scheduling (Q4924641) (← links)
- The Angular-Metric Traveling Salesman Problem (Q4943841) (← links)
- On Broadcast Disk Paging (Q4943889) (← links)
- (Q4952619) (← links)
- (Q4952620) (← links)
- (Q4952674) (← links)
- (Q4952683) (← links)
- Edge-disjoint paths revisited (Q4962686) (← links)
- A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs (Q4973052) (← links)
- On the Power of Planned Infections in Networks (Q4985791) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- Top-k and Clustering with Noisy Comparisons (Q5012514) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- Space-efficient Query Evaluation over Probabilistic Event Streams (Q5145621) (← links)
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design (Q5171193) (← links)
- On Allocating Goods to Maximize Fairness (Q5171208) (← links)
- Dynamic and Non-uniform Pricing Strategies for Revenue Maximization (Q5171215) (← links)
- Algorithms for minimizing weighted flow time (Q5175956) (← links)
- Edge-Disjoint Paths in Planar Graphs with Constant Congestion (Q5189546) (← links)
- Polynomial pass lower bounds for graph streaming algorithms (Q5212768) (← links)
- A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems (Q5212780) (← links)
