Factor 4/3 approximations for minimum 2-connected subgraphs. - Santosh S. Vempala; Adrian Vetta (APPROX, 2000)

Approximating the minimum strongly connected subgraph via a matching lower bound. - Adrian Vetta (SODA, 2001)

Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. - Adrian Vetta (FOCS, 2002)

Approximation algorithms for minimum-cost k-vertex connected subgraphs. - Joseph Cheriyan; Santosh S. Vempala; Adrian Vetta (STOC, 2002)

An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. - Joseph Cheriyan; Santosh S. Vempala; Adrian Vetta (SIAM J. Comput., 2003)

Convergence Issues in Competitive Games. - Vahab S. Mirrokni; Adrian Vetta (APPROX-RANDOM, 2004)

(Almost) tight bounds and existence theorems for confluent flows. - Jiangzhuo Chen; Robert D. Kleinberg; László Lovász 001; Rajmohan Rajaraman; Ravi Sundaram; Adrian Vetta (STOC, 2004)

On clusterings: Good, bad and spectral. - Ravi Kannan; Santosh S. Vempala; Adrian Vetta (J. ACM, 2004)

Lighting fibers in a dark network. - F. Bruce Shepherd; Adrian Vetta (IEEE J. Sel. Areas Commun., 2004)

Finding odd cycle transversals. - Bruce A. Reed; Kaleigh Smith; Adrian Vetta (Oper. Res. Lett., 2004)

Sink Equilibria and Convergence. - Michel X. Goemans; Vahab S. Mirrokni; Adrian Vetta (FOCS, 2005)

Network Design Via Iterative Rounding Of Setpair Relaxations. - Joseph Cheriyan; Santosh S. Vempala; Adrian Vetta (Comb., 2006)

Degree-constrained network flows. - Patrick Donovan; F. Bruce Shepherd; Adrian Vetta; Gordon T. Wilfong (STOC, 2007)

An upper bound for the chromatic number of line graphs. - Andrew D. King; Bruce A. Reed; Adrian Vetta (Eur. J. Comb., 2007)

(Almost) Tight bounds and existence theorems for single-commodity confluent flows. - Jiangzhuo Chen; Robert D. Kleinberg; László Lovász 001; Rajmohan Rajaraman; Ravi Sundaram; Adrian Vetta (J. ACM, 2007)

A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. - Louigi Addario-Berry; Neil Olver; Adrian Vetta (J. Graph Algorithms Appl., 2007)

The Demand-Matching Problem. - F. Bruce Shepherd; Adrian Vetta (Math. Oper. Res., 2007)

Approximate min-max relations for odd cycles in planar graphs. - Samuel Fiorini; Nadia Hardy; Bruce A. Reed; Adrian Vetta (Math. Program., 2007)

Nash equilibria in random games. - Imre Bárány; Santosh S. Vempala; Adrian Vetta (Random Struct. Algorithms, 2007)

Approximation Algorithms for Network Design with Metric Costs. - Joseph Cheriyan; Adrian Vetta (SIAM J. Discret. Math., 2007)

A Priority-Based Model of Routing. - Babak Farzad; Neil Olver; Adrian Vetta (Chic. J. Theor. Comput. Sci., 2008)

Planar graph bipartization in linear time. - Samuel Fiorini; Nadia Hardy; Bruce A. Reed; Adrian Vetta (Discret. Appl. Math., 2008)

Computational Aspects of Multimarket Price Wars. - Nithum Thain; Adrian Vetta (WINE, 2009)

Defending Planar Graphs against Star-Cutsets. - Nicolas Sonnerat; Adrian Vetta (Electron. Notes Discret. Math., 2009)

On the odd-minor variant of Hadwiger's conjecture. - Jim Geelen; Bert Gerards; Bruce A. Reed; Paul D. Seymour; Adrian Vetta (J. Comb. Theory B, 2009)

Maximum Flows on Disjoint Paths. - Guyslain Naves; Nicolas Sonnerat; Adrian Vetta (APPROX-RANDOM, 2010)

On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms. - Volodymyr Kuleshov; Adrian Vetta (SAGT, 2010)

Predicting direct protein interactions from affinity purification mass spectrometry data. - Ethan Kim; Ashish Sabharwal; Adrian Vetta; Mathieu Blanchette (Algorithms Mol. Biol., 2010)

Galaxy cutsets in graphs. - Nicolas Sonnerat; Adrian Vetta (J. Comb. Optim., 2010)

Bounds on the cleaning times of robot vacuums. - Zhentao Li; Adrian Vetta (Oper. Res. Lett., 2010)

Simultaneous Clustering of Multiple Gene Expression and Physical Interaction Datasets. - Manikandan Narayanan; Adrian Vetta; Eric E. Schadt; Jun Zhu (PLoS Comput. Biol., 2010)

