| 2025 | AAAI | Eliminating Majority Illusion Is Easy. | Jack Dippel, Max Dupr la Tour, April Niu, Sanjukta Roy, Adrian Vetta |
| 2025 | ICALP | 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 |
| 2025 | STOC | Six Candidates Suffice to Win a Voter Majority. | Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang |
| 2024 | ICALP | Robot Positioning Using Torus Packing for Multisets. | Chung Shue Chen, Peter Keevash, Sean Kennedy, lie de Panafieu, Adrian Vetta |
| 2024 | STACS | One n Remains to Settle the Tree Conjecture. | Jack Dippel, Adrian Vetta |
| 2024 | SAGT | Matrix Rationalization via Partial Orders. | Agnes Totschnig, Rohit Vasishta, Adrian Vetta |
| 2023 | SAGT | Fair Algorithm Design: Fair and Efficacious Machine Scheduling. | April Niu, Agnes Totschnig, Adrian Vetta |
| 2022 | SAGT | An Improved Bound for the Tree Conjecture in Network Creation Games. | Jack Dippel, Adrian Vetta |
| 2021 | SAGT | The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions. | Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta |
| 2021 | SAGT | Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming. | Mete Seref Ahunbay, Adrian Vetta |
| 2021 | SAGT | Two Birds with One Stone: Fairness and Welfare via Transfers. | Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta |
| 2021 | SAGT | Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality? | Ndiam Ndiaye, Sergey Norin, Adrian Vetta |
| 2021 | SAGT | Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees. | Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta |
| 2020 | SAGT | Two-Buyer Sequential Multiunit Auctions with No Overbidding. | Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta |
| 2020 | SAGT | How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces. | Mashbat Suzuki, Adrian Vetta |
| 2019 | SAGT | The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential Auctions (But Almost Is). | Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta |
| 2019 | SAGT | Risk-Free Bidding in Complement-Free Combinatorial Auctions. | Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta |
| 2018 | SAGT | Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. | Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta |
| 2016 | SODA | On the Economic Efficiency of the Combinatorial Clock Auction. | Nicolas Bousquet, Yang Cai, Christoph Hunkenschrder, Adrian Vetta |
| 2015 | FOCS | Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. | F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong |
| 2015 | SAGT | The Combinatorial World (of Auctions) According to GARP. | Shant Boodaghians, Adrian Vetta |
| 2014 | AAAI | False-Name Bidding and Economic Efficiency in Combinatorial Auctions. | Colleen Alkalay-Houlihan, Adrian Vetta |
| 2012 | ALENEX | Clique Cover on Sparse Networks. | Mathieu Blanchette, Ethan Kim, Adrian Vetta |
| 2012 | ESA | Routing Regardless of Network Stability. | Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong |
| 2012 | SODA | Approximating rooted Steiner networks. | Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta |
| 2012 | SAGT | A Theoretical Examination of Practical Game Playing: Lookahead Search. | Vahab S. Mirrokni, Nithum Thain, Adrian Vetta |
| 2010 | SAGT | On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms. | Volodymyr Kuleshov, Adrian Vetta |
| 2007 | STOC | Degree-constrained network flows. | Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong |
| 2005 | FOCS | Nash Equilibria in Random Games. | Imre Brny, Santosh S. Vempala, Adrian Vetta |
| 2005 | FOCS | Sink Equilibria and Convergence. | Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta |
| 2005 | IPCO | Approximate Min-max Relations for Odd Cycles in Planar Graphs. | Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta |
| 2005 | STOC | Approximation algorithms for network design with metric costs. | Joseph Cheriyan, Adrian Vetta |
| 2004 | STOC | (Almost) tight bounds and existence theorems for confluent flows. | Jiangzhuo Chen, Robert D. Kleinberg, Lszl Lovsz, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta |
| 2002 | FOCS | Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. | Adrian Vetta |
| 2002 | IPCO | The Demand Matching Problem. | F. Bruce Shepherd, Adrian Vetta |
| 2002 | STOC | Approximation algorithms for minimum-cost k-vertex connected subgraphs. | Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta |
| 2001 | SODA | Approximating the minimum strongly connected subgraph via a matching lower bound. | Adrian Vetta |
| 2000 | FOCS | On Clusterings - Good, Bad and Spectral. | Ravi Kannan, Santosh S. Vempala, Adrian Vetta |