Chandra Chekuri

Citata da

	Tutte	Dal 2016
Citazioni	11216	3955
Indice H	56	29
i10-index	114	80

880

440

220

660

19981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202160 99 90 149 180 208 282 310 434 467 457 530 526 632 600 627 699 672 720 678 806 821 868 57

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
Moses CharikarProfessor of Computer Science, Stanford UniversityEmail verificata su cs.stanford.edu
Martin PálGoogle, Inc.Email verificata su google.com
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
Kent QuanrudPurdue UniversityEmail verificata su purdue.edu
Ashish GoelProfessor of Management Science and Engineering, and by courtesy, Computer Science, Stanford UniversityEmail verificata su stanford.edu
Alina EneBoston UniversityEmail verificata su bu.edu
Anupam GuptaProfessor of Computer Science, Carnegie Mellon UniversityEmail verificata su cs.cmu.edu
Clifford SteinProfessor of IEOR and CS, Columbia UniversityEmail verificata su ieor.columbia.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
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
David KargerProfessor of Computer Science, MITEmail verificata su mit.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 Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Maximizing a monotone submodular function subject to a matroid constraint G Calinescu, C Chekuri, M Pal, J Vondrák SIAM Journal on Computing 40 (6), 1740-1766, 2011	862*	2011
Incremental clustering and dynamic information retrieval M Charikar, C Chekuri, T Feder, R Motwani SIAM Journal on Computing 33 (6), 1417-1440, 2004	729	2004
Approximation algorithms for directed Steiner problems M Charikar, C Chekuri, TY Cheung, Z Dai, A Goel, S Guha, M Li Journal of Algorithms 33 (1), 73-91, 1999	590	1999
A polynomial time approximation scheme for the multiple knapsack problem C Chekuri, S Khanna SIAM Journal on Computing 35 (3), 713-728, 2005	578	2005
On multidimensional packing problems C Chekuri, S Khanna SIAM journal on computing 33 (4), 837-851, 2004	410*	2004
Conjunctive query containment revisited C Chekuri, A Rajaraman Theoretical Computer Science 239 (2), 211-229, 2000	369	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	291	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	269*	1997
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	264	2014
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	240	2005
Dependent randomized rounding via exchange properties of combinatorial structures C Chekuri, J Vondrák, R Zenklusen 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 575-584, 2010	227*	2010
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	227	1999
Maximum coverage problem with group budget constraints and applications C Chekuri, A Kumar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004	220	2004
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	220	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	214	1998
Improved algorithms for orienteering and related problems C Chekuri, N Korula, M Pál ACM Transactions on Algorithms (TALG) 8 (3), 1-27, 2012	185	2012
Multicommodity demand flow in a tree and packing integer programs C Chekuri, M Mydlarz, FB Shepherd ACM Transactions on Algorithms (TALG) 3 (3), 27-es, 2007	178*	2007
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median M Charikar, C Chekuri, A Goel, S Guha Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	168	1998
Experimental Study of Minimum Cut Algorithms. C Chekuri, AV Goldberg, DR Karger, MS Levine, C Stein SODA 97, 324-333, 1997	168	1997
Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar Algorithmica 47 (1), 53-78, 2007	155*	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