An approximation algorithm for the maximum leaf spanning arborescence problem. - Matthew Drescher; Adrian Vetta (ACM Trans. Algorithms, 2010)

Clique Cover on Sparse Networks. - Mathieu Blanchette; Ethan Kim; Adrian Vetta (ALENEX, 2012)

A Theoretical Examination of Practical Game Playing: Lookahead Search. - Vahab S. Mirrokni; Nithum Thain; Adrian Vetta (SAGT, 2012)

Non-redistributive Second Welfare Theorems. - Bundit Laekhanukit; Guyslain Naves; Adrian Vetta (WINE, 2012)

On the Implications of Lookahead Search in Game Playing - Vahab S. Mirrokni; Nithum Thain; Adrian Vetta (CoRR, 2012)

Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3. - Yogesh Anbalagan; Sergey Norin; Rahul Savani; Adrian Vetta (WINE, 2013)

False-Name Bidding and Economic Efficiency in Combinatorial Auctions. - Colleen Alkalay-Houlihan; Adrian Vetta (AAAI, 2014)

Randomized Experimental Design for Causal Graph Discovery. - Huining Hu; Zhentao Li; Adrian R. Vetta (NIPS, 2014)

Bounds on the Profitability of a Durable Good Monopolist. - Gerardo Berbeglia; Peter Sloan; Adrian Vetta (WINE, 2014)

A Near-Optimal Mechanism for Impartial Selection. - Nicolas Bousquet 001; Sergey Norin; Adrian Vetta (WINE, 2014)

To Save Or Not To Save: The Fisher Game. - Ruta Mehta; Nithum Thain; László A. Végh; Adrian Vetta (WINE, 2014)

Routing Regardless of Network Stability. - Bundit Laekhanukit; Adrian Vetta; Gordon T. Wilfong (Algorithmica, 2014)

The Complexity of the Simultaneous Cluster Problem. - Zhentao Li; Manikandan Narayanan; Adrian Vetta (J. Graph Algorithms Appl., 2014)

Pricing mechanisms for a durable good monopolist. - Gerardo Berbeglia; Peter Sloan; Adrian Vetta (SIGMETRICS Perform. Evaluation Rev., 2014)

Approximating Rooted Steiner Networks. - Joseph Cheriyan; Bundit Laekhanukit; Guyslain Naves; Adrian Vetta (ACM Trans. Algorithms, 2014)

Large Supports are Required for Well-Supported Nash Equilibria. - Yogesh Anbalagan; Hao Huang; Shachar Lovett; Sergey Norin; Adrian Vetta; Hehui Wu (APPROX-RANDOM, 2015)

Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. - F. Bruce Shepherd; Adrian Vetta; Gordon T. Wilfong (FOCS, 2015)

The Combinatorial World (of Auctions) According to GARP. - Shant Boodaghians; Adrian Vetta (SAGT, 2015)

Coalition Games on Interaction Graphs: A Horticultural Perspective. - Nicolas Bousquet 001; Zhentao Li; Adrian Vetta (EC, 2015)

Testing Consumer Rationality Using Perfect Graphs and Oriented Discs. - Shant Boodaghians; Adrian Vetta (WINE, 2015)

Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction. - Nicolas Bousquet 001; Yang Cai 001; Adrian Vetta (WINE, 2015)

The Storable Good Monopoly Problem with Indivisible Demand. - Gerardo Berbeglia; Gautam Rayaprolu; Adrian Vetta (CoRR, 2015)

Reducing the rank of a matroid. - Gwenaël Joret; Adrian Vetta (Discret. Math. Theor. Comput. Sci., 2015)

On the Economic Efficiency of the Combinatorial Clock Auction. - Nicolas Bousquet 001; Yang Cai 001; Christoph Hunkenschröder; Adrian Vetta (SODA, 2016)

The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. - F. Bruce Shepherd; Adrian R. Vetta (Theory Comput., 2017)

Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. - Gerardo Berbeglia; Shant Boodaghians; Adrian Vetta (SAGT, 2018)

The Combinatorial Clock Auction: the Effects of Strategic Behaviour and the Price Increment Rule on Social Welfare. - Max Dupré la Tour; Adrian Vetta (EC, 2018)

Pricing policies for selling indivisible storable goods to strategic consumers. - Gerardo Berbeglia; Gautam Rayaprolu; Adrian Vetta (Ann. Oper. Res., 2019)

Computation in Causal Graphs. - Juli Atherton; Derek Ruths; Adrian Vetta (J. Graph Algorithms Appl., 2019)

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem. - Christoph Hunkenschröder; Santosh S. Vempala; Adrian Vetta (ACM Trans. Algorithms, 2019)

Two-Buyer Sequential Multiunit Auctions with No Overbidding. - Mete Seref Ahunbay; Brendan Lucier; Adrian Vetta (SAGT, 2020)

