Deeparnab Chakrabarty

168 papers A* 30A 7B 12Journal 99Unranked 17

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A primal-dual algorithm for monotone submodular maximization. Oper. Res. Lett. Deeparnab Chakrabarty, Luc Côté
2026	J	`jnl`	Counting hypertriangles through hypergraph orientations. CoRR Daniel Paul-Pena, Vaishali Surianarayanan, Deeparnab Chakrabarty, C. Seshadhri
2026	A*	`conf`	Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries. SODA Lorenzo Beretta, Deeparnab Chakrabarty, C. Seshadhri
2025	—	`conf`	Clustering in Varying Metrics. FSTTCS Deeparnab Chakrabarty, Jonathan Conroy, Ankita Sarkar
2025	J	`jnl`	Clustering in Varying Metrics. CoRR Deeparnab Chakrabarty, Jonathan Conroy, Ankita Sarkar
2025	A	`conf`	Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing. ITCS Deeparnab Chakrabarty, C. Seshadhri
2025	J	`jnl`	Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries. CoRR Lorenzo Beretta, Deeparnab Chakrabarty, C. Seshadhri
2025	A*	`conf`	Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. STOC Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten
2025	J	`jnl`	Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. CoRR Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten
2024	J	`jnl`	Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing. CoRR Deeparnab Chakrabarty, C. Seshadhri
2024	A	`conf`	Fault-tolerant k-Supplier with Outliers. STACS Deeparnab Chakrabarty, Luc Côté, Ankita Sarkar
2024	—	`conf`	Learning Partitions Using Rank Queries. FSTTCS Deeparnab Chakrabarty, Hang Liao
2024	J	`jnl`	Learning Partitions using Rank Queries. CoRR Deeparnab Chakrabarty, Hang Liao
2024	B	`conf`	Learning Spanning Forests Optimally in Weighted Undirected Graphs with CUT queries. ALT Hang Liao, Deeparnab Chakrabarty
2023	J	`jnl`	A Primal-Dual Analysis of Monotone Submodular Maximization. CoRR Deeparnab Chakrabarty, Luc Côté
2023	B	`conf`	A Query Algorithm for Learning a Spanning Forest in Weighted Undirected Graphs. ALT Deeparnab Chakrabarty, Hang Liao
2023	A*	`conf`	A d FOCS Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2023	J	`jnl`	A d CoRR Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2023	J	`jnl`	A d Electron. Colloquium Comput. Complex. Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2023	A*	`conf`	Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. STOC Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2023	J	`jnl`	Fault-tolerant k-Supplier with Outliers. CoRR Deeparnab Chakrabarty, Luc Côté, Ankita Sarkar
2023	J	`jnl`	Learning Spanning Forests Optimally using CUT Queries in Weighted Undirected Graphs. CoRR Hang Liao, Deeparnab Chakrabarty
2023	A*	`conf`	Parallel Submodular Function Minimization. NeurIPS Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford
2023	J	`jnl`	Parallel Submodular Function Minimization. CoRR Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford
2023	J	`jnl`	Robust k-center with two types of radii. Math. Program. Deeparnab Chakrabarty, Maryam Negahbani
2022	A	`conf`	Approximation Algorithms for Continuous Clustering and Facility Location Problems. ESA Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar
2022	J	`jnl`	Approximation Algorithms for Continuous Clustering and Facility Location Problems. CoRR Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar
2022	J	`jnl`	Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an $\widetilde{O}(n\sqrt{d})$ Monotonicity Tester. Electron. Colloquium Comput. Complex. Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2022	J	`jnl`	Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. CoRR Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2022	A*	`conf`	Improved Lower Bounds for Submodular Function Minimization. FOCS Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford
2022	J	`jnl`	Improved Lower Bounds for Submodular Function Minimization. CoRR Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford
2021	J	`jnl`	A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection. CoRR Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna
2021	A*	`conf`	A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. FOCS Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna
2021	A*	`conf`	Better Algorithms for Individually Fair NeurIPS Maryam Negahbani, Deeparnab Chakrabarty
2021	J	`jnl`	Better Algorithms for Individually Fair k-Clustering. CoRR Deeparnab Chakrabarty, Maryam Negahbani
2021	J	`jnl`	Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling. Math. Program. Deeparnab Chakrabarty, Sanjeev Khanna
2021	A	`conf`	Graph Connectivity and Single Element Recovery via Linear and OR Queries. ESA Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna
2021	A*	`conf`	Revisiting Priority k-Center: Fairness and Outliers. ICALP Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani
2021	J	`jnl`	Revisiting Priority k-Center: Fairness and Outliers. CoRR Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani
2021	J	`jnl`	Robust $k$-Center with Two Types of Radii. CoRR Deeparnab Chakrabarty, Maryam Negahbani
2021	B	`conf`	Robust k-Center with Two Types of Radii. IPCO Deeparnab Chakrabarty, Maryam Negahbani
2020	J	`jnl`	Deterministic Dynamic Matching in O(1) Update Time. Algorithmica Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
2020	A*	`conf`	Domain Reduction for Monotonicity Testing: A SODA Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2020	J	`jnl`	Graph Connectivity and Single Element Recovery via Linear and OR Queries. CoRR Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna
2020	—	`conf`	On a Decentralized (Δ+1)-Graph Coloring Algorithm. SOSA Deeparnab Chakrabarty, Paul de Supinski
2020	J	`jnl`	Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Theory Comput. Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2020	J	`jnl`	The Non-Uniform ACM Trans. Algorithms Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
2019	A	`conf`	Adaptive Boolean Monotonicity Testing in Total Influence Time. ITCS Deeparnab Chakrabarty, C. Seshadhri
2019	A*	`conf`	Approximation algorithms for minimum norm and ordered optimization problems. STOC Deeparnab Chakrabarty, Chaitanya Swamy
2019	A*	`conf`	Fair Algorithms for Clustering. NeurIPS Suman Kalyan Bera, Deeparnab Chakrabarty, Nicolas Flores, Maryam Negahbani
2019	J	`jnl`	Fair Algorithms for Clustering. CoRR Suman K. Bera, Deeparnab Chakrabarty, Maryam Negahbani
2019	A*	`conf`	Faster Matroid Intersection. FOCS Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sahil Singla, Sam Chiu-wai Wong
2019	J	`jnl`	Faster Matroid Intersection. CoRR Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sahil Singla, Sam Chiu-wai Wong
2019	J	`jnl`	Generalized Center Problems with Outliers. ACM Trans. Algorithms Deeparnab Chakrabarty, Maryam Negahbani
2019	J	`jnl`	On a Decentralized (Δ{+}1)-Graph Coloring Algorithm. CoRR Deeparnab Chakrabarty, Paul de Supinski
2019	A	`conf`	Simpler and Better Algorithms for Minimum-Norm Load Balancing. ESA Deeparnab Chakrabarty, Chaitanya Swamy
2019	J	`jnl`	Simpler and Better Algorithms for Minimum-Norm Load Balancing. CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2018	A*	`conf`	A SODA Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Adaptive Boolean Monotonicity Testing in Total Influence Time. CoRR Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Adaptive Boolean Monotonicity Testing in Total Influence Time. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Approximation Algorithms for Minimum Norm and Ordered Optimization Problems. CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2018	—	`conf`	Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. SOSA Deeparnab Chakrabarty, Sanjeev Khanna
2018	J	`jnl`	Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. CoRR Deeparnab Chakrabarty, Sanjeev Khanna
2018	J	`jnl`	Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions on Hypergrids. Electron. Colloquium Comput. Complex. Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2018	J	`jnl`	Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions on Hypergrids. CoRR Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2018	A*	`conf`	Dynamic Algorithms for Graph Coloring. SODA Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai
2018	A*	`conf`	Generalized Center Problems with Outliers. ICALP Deeparnab Chakrabarty, Maryam Negahbani
2018	J	`jnl`	Generalized Center Problems with Outliers. CoRR Deeparnab Chakrabarty, Maryam Negahbani
2018	A*	`conf`	Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. ICALP Deeparnab Chakrabarty, Chaitanya Swamy
2018	J	`jnl`	Online Buy-at-Bulk Network Design. SIAM J. Comput. Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
2017	J	`jnl`	A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid [n] CoRR Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2017	J	`jnl`	A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. CoRR Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube. Electron. Colloquium Comput. Complex. Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n] Electron. Colloquium Comput. Complex. Hadley Black, Deeparnab Chakrabarty, C. Seshadhri
2017	B	`conf`	Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. IPCO Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
2017	J	`jnl`	Dynamic Algorithms for Graph Coloring. CoRR Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai
2017	J	`jnl`	Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2017	A*	`conf`	Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. ICALP Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. CoRR Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Electron. Colloquium Comput. Complex. Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri
2017	J	`jnl`	Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. ACM Trans. Algorithms Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2017	A*	`conf`	Subquadratic submodular function minimization. STOC Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sam Chiu-wai Wong
2017	B	`conf`	The Heterogeneous Capacitated k-Center Problem. IPCO Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
2016	J	`jnl`	A $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness. CoRR Deeparnab Chakrabarty, C. Seshadhri
2016	J	`jnl`	A Õ(n) Non-Adaptive Tester for Unateness. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2016	J	`jnl`	An o(n) Monotonicity Tester for Boolean Functions over the Hypercube. SIAM J. Comput. Deeparnab Chakrabarty, C. Seshadhri
2016	J	`jnl`	Detecting Character Dependencies in Stochastic Models of Evolution. J. Comput. Biol. Deeparnab Chakrabarty, Sampath Kannan, Kevin Tian
2016	J	`jnl`	Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time. CoRR Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
2016	J	`jnl`	Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems. Math. Oper. Res. Deeparnab Chakrabarty, Chaitanya Swamy
2016	J	`jnl`	Graph Balancing with Two Edge Types. CoRR Deeparnab Chakrabarty, Kirankumar Shiragur
2016	B	`conf`	IQ-Hopping: distributed oblivious channel selection for wireless networks. MobiHoc Apurv Bhartia, Deeparnab Chakrabarty, Krishna Chintalapudi, Lili Qiu, Bozidar Radunovic, Ramachandran Ramjee
2016	—	`ch.`	Max-Min Allocation. Encyclopedia of Algorithms Deeparnab Chakrabarty
2016	—	`ch.`	Monotonicity Testing. Encyclopedia of Algorithms Deeparnab Chakrabarty
2016	J	`jnl`	Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword. Theory Comput. Deeparnab Chakrabarty, David J. Galvin
2016	J	`jnl`	Subquadratic Submodular Function Minimization. CoRR Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sam Chiu-wai Wong
2016	J	`jnl`	The Heterogeneous Capacitated $k$-Center Problem. CoRR Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
2016	A*	`conf`	The Non-Uniform k-Center Problem. ICALP Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
2016	J	`jnl`	The Non-Uniform k-Center Problem. CoRR Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
2015	J	`jnl`	Approximability of Capacitated Network Design. Algorithmica Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
2015	A*	`conf`	On (1, SODA Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li
2015	A*	`conf`	Online Buy-at-Bulk Network Design. FOCS Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi
2015	J	`jnl`	Online Buy-at-Bulk Network Design. CoRR Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
2015	A*	`conf`	Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. SODA Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2015	J	`jnl`	Recognizing Coverage Functions. SIAM J. Discret. Math. Deeparnab Chakrabarty, Zhiyi Huang
2014	J	`jnl`	An Optimal Lower Bound for Monotonicity Testing over Hypergrids. Theory Comput. Deeparnab Chakrabarty, C. Seshadhri
2014	J	`jnl`	On $(1, ε)$-Restricted Assignment Makespan Minimization. CoRR Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li
2014	J	`jnl`	Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. CoRR Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2014	J	`jnl`	Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri
2014	—	`conf`	Provable Submodular Minimization using Wolfe's Algorithm. NIPS Deeparnab Chakrabarty, Prateek Jain, Pravesh Kothari
2014	J	`jnl`	Provable Submodular Minimization using Wolfe's Algorithm. CoRR Deeparnab Chakrabarty, Prateek Jain, Pravesh Kothari
2014	J	`jnl`	Submodularity Helps in Nash and Nonsymmetric Bargaining Games. SIAM J. Discret. Math. Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu
2014	A	`conf`	Welfare maximization and truthfulness in mechanism design with ordinal preferences. ITCS Deeparnab Chakrabarty, Chaitanya Swamy
2013	J	`jnl`	A o(n) monotonicity tester for Boolean functions over the hypercube CoRR Deeparnab Chakrabarty, C. Seshadhri
2013	J	`jnl`	A o(n) monotonicity tester for Boolean functions over the hypercube. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2013	A*	`conf`	A o(n) monotonicity tester for boolean functions over the hypercube. STOC Deeparnab Chakrabarty, C. Seshadhri
2013	—	`conf`	An Optimal Lower Bound for Monotonicity Testing over Hypergrids. APPROX-RANDOM Deeparnab Chakrabarty, C. Seshadhri
2013	J	`jnl`	An optimal lower bound for monotonicity testing over hypergrids CoRR Deeparnab Chakrabarty, C. Seshadhri
2013	J	`jnl`	An optimal lower bound for monotonicity testing over hypergrids. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2013	A*	`conf`	Budget smoothing for internet ad auctions: a game theoretic approach. EC Denis Xavier Charles, Deeparnab Chakrabarty, Max Chickering, Nikhil R. Devanur, Lei Wang
2013	—	`conf`	Capacitated Network Design on Undirected Graphs. APPROX-RANDOM Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan
2013	J	`jnl`	Hypergraphic LP Relaxations for Steiner Trees. SIAM J. Discret. Math. Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2013	A*	`conf`	Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids. STOC Deeparnab Chakrabarty, C. Seshadhri
2013	J	`jnl`	Welfare Maximization and Truthfulness in Mechanism Design with Ordinal Preferences. CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2012	J	`jnl`	Approximability of the Firefighter Problem - Computing Cuts over Time. Algorithmica Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy
2012	J	`jnl`	Optimal bounds for monotonicity and Lipschitz testing over the hypercube CoRR Deeparnab Chakrabarty, C. Seshadhri
2012	J	`jnl`	Optimal bounds for monotonicity and Lipschitz testing over the hypercube. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, C. Seshadhri
2012	J	`jnl`	Review of design of approximation algorithms, by David P. Williamson and David B. Shmoys. SIGACT News Deeparnab Chakrabarty
2012	J	`jnl`	Testing Coverage Functions CoRR Deeparnab Chakrabarty, Zhiyi Huang
2012	—	`conf`	Testing Coverage Functions. ICALP (1) Deeparnab Chakrabarty, Zhiyi Huang
2011	B	`conf`	Approximability of Capacitated Network Design. IPCO Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
2011	J	`jnl`	Approximability of Sparse Integer Programs. Algorithmica David Pritchard, Deeparnab Chakrabarty
2011	B	`conf`	Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. IPCO Deeparnab Chakrabarty, Chaitanya Swamy
2011	J	`jnl`	New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. Math. Program. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2011	—	`conf`	Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs. APPROX-RANDOM Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
2011	—	`conf`	Social Welfare in One-Sided Matching Markets without Money. APPROX-RANDOM Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
2011	J	`jnl`	Social Welfare in One-sided Matching Markets without Money CoRR Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
2011	J	`jnl`	Variance on the Leaves of a Tree Markov Random Field: Detecting Character Dependencies in Phylogenies CoRR Deeparnab Chakrabarty, Sampath Kannan
2010	J	`jnl`	Approximability of Capacitated Network Design CoRR Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
2010	J	`jnl`	Design is as Easy as Optimization. SIAM J. Discret. Math. Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
2010	J	`jnl`	Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2010	J	`jnl`	G-parking functions, acyclic orientations and spanning trees. Discret. Math. Brian Benson, Deeparnab Chakrabarty, Prasad Tetali
2010	B	`conf`	Hypergraphic LP Relaxations for Steiner Trees. IPCO Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010	J	`jnl`	Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound CoRR Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010	J	`jnl`	Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Oper. Res. Lett. Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010	B	`conf`	On Column-Restricted and Priority Covering Integer Programs. IPCO Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann
2010	J	`jnl`	On Column-restricted and Priority Covering Integer Programs CoRR Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann
2010	J	`jnl`	On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. SIAM J. Comput. Deeparnab Chakrabarty, Gagan Goel
2010	J	`jnl`	Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP CoRR Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna
2010	J	`jnl`	Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. SIAM J. Discret. Math. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2009	—	`conf`	Algorithms for Message Ferrying on Mobile ad hoc Networks. FSTTCS Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton
2009	B	`conf`	Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. ISAAC Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy
2009	J	`jnl`	Hypergraphic LP Relaxations for Steiner Trees CoRR Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2009	J	`jnl`	On Allocating Goods to Maximize Fairness CoRR Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna
2009	A*	`conf`	On Allocating Goods to Maximize Fairness. FOCS Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna
2009	J	`jnl`	On competitiveness in uniform utility allocation markets. Oper. Res. Lett. Deeparnab Chakrabarty, Nikhil R. Devanur
2009	J	`jnl`	The Effect of Malice on the Social Optimum in Linear Load Balancing Games CoRR Deeparnab Chakrabarty, Chinmay Karande, Ashish Sangwan
2008	—	`—`	Algorithmic aspects of connectivity, allocation and design problems. Deeparnab Chakrabarty
2008	—	`conf`	Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems. WINE Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose
2008	A*	`conf`	Budget constrained bidding in keyword auctions and online knapsack problems. WWW Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose
2008	—	`conf`	Efficiency, Fairness and Competitiveness in Nash Bargaining Games. WINE Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu
2008	B	`conf`	New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2008	A*	`conf`	On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. FOCS Deeparnab Chakrabarty, Gagan Goel
2007	—	`conf`	On Competitiveness in Uniform Utility Allocation Markets. WINE Deeparnab Chakrabarty, Nikhil R. Devanur
2007	—	`conf`	Public Advertisement Broker Markets. WINE Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas Gollapudi
2006	—	`conf`	Design Is as Easy as Optimization. ICALP (1) Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
2006	J	`jnl`	Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. Electron. Colloquium Comput. Complex. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2006	—	`conf`	New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. WINE Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
2005	A*	`conf`	Fairness and optimality in congestion games. EC Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan