default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrian Vetta
Adrian R. Vetta
Person information
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c57]Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta:
Gerrymandering Planar Graphs. AAMAS 2024: 463-471- [c56]Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta:
Robot Positioning Using Torus Packing for Multisets. ICALP 2024: 43:1-43:18 - [c55]Agnes Totschnig
, Rohit Vasishta, Adrian Vetta:
Matrix Rationalization via Partial Orders. SAGT 2024: 461-479 - [c54]Jack Dippel, Adrian Vetta:
One n Remains to Settle the Tree Conjecture. STACS 2024: 28:1-28:16 - [i37]Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta:
Robot Positioning Using Torus Packing for Multisets. CoRR abs/2404.09981 (2024) - [i36]Agnes Totschnig, Rohit Vasishta, Adrian Vetta:
Matrix Rationalization via Partial Orders. CoRR abs/2405.20976 (2024) - [i35]Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye, Adrian Vetta:
k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. CoRR abs/2407.02412 (2024) - [i34]Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta:
Eliminating Majority Illusion is Easy. CoRR abs/2407.20187 (2024) - [i33]Klaus Jansen, Alexandra Lassota, Malte Tutas, Adrian Vetta:
FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares. CoRR abs/2409.04225 (2024) - 2023
- [j37]Arash Abizadeh, Adrian Vetta:
The blocker postulates for measures of voting power. Soc. Choice Welf. 60(4): 595-623 (2023) - [j36]Mete Seref Ahunbay, Adrian Vetta:
The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions. ACM Trans. Economics and Comput. 11: 2:1-2:26 (2023) - [c53]April Niu, Agnes Totschnig, Adrian Vetta:
Fair Algorithm Design: Fair and Efficacious Machine Scheduling. SAGT 2023: 239-256 - [c52]Margarida Carvalho, Alison Caulfield, Yi Lin, Adrian Vetta:
Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs. WINE 2023: 130-150 - [c51]Sissi Jiang, Ndiamé Ndiaye, Adrian Vetta, Eggie Wu:
The Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems. WINE 2023: 420-437 - [i32]Sissi Jiang, Ndiamé Ndiaye, Adrian Vetta, Eggie Wu:
The Price of Anarchy in One-Sided Allocation Problems with Multi-Unit Demand Agents. CoRR abs/2301.01367 (2023) - [i31]Margarida Carvalho, Alison Caulfield, Yi Lin, Adrian Vetta:
Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs. CoRR abs/2309.13421 (2023) - [i30]Jack Dippel, Adrian Vetta:
One n Remains to Settle the Tree Conjecture. CoRR abs/2310.08663 (2023) - [i29]Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta:
Gerrymandering Planar Graphs. CoRR abs/2312.14721 (2023) - 2022
- [j35]Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta:
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is). Theory Comput. Syst. 66(3): 546-580 (2022) - [j34]Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta:
Risk-Free Bidding in Complement-Free Combinatorial Auctions. Theory Comput. Syst. 66(3): 581-615 (2022) - [c50]Jack Dippel, Adrian Vetta:
An Improved Bound for the Tree Conjecture in Network Creation Games. SAGT 2022: 241-257 - [i28]April Niu, Agnes Totschnig, Adrian Vetta:
Fair Algorithm Design: Fair and Efficacious Machine Scheduling. CoRR abs/2204.06438 (2022) - [i27]Arash Abizadeh, Adrian Vetta:
A General Framework for a Class of Quarrels: The Quarrelling Paradox Revisited. CoRR abs/2205.08353 (2022) - 2021
- [j33]Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta:
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets. Discret. Optim. 42: 100671 (2021) - [j32]Zhentao Li, Adrian Vetta:
The Fair Division of Hereditary Set Systems. ACM Trans. Economics and Comput. 9(2): 12:1-12:19 (2021) - [c49]Julien Codsi, Adrian Vetta:
A Case Study in Learning in Metagames: Super Smash Bros. Melee. AIIDE 2021: 2-9 - [c48]Mete Seref Ahunbay, Adrian Vetta:
Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming. SAGT 2021: 3-17 - [c47]Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta:
The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions. SAGT 2021: 18-33 - [c46]Ndiamé Ndiaye, Sergey Norin, Adrian Vetta:
Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality? SAGT 2021: 281-295 - [c45]Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta:
Two Birds with One Stone: Fairness and Welfare via Transfers. SAGT 2021: 376-390 - [c44]Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta:
Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees. SAGT 2021: 391-405 - [i26]Mete Seref Ahunbay, Adrian Vetta:
Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming. CoRR abs/2103.00235 (2021) - [i25]Arash Abizadeh, Adrian Vetta:
A Recursive Measure of Voting Power that Satisfies Reasonable Postulates. CoRR abs/2105.03006 (2021) - [i24]Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta:
Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees. CoRR abs/2105.05142 (2021) - [i23]Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta:
Two Birds With One Stone: Fairness and Welfare via Transfers. CoRR abs/2106.00841 (2021) - [i22]Jack Dippel, Adrian Vetta:
An Improved Bound for the Tree Conjecture in Network Creation Games. CoRR abs/2106.05175 (2021) - [i21]Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta:
Risk-Free Bidding in Complement-Free Combinatorial Auctions. CoRR abs/2111.14654 (2021) - 2020
- [c43]Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta:
Two-Buyer Sequential Multiunit Auctions with No Overbidding. SAGT 2020: 3-16 - [c42]Mashbat Suzuki, Adrian Vetta:
How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces. SAGT 2020: 322-336 - [c41]Johannes Brustle, Jack Dippel, Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta:
One Dollar Each Eliminates Envy. EC 2020: 23-39 - [c40]Mete Seref Ahunbay, Adrian Vetta:
The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions. WINE 2020: 147-161 - [i20]Mashbat Suzuki, Adrian Vetta:
How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces. CoRR abs/2005.12505 (2020) - [i19]Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta:
Two-Buyer Sequential Multiunit Auctions with No Overbidding. CoRR abs/2006.03142 (2020) - [i18]Mete Seref Ahunbay, Adrian Vetta:
The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions. CoRR abs/2007.10131 (2020)
2010 – 2019
- 2019
- [j31]Gerardo Berbeglia, Gautam Rayaprolu, Adrian Vetta:
Pricing policies for selling indivisible storable goods to strategic consumers. Ann. Oper. Res. 274(1-2): 131-154 (2019) - [j30]Juli Atherton, Derek Ruths, Adrian Vetta:
Computation in Causal Graphs. J. Graph Algorithms Appl. 23(2): 317-344 (2019) - [j29]Christoph Hunkenschröder, Santosh S. Vempala, Adrian Vetta:
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem. ACM Trans. Algorithms 15(4): 55:1-55:28 (2019) - [c39]Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta:
The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential Auctions (But Almost Is). SAGT 2019: 109-122 - [c38]Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta:
Risk-Free Bidding in Complement-Free Combinatorial Auctions. SAGT 2019: 123-136 - [i17]Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta:
The Declining Price Anomaly is not Universal in Multi-Buyer Sequential Auctions (but almost is). CoRR abs/1905.00853 (2019) - [i16]Johannes Brustle, Jack Dippel, Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta:
One Dollar Each Eliminates Envy. CoRR abs/1912.02797 (2019) - 2018
- [c37]Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta:
Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. SAGT 2018: 267-271 - [c36]Max Dupré la Tour, Adrian Vetta:
The Combinatorial Clock Auction: the Effects of Strategic Behaviour and the Price Increment Rule on Social Welfare. EC 2018: 91-108 - [c35]Zhentao Li, Adrian Vetta:
The Fair Division of Hereditary Set Systems. WINE 2018: 297-311 - [i15]Zhentao Li, Adrian Vetta:
The Fair Division of Hereditary Set Systems. CoRR abs/1812.09561 (2018) - 2017
- [j28]F. Bruce Shepherd, Adrian R. Vetta:
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. Theory Comput. 13(1): 1-25 (2017) - 2016
- [c34]Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta:
On the Economic Efficiency of the Combinatorial Clock Auction. SODA 2016: 1407-1423 - [e1]Yang Cai, Adrian Vetta:
Web and Internet Economics - 12th International Conference, WINE 2016, Montreal, Canada, December 11-14, 2016, Proceedings. Lecture Notes in Computer Science 10123, Springer 2016, ISBN 978-3-662-54109-8 [contents] - 2015
- [j27]Gwenaël Joret, Adrian Vetta:
Reducing the rank of a matroid. Discret. Math. Theor. Comput. Sci. 17(2): 143-156 (2015) - [c33]Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu:
Large Supports are Required for Well-Supported Nash Equilibria. APPROX-RANDOM 2015: 78-84 - [c32]F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong:
Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. FOCS 2015: 748-758 - [c31]Shant Boodaghians, Adrian Vetta:
The Combinatorial World (of Auctions) According to GARP. SAGT 2015: 125-136 - [c30]Nicolas Bousquet, Zhentao Li, Adrian Vetta:
Coalition Games on Interaction Graphs: A Horticultural Perspective. EC 2015: 95-112 - [c29]Shant Boodaghians, Adrian Vetta:
Testing Consumer Rationality Using Perfect Graphs and Oriented Discs. WINE 2015: 187-200 - [c28]Nicolas Bousquet, Yang Cai, Adrian Vetta:
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction. WINE 2015: 216-229 - [i14]Nicolas Bousquet, Zhentao Li, Adrian Vetta:
Coalition Games on Interaction Graphs: A Horticultural Perspective. CoRR abs/1502.07713 (2015) - [i13]F. Bruce Shepherd, Adrian Vetta:
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. CoRR abs/1504.00627 (2015) - [i12]Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu:
Large Supports are required for Well-Supported Nash Equilibria. CoRR abs/1504.03602 (2015) - [i11]Shant Boodaghians, Adrian Vetta:
The Combinatorial World (of Auctions) According to GARP. CoRR abs/1505.00508 (2015) - [i10]Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta:
On the Economic Efficiency of the Combinatorial Clock Auction. CoRR abs/1507.06495 (2015) - [i9]Shant Boodaghians, Adrian Vetta:
Testing Consumer Rationality using Perfect Graphs and Oriented Discs. CoRR abs/1507.07581 (2015) - [i8]Gerardo Berbeglia, Gautam Rayaprolu, Adrian Vetta:
The Storable Good Monopoly Problem with Indivisible Demand. CoRR abs/1509.07330 (2015) - [i7]Nicolas Bousquet, Yang Cai, Adrian Vetta:
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction. CoRR abs/1510.00295 (2015) - 2014
- [j26]Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. Algorithmica 70(3): 561-593 (2014) - [j25]Zhentao Li, Manikandan Narayanan, Adrian Vetta:
The Complexity of the Simultaneous Cluster Problem. J. Graph Algorithms Appl. 18(1): 1-34 (2014) - [j24]Gerardo Berbeglia, Peter Sloan, Adrian Vetta:
Pricing mechanisms for a durable good monopolist. SIGMETRICS Perform. Evaluation Rev. 41(4): 50 (2014) - [j23]Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Approximating Rooted Steiner Networks. ACM Trans. Algorithms 11(2): 8:1-8:22 (2014) - [c27]Colleen Alkalay-Houlihan, Adrian Vetta:
False-Name Bidding and Economic Efficiency in Combinatorial Auctions. AAAI 2014: 538-544 - [c26]Huining Hu, Zhentao Li, Adrian R. Vetta:
Randomized Experimental Design for Causal Graph Discovery. NIPS 2014: 2339-2347 - [c25]Nicolas Bousquet, Sergey Norin, Adrian Vetta:
A Near-Optimal Mechanism for Impartial Selection. WINE 2014: 133-146 - [c24]Gerardo Berbeglia, Peter Sloan, Adrian Vetta:
Bounds on the Profitability of a Durable Good Monopolist. WINE 2014: 292-293 - [c23]Ruta Mehta, Nithum Thain, László A. Végh, Adrian Vetta:
To Save Or Not To Save: The Fisher Game. WINE 2014: 294-307 - [i6]Nicolas Bousquet, Sergey Norin, Adrian Vetta:
A Near-Optimal Mechanism for Impartial Selection. CoRR abs/1407.8535 (2014) - [i5]Gerardo Berbeglia, Peter Sloan, Adrian Vetta:
Bounds on the Profitability of a Durable Good Monopolist. CoRR abs/1409.7979 (2014) - 2013
- [c22]Yogesh Anbalagan, Sergey Norin, Rahul Savani, Adrian Vetta:
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3. WINE 2013: 15-23 - [i4]Yogesh Anbalagan, Sergey Norin, Rahul Savani, Adrian Vetta:
Polylogarithmic Supports are required for Approximate Well-Supported Nash Equilibria below 2/3. CoRR abs/1309.7258 (2013) - 2012
- [c21]Mathieu Blanchette, Ethan Kim, Adrian Vetta:
Clique Cover on Sparse Networks. ALENEX 2012: 93-102 - [c20]Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. ESA 2012: 719-730 - [c19]Vahab S. Mirrokni, Nithum Thain, Adrian Vetta:
A Theoretical Examination of Practical Game Playing: Lookahead Search. SAGT 2012: 251-262 - [c18]Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Approximating rooted Steiner networks. SODA 2012: 1499-1511 - [c17]Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Non-redistributive Second Welfare Theorems. WINE 2012: 227-243 - [i3]Vahab S. Mirrokni, Nithum Thain, Adrian Vetta:
On the Implications of Lookahead Search in Game Playing. CoRR abs/1202.4134 (2012) - [i2]Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. CoRR abs/1207.0043 (2012) - [i1]Gwenaël Joret, Adrian Vetta:
Reducing the rank of a matroid. CoRR abs/1211.4853 (2012) - 2010
- [j22]Ethan Kim, Ashish Sabharwal, Adrian Vetta, Mathieu Blanchette:
Predicting direct protein interactions from affinity purification mass spectrometry data. Algorithms Mol. Biol. 5: 34 (2010) - [j21]Nicolas Sonnerat, Adrian Vetta:
Galaxy cutsets in graphs. J. Comb. Optim. 19(3): 415-427 (2010) - [j20]Zhentao Li, Adrian Vetta:
Bounds on the cleaning times of robot vacuums. Oper. Res. Lett. 38(1): 69-71 (2010) - [j19]Manikandan Narayanan, Adrian Vetta, Eric E. Schadt, Jun Zhu:
Simultaneous Clustering of Multiple Gene Expression and Physical Interaction Datasets. PLoS Comput. Biol. 6(4) (2010) - [j18]Matthew Drescher, Adrian Vetta:
An approximation algorithm for the maximum leaf spanning arborescence problem. ACM Trans. Algorithms 6(3): 46:1-46:18 (2010) - [c16]Guyslain Naves, Nicolas Sonnerat, Adrian Vetta:
Maximum Flows on Disjoint Paths. APPROX-RANDOM 2010: 326-337 - [c15]Volodymyr Kuleshov, Adrian Vetta:
On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms. SAGT 2010: 246-261
2000 – 2009
- 2009
- [j17]Nicolas Sonnerat, Adrian Vetta:
Defending Planar Graphs against Star-Cutsets. Electron. Notes Discret. Math. 34: 107-111 (2009) - [j16]Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory B 99(1): 20-29 (2009) - [c14]Nithum Thain, Adrian Vetta:
Computational Aspects of Multimarket Price Wars. WINE 2009: 304-315 - 2008
- [j15]Babak Farzad, Neil Olver, Adrian Vetta:
A Priority-Based Model of Routing. Chic. J. Theor. Comput. Sci. 2008 (2008) - [j14]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Discret. Appl. Math. 156(7): 1175-1180 (2008) - 2007
- [j13]Andrew D. King, Bruce A. Reed, Adrian Vetta:
An upper bound for the chromatic number of line graphs. Eur. J. Comb. 28(8): 2182-2187 (2007) - [j12]Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta:
(Almost) Tight bounds and existence theorems for single-commodity confluent flows. J. ACM 54(4): 16 (2007) - [j11]Louigi Addario-Berry, Neil Olver, Adrian Vetta:
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. J. Graph Algorithms Appl. 11(1): 309-319 (2007) - [j10]F. Bruce Shepherd, Adrian Vetta:
The Demand-Matching Problem. Math. Oper. Res. 32(3): 563-578 (2007) - [j9]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1): 71-91 (2007) - [j8]Imre Bárány, Santosh S. Vempala, Adrian Vetta:
Nash equilibria in random games. Random Struct. Algorithms 31(4): 391-405 (2007) - [j7]Joseph Cheriyan, Adrian Vetta:
Approximation Algorithms for Network Design with Metric Costs. SIAM J. Discret. Math. 21(3): 612-636 (2007) - [c13]Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong:
Degree-constrained network flows. STOC 2007: 681-688 - 2006
- [j6]Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta:
Network Design Via Iterative Rounding Of Setpair Relaxations. Comb. 26(3): 255-275 (2006) - 2005
- [j5]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Electron. Notes Discret. Math. 19: 265-271 (2005) - [c12]Imre Bárány, Santosh S. Vempala, Adrian Vetta:
Nash Equilibria in Random Games. FOCS 2005: 123-131 - [c11]Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta:
Sink Equilibria and Convergence. FOCS 2005: 142-154 - [c10]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO 2005: 35-50 - [c9]Joseph Cheriyan, Adrian Vetta:
Approximation algorithms for network design with metric costs. STOC 2005: 167-175 - 2004
- [j4]Ravi Kannan, Santosh S. Vempala, Adrian Vetta:
On clusterings: Good, bad and spectral. J. ACM 51(3): 497-515 (2004) - [j3]F. Bruce Shepherd, Adrian Vetta:
Lighting fibers in a dark network. IEEE J. Sel. Areas Commun. 22(9): 1583-1588 (2004) - [j2]Bruce A. Reed, Kaleigh Smith, Adrian Vetta:
Finding odd cycle transversals. Oper. Res. Lett. 32(4): 299-301 (2004) - [c8]Vahab S. Mirrokni, Adrian Vetta:
Convergence Issues in Competitive Games. APPROX-RANDOM 2004: 183-194 - [c7]Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta:
(Almost) tight bounds and existence theorems for confluent flows. STOC 2004: 529-538 - 2003
- [j1]Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta:
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. SIAM J. Comput. 32(4): 1050-1055 (2003) - 2002
- [c6]Adrian Vetta:
Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. FOCS 2002: 416- - [c5]F. Bruce Shepherd, Adrian Vetta:
The Demand Matching Problem. IPCO 2002: 457-474 - [c4]Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta:
Approximation algorithms for minimum-cost k-vertex connected subgraphs. STOC 2002: 306-312 - 2001
- [c3]Adrian Vetta:
Approximating the minimum strongly connected subgraph via a matching lower bound. SODA 2001: 417-426 - 2000
- [c2]Santosh S. Vempala, Adrian Vetta:
Factor 4/3 approximations for minimum 2-connected subgraphs. APPROX 2000: 262-273 - [c1]Ravi Kannan, Santosh S. Vempala, Adrian Vetta:
On Clusterings - Good, Bad and Spectral. FOCS 2000: 367-377
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