How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces. - Mashbat Suzuki; Adrian Vetta (SAGT, 2020)

One Dollar Each Eliminates Envy. - Johannes Brustle; Jack Dippel; Vishnu V. Narayan; Mashbat Suzuki; Adrian Vetta (EC, 2020)

A Case Study in Learning in Metagames: Super Smash Bros. Melee. - Julien Codsi; Adrian Vetta (AIIDE, 2021)

The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions. - Mete Seref Ahunbay; Brendan Lucier; Adrian Vetta (SAGT, 2021)

Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming. - Mete Seref Ahunbay; Adrian Vetta (SAGT, 2021)

Two Birds with One Stone: Fairness and Welfare via Transfers. - Vishnu V. Narayan; Mashbat Suzuki; Adrian Vetta (SAGT, 2021)

Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality? - Ndiamé Ndiaye; Sergey Norin; Adrian Vetta (SAGT, 2021)

Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees. - Jonathan A. Noel; Mashbat Suzuki; Adrian Vetta (SAGT, 2021)

Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets. - Gerardo Berbeglia; Shant Boodaghians; Adrian Vetta (Discret. Optim., 2021)

The Fair Division of Hereditary Set Systems. - Zhentao Li; Adrian Vetta (ACM Trans. Economics and Comput., 2021)

An Improved Bound for the Tree Conjecture in Network Creation Games. - Jack Dippel; Adrian Vetta (SAGT, 2022)

A General Framework for a Class of Quarrels: The Quarrelling Paradox Revisited. - Arash Abizadeh; Adrian Vetta (CoRR, 2022)

The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is). - Vishnu V. Narayan; Enguerrand Prebet; Adrian Vetta (Theory Comput. Syst., 2022)

Risk-Free Bidding in Complement-Free Combinatorial Auctions. - Vishnu V. Narayan; Gautam Rayaprolu; Adrian Vetta (Theory Comput. Syst., 2022)

Fair Algorithm Design: Fair and Efficacious Machine Scheduling. - April Niu; Agnes Totschnig; Adrian Vetta (SAGT, 2023)

Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs. - Margarida Carvalho; Alison Caulfield; Yi Lin; Adrian Vetta (WINE, 2023)

The Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems. - Sissi Jiang; Ndiamé Ndiaye; Adrian Vetta; Eggie Wu (WINE, 2023)

The Price of Anarchy in One-Sided Allocation Problems with Multi-Unit Demand Agents. - Sissi Jiang; Ndiamé Ndiaye; Adrian Vetta; Eggie Wu (CoRR, 2023)

The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions. - Mete Seref Ahunbay; Adrian Vetta (ACM Trans. Economics and Comput., 2023)

The blocker postulates for measures of voting power. - Arash Abizadeh; Adrian Vetta (Soc. Choice Welf., 2023)

Gerrymandering Planar Graphs. - Jack Dippel; Max Dupré la Tour; April Niu; Sanjukta Roy 001; Adrian Vetta (AAMAS, 2024)

Robot Positioning Using Torus Packing for Multisets. - Chung Shue Chen; Peter Keevash; Sean Kennedy; Élie de Panafieu; Adrian Vetta (ICALP, 2024)

Matrix Rationalization via Partial Orders. - Agnes Totschnig; Rohit Vasishta; Adrian Vetta (SAGT, 2024)

One n Remains to Settle the Tree Conjecture. - Jack Dippel; Adrian Vetta (STACS, 2024)

k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. - Max Dupré la Tour; Manuel Lafond; Ndiamé Ndiaye; Adrian Vetta (CoRR, 2024)

FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares. - Klaus Jansen; Alexandra Lassota; Malte Tutas; Adrian Vetta (CoRR, 2024)

The Condorcet Dimension of Metric Spaces. - Alexandra Lassota; Adrian Vetta; Bernhard von Stengel (CoRR, 2024)

A recursive measure of voting power that satisfies reasonable postulates. - Arash Abizadeh; Adrian Vetta (Games Econ. Behav., 2024)

Eliminating Majority Illusion Is Easy. - Jack Dippel; Max Dupré la Tour; April Niu; Sanjukta Roy 001; Adrian Vetta (AAAI, 2025)

k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. - Max Dupré la Tour; Manuel Lafond; Ndiamé Ndiaye; Adrian Vetta (ICALP, 2025)

Six Candidates Suffice to Win a Voter Majority. - Moses Charikar; Alexandra Lassota; Prasanna Ramakrishnan; Adrian Vetta; Kangning Wang 001 (STOC, 2025)

A Direct Proof of the Short-Side Advantage in Random Matching Markets. - Simon Mauras; Pawel Pralat; Adrian Vetta (CoRR, 2025)