Adrian Vetta 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	4457	1122
h 指数	26	14
i10 指数	42	24

280

140

210

2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202411 56 113 117 153 195 206 223 231 269 261 229 240 234 238 215 236 180 181 187 216 239 113

开放获取的出版物数量

查看全部

5 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Santosh S. VempalaGeorgia Tech在 gatech.edu 的电子邮件经过验证
Bruce ReedMcGill University在 cs.mcgill.ca 的电子邮件经过验证
Vahab MirrokniGoogle Fellow, VP, Google Research在 google.com 的电子邮件经过验证
Bruce ShepherdUniversity of British Columbia在 cs.ubc.ca 的电子邮件经过验证
Michel GoemansRSA Professor of Mathematics, MIT在 math.mit.edu 的电子邮件经过验证
Samuel FioriniUniversité libre de Bruxelles在 ulb.ac.be 的电子邮件经过验证
Sergey NorinAssociate Professor, McGill University在 math.mcgill.ca 的电子邮件经过验证
Gerardo BerbegliaMelbourne Business School, The University of Melbourne在 mbs.edu 的电子邮件经过验证
Nicolas BousquetCNRS, LIRIS, University Lyon 1, Univ. de Lyon在 liris.cnrs.fr 的电子邮件经过验证
Nithum ThainGoogle Brain在 google.com 的电子邮件经过验证
Jim GeelenUniversity of Waterloo在 uwaterloo.ca 的电子邮件经过验证
Guyslain NavesAssistant professor, Laboratoire d'Informatique et des Systèmes, Aix-Marseille Université在 lis-lab.fr 的电子邮件经过验证
Manikandan (Mani) NarayananAssociate Professor, Dept. of Computer Science & Engg., Indian Institute of Technology (IIT) Madras在 cse.iitm.ac.in 的电子邮件经过验证
Bundit LaekhanukitShanghai University of Finance and Economics在 sufe.edu.cn 的电子邮件经过验证
Mathieu BlanchetteProfessor of Computer Science, McGill University在 cs.mcgill.ca 的电子邮件经过验证
Ethan KimSoftware Engineer at Google在 cs.mcgill.ca 的电子邮件经过验证
Gordon WilfongBell Labs在 nokia-bell-labs.com 的电子邮件经过验证
Gwenaël JoretUniversité libre de Bruxelles在 ulb.be 的电子邮件经过验证
Ravi SundaramProfessor, Computer Science, Northeastern University在 ccs.neu.edu 的电子邮件经过验证
Robert KleinbergDepartment of Computer Science, Cornell University在 cs.cornell.edu 的电子邮件经过验证

关注

Adrian Vetta

Professor of Mathematics/ Professor of Computer Science, McGill University

在 math.mcgill.ca 的电子邮件经过验证 - 首页

Algorithms: Algorithmic Economics Network Design Discrete Mathematics


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
On clusterings: Good, bad and spectral R Kannan, S Vempala, A Vetta Journal of the ACM (JACM) 51 (3), 497-515, 2004	1624	2004
Finding odd cycle transversals B Reed, K Smith, A Vetta Operations Research Letters 32 (4), 299-301, 2004	454	2004
Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions A Vetta The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002	447	2002
Sink equilibria and convergence M Goemans, V Mirrokni, A Vetta 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 142-151, 2005	260	2005
Approximation algorithms for minimum-cost k-vertex connected subgraphs J Cheriyan, S Vempala, A Vetta Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	155	2002
Convergence issues in competitive games VS Mirrokni, A Vetta International Workshop on Randomization and Approximation Techniques in …, 2004	127	2004
Nash equilibria in random games I Bárány, S Vempala, A Vetta Random Structures & Algorithms 31 (4), 391-405, 2007	100	2007
Factor 4/3 approximations for minimum 2-connected subgraphs S Vempala, A Vetta International Workshop on Approximation Algorithms for Combinatorial …, 2000	77	2000
On the odd-minor variant of Hadwiger's conjecture J Geelen, B Gerards, B Reed, P Seymour, A Vetta Journal of Combinatorial Theory, Series B 99 (1), 20-29, 2009	76	2009
Network design via iterative rounding of setpair relaxations J Cheriyan*, S Vempala, A Vetta Combinatorica 26 (3), 255-275, 2006	63	2006
Approximating the minimum strongly connected subgraph via a matching lower bound A Vetta SODA, 417-426, 2001	57	2001
Simultaneous clustering of multiple gene expression and physical interaction datasets M Narayanan, A Vetta, EE Schadt, J Zhu PLoS computational biology 6 (4), e1000742, 2010	51	2010
A priority-based model of routing B Farzad, N Olver, A Vetta Chicago Journal of Theoretical Computer Science 1, 2008	51	2008
Approximation algorithms for network design with metric costs J Cheriyan, A Vetta Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005	50	2005
An approximation algorithm for the maximum leaf spanning arborescence problem M Drescher, A Vetta ACM Transactions on Algorithms (TALG) 6 (3), 1-18, 2010	46	2010
An upper bound for the chromatic number of line graphs AD King, BA Reed, A Vetta European Journal of Combinatorics 28 (8), 2182-2187, 2007	43	2007
The demand-matching problem FB Shepherd, A Vetta Mathematics of Operations Research 32 (3), 563-578, 2007	42*	2007
Planar graph bipartization in linear time S Fiorini, N Hardy, B Reed, A Vetta Discrete Applied Mathematics 156 (7), 1175-1180, 2008	41	2008
Randomized experimental design for causal graph discovery H Hu, Z Li, AR Vetta Advances in neural information processing systems 27, 2014	37	2014
A near-optimal mechanism for impartial selection N Bousquet, S Norin, A Vetta International Conference on Web and Internet Economics, 133-146, 2014	36	2014

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用