Chandra Chekuri - Citazioni di Google Scholar

Citata da

	Tutte	Dal 2015
Citazioni	10212	3772
Indice H	54	30
i10-index	106	76

820

410

205

615

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202028 60 93 95 137 181 206 283 304 423 451 462 531 502 594 574 629 702 651 725 713 811 811 56

Coautori

Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaEmail verificata su cis.upenn.edu
Bruce ShepherdUniversity of British ColumbiaEmail verificata su cs.ubc.ca
Martin PálGoogle, Inc.Email verificata su google.com
Moses CharikarProfessor of Computer Science, Stanford UniversityEmail verificata su cs.stanford.edu
Nitish KorulaResearch Scientist, GoogleEmail verificata su google.com
Joseph Seffi NaorTechnionEmail verificata su cs.technion.ac.il
Sudipto Guha`Email verificata su cis.upenn.edu
Ashish GoelProfessor of Management Science and Engineering, and by courtesy, Computer Science, Stanford UniversityEmail verificata su stanford.edu
Alina R. EneBoston UniversityEmail verificata su bu.edu
Kent QuanrudPurdue UniversityEmail verificata su purdue.edu
Anupam GuptaProfessor of Computer Science, Carnegie Mellon UniversityEmail verificata su cs.cmu.edu
Rico ZenklusenETH ZurichEmail verificata su math.ethz.ch
Guy KortsarzProfessor computer scienceEmail verificata su camden.rutgers.edu
Michael A. BenderStony Brook UniversityEmail verificata su cs.stonybrook.edu
Clifford SteinProfessor of IEOR and CS, Columbia UniversityEmail verificata su ieor.columbia.edu
Julia ChuzhoyToyota Technological Institute at ChicagoEmail verificata su ttic.edu
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkEmail verificata su cs.umd.edu
Benjamin MoseleyCarnegie Mellon UniversityEmail verificata su andrew.cmu.edu
Mohammad SalavatipourProfessor of Computer Science, University of AlbertaEmail verificata su cs.ualberta.ca
Anand RajaramanPartner, Rocketship.vcEmail verificata su cs.stanford.edu

Chandra Chekuri

Professor of Computer Science, University of Illinois, Urbana-Champaign

Email verificata su illinois.edu - Home page

Design and Analysis of Algorithms Combinatorial Optimization Graphs and Networks Mathematical Programming


Titolo	Citata da	Anno
Maximizing a monotone submodular function subject to a matroid constraint G Calinescu, C Chekuri, M Pál, J Vondrák SIAM Journal on Computing 40 (6), 1740-1766, 2011	705*	2011
Incremental clustering and dynamic information retrieval M Charikar, C Chekuri, T Feder, R Motwani SIAM Journal on Computing 33 (6), 1417-1440, 2004	670	2004
Approximation algorithms for directed Steiner problems M Charikar, C Chekuri, T Cheung, Z Dai, A Goel, S Guha, M Li Journal of Algorithms 33 (1), 73-91, 1999	561	1999
A polynomial time approximation scheme for the multiple knapsack problem C Chekuri, S Khanna SIAM Journal on Computing 35 (3), 713-728, 2005	519	2005
On multidimensional packing problems C Chekuri, S Khanna SIAM journal on computing 33 (4), 837-851, 2004	367*	2004
Conjunctive query containment revisited C Chekuri, A Rajaraman Theoretical Computer Science 239 (2), 211-229, 2000	339	2000
Fast estimation of diameter and shortest paths (without matrix multiplication) D Aingworth, C Chekuri, P Indyk, R Motwani SIAM Journal on Computing 28 (4), 1167-1181, 1999	278	1999
Approximation techniques for average completion time scheduling C Chekuri, R Motwani, B Natarajan, C Stein Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms …, 1997	258*	1997
Approximation schemes for minimizing average weighted completion time with release dates F Afrati, E Bampis, C Chekuri, D Karger, C Kenyon, S Khanna, I Milis, ... 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999	228	1999
A recursive greedy algorithm for walks in directed graphs C Chekuri, M Pal 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 245-253, 2005	220	2005
Submodular function maximization via the multilinear relaxation and contention resolution schemes C Chekuri, J Vondrák, R Zenklusen SIAM Journal on Computing 43 (6), 1831-1879, 2014	208	2014
Web search using automatic classification C Chekuri, MH Goldwasser, P Raghavan, E Upfal Proceedings of the Sixth International Conference on the World Wide Web, 1997	207	1997
Approximating a finite metric by a small number of tree metrics M Charikar, C Chekuri, A Goel, S Guha, S Plotkin Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998	204	1998
Maximum coverage problem with group budget constraints and applications C Chekuri, A Kumar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004	194	2004
Dependent randomized rounding via exchange properties of combinatorial structures C Chekuri, J Vondrak, R Zenklusen 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 575-584, 2010	193*	2010
Improved algorithms for orienteering and related problems C Chekuri, N Korula, M Pál ACM Transactions on Algorithms (TALG) 8 (3), 23, 2012	170	2012
Experimental study of minimum cut algorithms MS Levine Massachusetts Institute of Technology, 1997	168	1997
Multicommodity demand flow in a tree and packing integer programs C Chekuri, M Mydlarz, FB Shepherd ACM Transactions on Algorithms (TALG) 3 (3), 27, 2007	163*	2007
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median. M Charikar, C Chekuri, A Goel, S Guha STOC 98, 114-123, 1998	157	1998
Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar Algorithmica 47 (1), 53-78, 2007	146*	2007

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