The following pages link to Sanjeev Khanna (Q178479):
Displaying 44 items.
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- On the complexity of graph self-assembly in accretive systems (Q934978) (← links)
- Robust self-assembly of graphs (Q968405) (← links)
- (Q1393081) (redirect page) (← links)
- On certificates and lookahead in dynamic graph problems (Q1393083) (← links)
- Time-constrained scheduling of weighted packets on trees and meshes (Q1400890) (← links)
- On indexed data broadcast (Q1577012) (← links)
- A linear time algorithm for sequential diagnosis in hypercubes (Q1892860) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q2039246) (← links)
- Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs (Q2322505) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- The network as a storage device: dynamic routing with bounded buffers (Q2391188) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- The Approximability of Constraint Satisfaction Problems (Q2706139) (← links)
- Complexity Classifications of Boolean Constraint Satisfaction Problems (Q2723175) (← links)
- (Q2768280) (← links)
- (Q2768299) (← links)
- Design networks with bounded pairwise distance (Q2819606) (← links)
- Distributed Private Heavy Hitters (Q2843272) (← links)
- Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs (Q2848226) (← links)
- The All-or-Nothing Multicommodity Flow Problem (Q2862199) (← links)
- Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs (Q2875130) (← links)
- (Q2913818) (← links)
- (Q2921673) (← links)
- Approximation algorithms for data placement on parallel disks (Q2930259) (← links)
- Perfect matchings via uniform sampling in regular bipartite graphs (Q2930303) (← links)
- Hardness of cut problems in directed graphs (Q2931415) (← links)
- Edge-disjoint paths in Planar graphs with constant congestion (Q2931436) (← links)
- On the Power of Adversarial Infections in Networks (Q2938012) (← links)
- Strategic Network Formation with Attack and Immunization (Q2959849) (← links)
- (Q3002769) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- Social Welfare in One-Sided Matching Markets without Money (Q3088085) (← links)
- STCON in Directed Unique-Path Graphs (Q3165964) (← links)
- Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply (Q3167386) (← links)
- Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model (Q4575676) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- (Q5240418) (← links)
- Algorithms for Provisioning Queries and Analytics (Q5276198) (← links)
- Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches (Q5278310) (← links)
- Graph connectivity and single element recovery via linear and OR queries (Q6052041) (← links)
- (Q6126337) (← links)
