Chandra Chekuri - Google Scholar

Citata da

	Tutte	Dal 2015
Citazioni	10801	4317
Indice H	54	32
i10-index	111	81

840

420

210

630

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202028 61 101 94 139 181 206 282 307 426 455 448 527 509 609 581 623 704 670 721 687 803 823 607

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
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
Joseph Seffi NaorTechnionEmail verificata su cs.technion.ac.il
Alina 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
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
Mohammad SalavatipourProfessor of Computer Science, University of AlbertaEmail verificata su cs.ualberta.ca
Benjamin MoseleyCarnegie Mellon UniversityEmail verificata su andrew.cmu.edu
David KargerProfessor of Computer Science, MITEmail verificata su mit.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	796*	2011
Incremental clustering and dynamic information retrieval M Charikar, C Chekuri, T Feder, R Motwani SIAM Journal on Computing 33 (6), 1417-1440, 2004	702	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	570	1999
A polynomial time approximation scheme for the multiple knapsack problem C Chekuri, S Khanna SIAM Journal on Computing 35 (3), 713-728, 2005	563	2005
On multidimensional packing problems C Chekuri, S Khanna SIAM journal on computing 33 (4), 837-851, 2004	386*	2004
Conjunctive query containment revisited C Chekuri, A Rajaraman Theoretical Computer Science 239 (2), 211-229, 2000	358	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	292	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	262*	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	238	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	234	2005
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	225	1999
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	215	1997
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	213*	2010
Maximum coverage problem with group budget constraints and applications C Chekuri, A Kumar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004	211	2004
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	209	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	179	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	170*	2007
Experimental Study of Minimum Cut Algorithms. C Chekuri, AV Goldberg, DR Karger, MS Levine, C Stein SODA 97, 324-333, 1997	163	1997
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	160	1998
Approximation algorithms for the unsplittable flow problem A Chakrabarti, C Chekuri, A Gupta, A Kumar Algorithmica 47 (1), 53-78, 2007	153*	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