The following pages link to Sayan Bhattacharya (Q602748):
Displaying 30 items.
- A cops and robber game in multidimensional grids (Q602750) (← links)
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
- Welfare maximization with friends-of-friends network externalities (Q1693985) (← links)
- Prior-free multi-unit auctions with ordered bidders (Q2210509) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time (Q2401147) (← links)
- New amortized cell-probe lower bounds for dynamic problems (Q2420582) (← links)
- Budget constrained auctions with heterogeneous items (Q2875165) (← links)
- (Q2913820) (← links)
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (Q2941505) (← links)
- Welfare Maximization with Friends-of-Friends Network Externalities (Q2954986) (← links)
- Coordination mechanisms from (almost) all scheduling policies (Q2988872) (← links)
- New Approximability Results for the Robust k-Median Problem (Q3188881) (← links)
- Design of Dynamic Algorithms via Primal-Dual Method (Q3448786) (← links)
- Maintaining Near-Popular Matchings (Q3449500) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q4571920) (← links)
- Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time (Q4575767) (← links)
- (Q4607872) (← links)
- Improved algorithm for dynamic b-Matching (Q5111701) (← links)
- Coarse-Grained Complexity for Dynamic Algorithms (Q5146795) (← links)
- An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs (Q5146944) (← links)
- Coordination Mechanisms for Selfish Routing over Time on a Tree (Q5167741) (← links)
- Deterministically Maintaining a (2 + <i>∊</i>)-Approximate Minimum Vertex Cover in <i>O</i>(1/<i>∊</i><sup>2</sup>) Amortized Update Time (Q5236297) (← links)
- New deterministic approximation algorithms for fully dynamic matching (Q5361847) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q5362993) (← links)
- (Q5417648) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
- Dynamic algorithms for packing-covering LPs via multiplicative weight updates (Q6538524) (← links)
- Dynamic matching with better-than-2 approximation in polylogarithmic update time (Q6538530) (← links)
- Nibbling at long cycles: dynamic (and static) edge coloring in optimal time (Q6645486) (← links)
