Deeparnab Chakrabarty - Citazioni di Google Scholar

Citata da

	Tutte	Dal 2015
Citazioni	1398	867
Indice H	21	18
i10-index	34	26

240

120

180

20052006200720082009201020112012201320142015201620172018201920204 6 13 20 41 57 60 69 102 141 101 134 185 189 227 28

Coautori

C. SeshadhriUniversity of California, Santa CruzEmail verificata su ucsc.edu
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaEmail verificata su cis.upenn.edu
Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.Email verificata su ics.uci.edu
nikhil r. devanurMicrosoft ResearchEmail verificata su microsoft.com
Yunhong ZhouYahoo! LabsEmail verificata su yahoo-inc.com
Rajan LukoseHigher Moment SoftwareEmail verificata su stanfordalumni.org
Gagan GoelResearch Scientist, GoogleEmail verificata su google.com
Jochen KoenemannUniversity of WaterlooEmail verificata su uwaterloo.ca
Ravishankar KrishnaswamyMicrosoft ResearchEmail verificata su cs.cmu.edu
David A. G. PritchardGoogle Los AngelesEmail verificata su uwaterloo.ca
Dr. Ameya HateAkamai TechnologiesEmail verificata su akamai.com
Elliot AnshelevichProfessor of Computer Science, Rensselaer Polytechnic InstituteEmail verificata su cs.rpi.edu
Aranyak MehtaGoogle ResearchEmail verificata su google.com
Monika HenzingerProfessor of Computer Science, University of ViennaEmail verificata su univie.ac.at
Sayan BhattacharyaUniversity of WarwickEmail verificata su warwick.ac.uk
Anand BhalgatFacebook Inc, University of Pennsylvania, Indian Institute of ScienceEmail verificata su seas.upenn.edu
Pravesh K. KothariAssistant Professor of Computer ScienceEmail verificata su cs.cmu.edu
Prateek JainMicrosoft Research IndiaEmail verificata su microsoft.com
Julia ChuzhoyToyota Technological Institute at ChicagoEmail verificata su ttic.edu
Shi LiAssistant Professor, University at BuffaloEmail verificata su buffalo.edu

Deeparnab Chakrabarty

Dartmouth College

Email verificata su dartmouth.edu - Home page

Algorithms


Titolo	Citata da	Anno
Budget constrained bidding in keyword auctions and online knapsack problems Y Zhou, D Chakrabarty, R Lukose Internet and Network Economics, 566-576, 2008	189*	2008
On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP D Chakrabarty, G Goel SIAM Journal on Computing 39, 2189, 2010	107	2010
On allocating goods to maximize fairness D Chakrabarty, J Chuzhoy, S Khanna 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 107-116, 2009	87	2009
An o(n) Monotonicity Tester for Boolean Functions over the Hypercube D Chakrabarty, C Seshadhri SIAM Journal on Computing 45 (2), 461-472, 2016	72	2016
Approximability of the firefighter problem E Anshelevich, D Chakrabarty, A Hate, C Swamy Algorithmica 62 (1-2), 520-536, 2012	67*	2012
Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids D Chakrabarty, C Seshadhri Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013	65	2013
G-parking functions, acyclic orientations and spanning trees B Benson, D Chakrabarty, P Tetali Discrete Mathematics 310 (8), 1340-1353, 2010	59	2010
An optimal lower bound for monotonicity testing over hypergrids D Chakrabarty, C Seshadhri Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013	46	2013
Fairness and optimality in congestion games D Chakrabarty, A Mehta, V Nagarajan Proceedings of the 6th ACM Conference on Electronic Commerce, 52-57, 2005	44	2005
Provable submodular minimization using Wolfe's algorithm D Chakrabarty, P Jain, P Kothari Advances in Neural Information Processing Systems, 802-809, 2014	42	2014
On column-restricted and priority covering integer programs D Chakrabarty, E Grant, J Könemann International Conference on Integer Programming and Combinatorial …, 2010	41	2010
Social welfare in one-sided matching markets without money A Bhalgat, D Chakrabarty, S Khanna Approximation, randomization, and combinatorial optimization. Algorithms and …, 2011	39	2011
Rationality and Strongly Polynomial Solvability of Eisenberg-Gale Markets with Two Agents D Chakrabarty, NR Devanur, VV Vazirani SIAM Journal on Discrete Mathematics 24 (3), 1117-1136, 2010	30*	2010
Approximability of Capacitated Network Design D Chakrabarty, C Chekuri, S Khanna, N Korula Algorithmica 72 (2), 493-514, 2015	29*	2015
Welfare maximization and truthfulness in mechanism design with ordinal preferences D Chakrabarty, C Swamy Proceedings of the 5th conference on Innovations in theoretical computer …, 2014	29	2014
Facility location with client latencies: Lp-based techniques for minimum-latency problems D Chakrabarty, C Swamy Mathematics of Operations Research 41 (3), 865-883, 2016	28*	2016
On (1, ε)-restricted assignment makespan minimization D Chakrabarty, S Khanna, S Li Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015	28*	2015
Dynamic algorithms for graph coloring S Bhattacharya, D Chakrabarty, M Henzinger, D Nanongkai Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	26	2018
Approximability of sparse integer programs D Pritchard, D Chakrabarty Algorithmica 61 (1), 75-93, 2011	25	2011
The non-uniform k-center problem D Chakrabarty, P Goyal, R Krishnaswamy arXiv preprint arXiv:1605.03692, 2016	22	2016

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori