Author image not provided
 Deeparnab Chakrabarty

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.93
Citation Count227
Publication count46
Publication years2005-2018
Available for download12
Average downloads per article138.33
Downloads (cumulative)1,660
Downloads (12 Months)440
Downloads (6 Weeks)49
SEARCH
ROLE
Arrow RightAuthor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


46 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 46
Result page: 1 2 3

Sort by:

1
January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 11,   Downloads (12 Months): 11,   Downloads (Overall): 11

Full text available: PDFPDF
We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ − 1)-edge coloring in a graph with maximum degree Δ. It is natural ...

2
January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 5,   Downloads (Overall): 5

Full text available: PDFPDF
We study monotonicity testing of Boolean functions over the hypergrid [ n ] d and design a non-adaptive tester with 1-sided error whose query complexity is Õ ( d 5/6 ) · poly(log n , 1/ ε ). Previous to our work, the best known testers had query complexity linear ...

3 published by ACM
June 2017 STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 96,   Downloads (Overall): 96

Full text available: PDFPDF
Submodular function minimization (SFM) is a fundamental discrete optimization problem which generalizes many well known problems, has applications in various fields, and can be solved in polynomial time. Owing to applications in computer vision and machine learning, fast SFM algorithms are highly desirable. The current fastest algorithms [Lee, Sidford, Wong, ...
Keywords: Lovasz Extension, Submodular Functions, Subgradient Descent

4 published by ACM
March 2017 ACM Transactions on Algorithms (TALG) - Special Issue on SODA'15 and Regular Papers: Volume 13 Issue 2, May 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 74,   Downloads (Overall): 74

Full text available: PDFPDF
The primary problem in property testing is to decide whether a given function satisfies a certain property or is far from any function satisfying it. This crucially requires a notion of distance between functions. The most prevalent notion is the Hamming distance over the uniform distribution on the domain. This ...
Keywords: Lipschitz continuity, Property testing, monotonicity

5 published by ACM
July 2016 MobiHoc '16: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 10,   Downloads (12 Months): 144,   Downloads (Overall): 309

Full text available: PDFPDF
Interference in WiFi deployments is a growing problem due to the increasing popularity of WiFi. Therefore it is important that APs find the right channel to operate upon. Through a large scale measurement study involving over 10,000 WiFi APs we show that channel measurements and selection are most effective when ...

6
October 2015 FOCS '15: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

We present the first non-trivial online algorithms for the non-uniform, multicommodity buy-at-bulk (MC-BB) network design problem. Our competitive ratios qualitatively match the best known approximation factors for the corresponding offline problems. In particular, we show:1. A polynomial time online algorithm with a poly-logarithmic competitive ratio for the MC-BB problem in ...

7
June 2015 Algorithmica: Volume 72 Issue 2, June 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In the capacitated survivable network design problem (Cap-SNDP), we are given an undirected multi-graph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimum-cut requirements. Unlike its classical special case of SNDP ...
Keywords: Approximation algorithms, Linear Programming Relaxations, Network design

8
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 29

Full text available: PDFPDF
The primary problem in property testing is to decide whether a given function satisfies a certain property, or is far from any function satisfying it. This crucially requires a notion of distance between functions. The most prevalent notion is the Hamming distance over the uniform distribution on the domain. This ...

9
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 18,   Downloads (Overall): 55

Full text available: PDFPDF
Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time (2 -- δ )-approximation algorithm is known for the problem for constant δ > 0. This is true even for certain special cases, most notably the restricted assignment problem where each job has the same ...

10
December 2014 NIPS'14: Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 1
Publisher: MIT Press
Bibliometrics:
Citation Count: 2

Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [10, 11]. However, these algorithms are typically not practical. In 1976, Wolfe [21] proposed an algorithm to find the minimum ...

11 published by ACM
January 2014 ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer science
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 84

Full text available: PDFPDF
In this paper, we study mechanism design problems in the ordinal setting wherein the preferences of agents are described by orderings over outcomes, as opposed to specific numerical values associated with them. This setting is relevant when agents can compare outcomes, but aren't able to evaluate precise utilities for them. ...
Keywords: social welfare and rank approximation, ordinal preferences, linear programming, truthfulness for randomized mechanisms, algorithmic game theory, computational social choice theory, matroids, mechanism design

12 published by ACM
June 2013 EC '13: Proceedings of the fourteenth ACM conference on Electronic commerce
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Downloads (Overall): 137

Full text available: PDFPDF
In Internet ad auctions, search engines often throttle budget constrained advertisers so as to spread their spends across the specified time period. Such policies are known as budget smoothing policies. In this paper, we perform a principled, game-theoretic study of what the outcome of an ideal budget smoothing algorithm should ...
Keywords: online algorithms, ad auctions, budget smoothing, equilibrium

13 published by ACM
June 2013 STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Downloads (Overall): 117

Full text available: PDFPDF
The problem of monotonicity testing over the hypergrid and its special case, the hypercube, is a classic question in property testing. We are given query access to f:[k] n -> R (for some ordered range R). The hypergrid/cube has a natural partial order given by coordinate-wise ordering, denoted by prec. ...
Keywords: hypercubes, property testing, monotonicity, hypergrids, lipschitz testing

14 published by ACM
June 2013 STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Downloads (Overall): 118

Full text available: PDFPDF
Given oracle access to a Boolean function f:{0,1} n -> {0,1}, we design a randomized tester that takes as input a parameter ε>0, and outputs Yes if the function is monotonically non-increasing, and outputs No with probability >2/3, if the function is ε-far from being monotone, that is, f needs ...
Keywords: boolean functions, monotonicity, boolean hypercube, property testing

15
July 2012 ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

A coverage function f over a ground set [ m ] is associated with a universe U of weighted elements and m sets A 1 ,…, A m ⊆ U , and for any T ⊆[ m ], f ( T ) is defined as the total weight of the ...

16
February 2012 Algorithmica: Volume 62 Issue 1-2, February 2012
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 5

We provide approximation algorithms for several variants of the Firefighter problem on general graphs. The Firefighter problem models the case where a diffusive process such as an infection (or an idea, a computer virus, a fire) is spreading through a network, and our goal is to contain this infection by ...
Keywords: Graph cuts, Submodular, Approximation algorithms, Vaccination

17
November 2011 Mathematical Programming: Series A and B: Volume 130 Issue 1, November 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. We use geometry to define an LP whose dual is equivalent to this relaxation. This opens up the possibility of using the primal-dual schema in a ...
Keywords: 05C85

18
September 2011 Algorithmica - Special Issue: European Symposium on Algorithms, Design and Analysis: Volume 61 Issue 1, September 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 4

The main focus of this paper is a pair of new approximation algorithms for certain integer programs. First, for covering integer programs {min  cx : Ax ≥ b , 0 ≤ x ≤ d } where A has at most k nonzeroes per row, we give a k -approximation algorithm. ...
Keywords: Approximation algorithms, LP rounding

19
September 2011 Algorithmica: Volume 61 Issue 1, September 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The main focus of this paper is a pair of new approximation algorithms for certain integer programs. First, for covering integer programs {min� cx : Ax � b , 0 ≤ x ≤ d } where A has at most k nonzeroes per row, we give a k -approximation algorithm. ...
Keywords: Integer programming, Approximation algorithms, LP rounding

20
August 2011 APPROX'11/RANDOM'11: Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We study social welfare in one-sided matching markets where the goal is to efficiently allocate n items to n agents that each have a complete, private preference list and a unit demand over the items. Our focus is on allocation mechanisms that do not involve any monetary payments. We consider ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us