Adrian Vetta
Adrian Vetta
Professor of Mathematics/ Professor of Computer Science, McGill University
Verified email at - Homepage
Cited by
Cited by
On clusterings: Good, bad and spectral
R Kannan, S Vempala, A Vetta
Journal of the ACM (JACM) 51 (3), 497-515, 2004
Finding odd cycle transversals
B Reed, K Smith, A Vetta
Operations Research Letters 32 (4), 299-301, 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
Sink equilibria and convergence
M Goemans, V Mirrokni, A Vetta
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 142-151, 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
Convergence issues in competitive games
VS Mirrokni, A Vetta
Approximation, randomization, and combinatorial optimization. algorithms and …, 2004
Nash equilibria in random games
I Bárány, S Vempala, A Vetta
Random Structures & Algorithms 31 (4), 391-405, 2007
Factor 4/3 approximations for minimum 2-connected subgraphs
S Vempala, A Vetta
International Workshop on Approximation Algorithms for Combinatorial …, 2000
Network design via iterative rounding of setpair relaxations
J Cheriyan, S Vempala, A Vetta
Combinatorica 26 (3), 255-275, 2006
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
Approximation algorithms for network design with metric costs
J Cheriyan, A Vetta
SIAM Journal on Discrete Mathematics 21 (3), 612-636, 2007
A priority-based model of routing
B Farzad, N Olver, A Vetta
Chicago Journal of Theoretical Computer Science 1, 2008
Approximating the minimum strongly connected subgraph via a matching lower bound
A Vetta
SODA, 417-426, 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
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
An approximation algorithm for the maximum leaf spanning arborescence problem
M Drescher, A Vetta
ACM Transactions on Algorithms (TALG) 6 (3), 1-18, 2010
The demand-matching problem
FB Shepherd, A Vetta
Mathematics of Operations Research 32 (3), 563-578, 2007
Planar graph bipartization in linear time
S Fiorini, N Hardy, B Reed, A Vetta
Discrete Applied Mathematics 156 (7), 1175-1180, 2008
Reducing the rank of a matroid
G Joret, A Vetta
arXiv preprint arXiv:1211.4853, 2012
Lighting fibers in a dark network
FB Shepherd, A Vetta
IEEE Journal on Selected Areas in Communications 22 (9), 1583-1588, 2004
The system can't perform the operation now. Try again later.
Articles 1–20