The following pages link to Deeparnab Chakrabarty (Q647388):
Displaying 50 items.
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- On competitiveness in uniform utility allocation markets (Q833560) (← links)
- \(G\)-parking functions, acyclic orientations and spanning trees (Q965998) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q2039246) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time (Q2401147) (← links)
- The heterogeneous capacitated \(k\)-center problem (Q2401151) (← links)
- Approximability of the firefighter problem. Computing cuts over time (Q2428668) (← links)
- An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube (Q2805510) (← links)
- Testing Coverage Functions (Q2843245) (← links)
- Capacitated Network Design on Undirected Graphs (Q2851849) (← links)
- An Optimal Lower Bound for Monotonicity Testing over Hypergrids (Q2851875) (← links)
- Algorithms for Message Ferrying on Mobile ad hoc Networks (Q2920109) (← links)
- Recognizing Coverage Functions (Q2944461) (← links)
- Welfare maximization and truthfulness in mechanism design with ordinal preferences (Q2988871) (← links)
- Rationality and Strongly Polynomial Solvability of Eisenberg–Gale Markets with Two Agents (Q3008032) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP (Q3068630) (← links)
- Design is as Easy as Optimization (Q3084225) (← 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)
- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem (Q3503858) (← links)
- On Column-Restricted and Priority Covering Integer Programs (Q3569830) (← links)
- Design Is as Easy as Optimization (Q3613783) (← links)
- Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity (Q3652284) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- (Q4598206) (← links)
- (Q4607872) (← links)
- (Q4608033) (← links)
- Property Testing on Product Distributions (Q4962661) (← links)
- Generalized Center Problems with Outliers (Q4972687) (← links)
- Subquadratic submodular function minimization (Q4978061) (← links)
- Submodularity Helps in Nash and Nonsymmetric Bargaining Games (Q4979826) (← links)
- (Q5002699) (← links)
- (Q5002700) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- Adaptive Boolean Monotonicity Testing in Total Influence Time (Q5090393) (← links)
- Optimal unateness testers for real-valued functions: Adaptivity helps (Q5111334) (← links)
- (Q5140837) (← links)
- Domain Reduction for Monotonicity Testing: A <i>o</i>(<i>d</i>) Tester for Boolean Functions in <i>d</i>-Dimensions (Q5146908) (← links)
- On Allocating Goods to Maximize Fairness (Q5171208) (← links)
- Approximation algorithms for minimum norm and ordered optimization problems (Q5212754) (← links)
- (Q5240418) (← links)
- On (1,<i>∊</i>)-Restricted Assignment Makespan Minimization (Q5363001) (← links)
- Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties (Q5363109) (← links)
- A o(n) monotonicity tester for boolean functions over the hypercube (Q5495811) (← links)
- Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids (Q5495812) (← links)
- (Q5497118) (← links)
