- Bounds on the Cleaning Times of Robot Vacuums Zhentao Li and Adrian Vetta
- Network Connectivity and Malicious Attacks N. Sonnerat a,#,1 A. Vetta b,2
- Approximation Algorithms for Network Design with Metric Joseph Cheriyan #
- Galaxy Cutsets in Graphs Nicolas Sonnerat
- Defending Planar Graphs agains StarCutsets Nicolas Sonnerat # and Adrian Vetta +
- Approximation Algorithms for Minimum-Cost k-Vertex Connected Subgraphs Joseph Cheriyan , Santosh Vempala y and Adrian Vetta z
- The Demand Matching Problem Bruce Shepherd 1 and Adrian Vetta 2
- Approximate Min-Max Relations for Odd Cycles in Planar Graphs
- Nash Equilibria in Competitive Societies, with Applications to Facility Location, Trac Routing and Auctions
- A Polynomial Time Algorithm for finding Nash Equilibria in Planar WinLose Games
- Finding Odd Cycle Transversals Bruce Reed, Kaleigh Smith, and Adrian Vetta
- Lighting Fibers in a Dark Network F. B. Shepherd and A. Vetta
- Journal of Combinatorial Theory, Series B 99 (2009) 2029 Contents lists available at ScienceDirect
- PLANAR GRAPH BIPARTIZATION IN LINEAR TIME SAMUEL FIORINI, NADIA HARDY, BRUCE REED, AND ADRIAN VETTA
- NETWORK DESIGN VIA ITERATIVE ROUNDING OF SETPAIR RELAXATIONS
- VISUALIZING, FINDING AND PACKING DIJOINS F. B. Shepherd y and A. Vetta x
- Graph Connectivity: Relaxations and Algorithms Adrian Roshan Vetta
- Computational Aspects of Multimarket Price Nithum Thain1
- Approximating the Minimum Strongly Connected Subgraph via a Matching Lower Bound.
- On Clusterings: Good, Bad and Spectral Ravi Kannan
- Supplementary Text for "Simultaneous clustering of multiple gene expression and physical interaction datasets"
- Sink Equilibria and Convergence Michel Goemans , Vahab Mirrokni y and Adrian Vetta z
- Approximations for Minimum 2-Connected Subgraphs Santosh Vempala and Adrian Vetta y
- An Approximation Algorithm for the Maximum Leaf Spanning Arborescence Problem
- Convergence Issues in Competitive Games Vahab S. Mirrokni 1 and Adrian Vetta 2
- Maximum Flows on Disjoint Paths Guyslain Naves
- Simultaneous Clustering of Multiple Gene Expression and Physical Interaction Datasets
- A Priority-Based Model of Routing Babak Farzad, Neil Olver and Adrian Vetta
- (Almost) Tight Bounds and Existence Theorems for Single-Commodity Confluent Flows
