BibTeX records: Adrian Vetta

download as .bib file

@inproceedings{DBLP:conf/stacs/DippelV24,
  author       = {Jack Dippel and
                  Adrian Vetta},
  editor       = {Olaf Beyersdorff and
                  Mamadou Moustapha Kant{\'{e}} and
                  Orna Kupferman and
                  Daniel Lokshtanov},
  title        = {One n Remains to Settle the Tree Conjecture},
  booktitle    = {41st International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
  series       = {LIPIcs},
  volume       = {289},
  pages        = {28:1--28:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2024.28},
  doi          = {10.4230/LIPICS.STACS.2024.28},
  timestamp    = {Mon, 11 Mar 2024 15:43:27 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/DippelV24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scw/AbizadehV23,
  author       = {Arash Abizadeh and
                  Adrian Vetta},
  title        = {The blocker postulates for measures of voting power},
  journal      = {Soc. Choice Welf.},
  volume       = {60},
  number       = {4},
  pages        = {595--623},
  year         = {2023},
  url          = {https://doi.org/10.1007/s00355-022-01428-0},
  doi          = {10.1007/S00355-022-01428-0},
  timestamp    = {Fri, 02 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/scw/AbizadehV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/AhunbayV23,
  author       = {Mete Seref Ahunbay and
                  Adrian Vetta},
  title        = {The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions},
  journal      = {{ACM} Trans. Economics and Comput.},
  volume       = {11},
  pages        = {2:1--2:26},
  year         = {2023},
  url          = {https://doi.org/10.1145/3584864},
  doi          = {10.1145/3584864},
  timestamp    = {Fri, 21 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/teco/AhunbayV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/NiuTV23,
  author       = {April Niu and
                  Agnes Totschnig and
                  Adrian Vetta},
  editor       = {Argyrios Deligkas and
                  Aris Filos{-}Ratsikas},
  title        = {Fair Algorithm Design: Fair and Efficacious Machine Scheduling},
  booktitle    = {Algorithmic Game Theory - 16th International Symposium, {SAGT} 2023,
                  Egham, UK, September 4-7, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14238},
  pages        = {239--256},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-43254-5\_14},
  doi          = {10.1007/978-3-031-43254-5\_14},
  timestamp    = {Sun, 24 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/NiuTV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/CarvalhoCLV23,
  author       = {Margarida Carvalho and
                  Alison Caulfield and
                  Yi Lin and
                  Adrian Vetta},
  editor       = {Jugal Garg and
                  Max Klimm and
                  Yuqing Kong},
  title        = {Penalties and Rewards for Fair Learning in Paired Kidney Exchange
                  Programs},
  booktitle    = {Web and Internet Economics - 19th International Conference, {WINE}
                  2023, Shanghai, China, December 4-8, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14413},
  pages        = {130--150},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-48974-7\_8},
  doi          = {10.1007/978-3-031-48974-7\_8},
  timestamp    = {Thu, 11 Jan 2024 22:28:03 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/CarvalhoCLV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/JiangNVW23,
  author       = {Sissi Jiang and
                  Ndiam{\'{e}} Ndiaye and
                  Adrian Vetta and
                  Eggie Wu},
  editor       = {Jugal Garg and
                  Max Klimm and
                  Yuqing Kong},
  title        = {The Price of Anarchy of Probabilistic Serial in One-Sided Allocation
                  Problems},
  booktitle    = {Web and Internet Economics - 19th International Conference, {WINE}
                  2023, Shanghai, China, December 4-8, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14413},
  pages        = {420--437},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-48974-7\_24},
  doi          = {10.1007/978-3-031-48974-7\_24},
  timestamp    = {Sat, 13 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/JiangNVW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-01367,
  author       = {Sissi Jiang and
                  Ndiam{\'{e}} Ndiaye and
                  Adrian Vetta and
                  Eggie Wu},
  title        = {The Price of Anarchy in One-Sided Allocation Problems with Multi-Unit
                  Demand Agents},
  journal      = {CoRR},
  volume       = {abs/2301.01367},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2301.01367},
  doi          = {10.48550/ARXIV.2301.01367},
  eprinttype    = {arXiv},
  eprint       = {2301.01367},
  timestamp    = {Tue, 10 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2301-01367.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-13421,
  author       = {Margarida Carvalho and
                  Alison Caulfield and
                  Yi Lin and
                  Adrian Vetta},
  title        = {Penalties and Rewards for Fair Learning in Paired Kidney Exchange
                  Programs},
  journal      = {CoRR},
  volume       = {abs/2309.13421},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2309.13421},
  doi          = {10.48550/ARXIV.2309.13421},
  eprinttype    = {arXiv},
  eprint       = {2309.13421},
  timestamp    = {Mon, 16 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-13421.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-08663,
  author       = {Jack Dippel and
                  Adrian Vetta},
  title        = {One n Remains to Settle the Tree Conjecture},
  journal      = {CoRR},
  volume       = {abs/2310.08663},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.08663},
  doi          = {10.48550/ARXIV.2310.08663},
  eprinttype    = {arXiv},
  eprint       = {2310.08663},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-08663.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-14721,
  author       = {Jack Dippel and
                  Max Dupr{\'{e}} la Tour and
                  April Niu and
                  Sanjukta Roy and
                  Adrian Vetta},
  title        = {Gerrymandering Planar Graphs},
  journal      = {CoRR},
  volume       = {abs/2312.14721},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2312.14721},
  doi          = {10.48550/ARXIV.2312.14721},
  eprinttype    = {arXiv},
  eprint       = {2312.14721},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2312-14721.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/NarayanPV22,
  author       = {Vishnu V. Narayan and
                  Enguerrand Prebet and
                  Adrian Vetta},
  title        = {The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential
                  Auctions (but almost is)},
  journal      = {Theory Comput. Syst.},
  volume       = {66},
  number       = {3},
  pages        = {546--580},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00224-021-10059-4},
  doi          = {10.1007/S00224-021-10059-4},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/NarayanPV22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/NarayanRV22,
  author       = {Vishnu V. Narayan and
                  Gautam Rayaprolu and
                  Adrian Vetta},
  title        = {Risk-Free Bidding in Complement-Free Combinatorial Auctions},
  journal      = {Theory Comput. Syst.},
  volume       = {66},
  number       = {3},
  pages        = {581--615},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00224-021-10068-3},
  doi          = {10.1007/S00224-021-10068-3},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/NarayanRV22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/DippelV22,
  author       = {Jack Dippel and
                  Adrian Vetta},
  editor       = {Panagiotis Kanellopoulos and
                  Maria Kyropoulou and
                  Alexandros A. Voudouris},
  title        = {An Improved Bound for the Tree Conjecture in Network Creation Games},
  booktitle    = {Algorithmic Game Theory - 15th International Symposium, {SAGT} 2022,
                  Colchester, UK, September 12-15, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13584},
  pages        = {241--257},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-15714-1\_14},
  doi          = {10.1007/978-3-031-15714-1\_14},
  timestamp    = {Thu, 22 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/DippelV22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-06438,
  author       = {April Niu and
                  Agnes Totschnig and
                  Adrian Vetta},
  title        = {Fair Algorithm Design: Fair and Efficacious Machine Scheduling},
  journal      = {CoRR},
  volume       = {abs/2204.06438},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2204.06438},
  doi          = {10.48550/ARXIV.2204.06438},
  eprinttype    = {arXiv},
  eprint       = {2204.06438},
  timestamp    = {Tue, 19 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-06438.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-08353,
  author       = {Arash Abizadeh and
                  Adrian Vetta},
  title        = {A General Framework for a Class of Quarrels: The Quarrelling Paradox
                  Revisited},
  journal      = {CoRR},
  volume       = {abs/2205.08353},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2205.08353},
  doi          = {10.48550/ARXIV.2205.08353},
  eprinttype    = {arXiv},
  eprint       = {2205.08353},
  timestamp    = {Tue, 24 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2205-08353.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BerbegliaBV21,
  author       = {Gerardo Berbeglia and
                  Shant Boodaghians and
                  Adrian Vetta},
  title        = {Tight bounds on the relative performances of pricing optimization
                  mechanisms in storable good markets},
  journal      = {Discret. Optim.},
  volume       = {42},
  pages        = {100671},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.disopt.2021.100671},
  doi          = {10.1016/J.DISOPT.2021.100671},
  timestamp    = {Wed, 15 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BerbegliaBV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/LiV21,
  author       = {Zhentao Li and
                  Adrian Vetta},
  title        = {The Fair Division of Hereditary Set Systems},
  journal      = {{ACM} Trans. Economics and Comput.},
  volume       = {9},
  number       = {2},
  pages        = {12:1--12:19},
  year         = {2021},
  url          = {https://doi.org/10.1145/3434410},
  doi          = {10.1145/3434410},
  timestamp    = {Tue, 15 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/teco/LiV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aiide/CodsiV21,
  author       = {Julien Codsi and
                  Adrian Vetta},
  editor       = {David Thue and
                  Stephen G. Ware},
  title        = {A Case Study in Learning in Metagames: Super Smash Bros. Melee},
  booktitle    = {Proceedings of the Seventeenth {AAAI} Conference on Artificial Intelligence
                  and Interactive Digital Entertainment, {AIIDE} 2021, virtual, October
                  11-15, 2021},
  pages        = {2--9},
  publisher    = {{AAAI} Press},
  year         = {2021},
  url          = {https://ojs.aaai.org/index.php/AIIDE/article/view/18884},
  timestamp    = {Thu, 20 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/aiide/CodsiV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/AhunbayV21,
  author       = {Mete Seref Ahunbay and
                  Adrian Vetta},
  editor       = {Ioannis Caragiannis and
                  Kristoffer Arnsfelt Hansen},
  title        = {Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming},
  booktitle    = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
                  Aarhus, Denmark, September 21-24, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12885},
  pages        = {3--17},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-85947-3\_1},
  doi          = {10.1007/978-3-030-85947-3\_1},
  timestamp    = {Wed, 15 Sep 2021 18:38:46 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/AhunbayV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/AhunbayLV21,
  author       = {Mete Seref Ahunbay and
                  Brendan Lucier and
                  Adrian Vetta},
  editor       = {Ioannis Caragiannis and
                  Kristoffer Arnsfelt Hansen},
  title        = {The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential
                  Auctions},
  booktitle    = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
                  Aarhus, Denmark, September 21-24, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12885},
  pages        = {18--33},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-85947-3\_2},
  doi          = {10.1007/978-3-030-85947-3\_2},
  timestamp    = {Wed, 15 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/AhunbayLV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/NdiayeNV21,
  author       = {Ndiam{\'{e}} Ndiaye and
                  Sergey Norin and
                  Adrian Vetta},
  editor       = {Ioannis Caragiannis and
                  Kristoffer Arnsfelt Hansen},
  title        = {Descending the Stable Matching Lattice: How Many Strategic Agents
                  Are Required to Turn Pessimality to Optimality?},
  booktitle    = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
                  Aarhus, Denmark, September 21-24, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12885},
  pages        = {281--295},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-85947-3\_19},
  doi          = {10.1007/978-3-030-85947-3\_19},
  timestamp    = {Wed, 15 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/NdiayeNV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/NarayanSV21,
  author       = {Vishnu V. Narayan and
                  Mashbat Suzuki and
                  Adrian Vetta},
  editor       = {Ioannis Caragiannis and
                  Kristoffer Arnsfelt Hansen},
  title        = {Two Birds with One Stone: Fairness and Welfare via Transfers},
  booktitle    = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
                  Aarhus, Denmark, September 21-24, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12885},
  pages        = {376--390},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-85947-3\_25},
  doi          = {10.1007/978-3-030-85947-3\_25},
  timestamp    = {Wed, 15 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/NarayanSV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/NoelSV21,
  author       = {Jonathan A. Noel and
                  Mashbat Suzuki and
                  Adrian Vetta},
  editor       = {Ioannis Caragiannis and
                  Kristoffer Arnsfelt Hansen},
  title        = {Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees},
  booktitle    = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
                  Aarhus, Denmark, September 21-24, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12885},
  pages        = {391--405},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-85947-3\_26},
  doi          = {10.1007/978-3-030-85947-3\_26},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/NoelSV21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-00235,
  author       = {Mete Seref Ahunbay and
                  Adrian Vetta},
  title        = {Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming},
  journal      = {CoRR},
  volume       = {abs/2103.00235},
  year         = {2021},
  url          = {https://arxiv.org/abs/2103.00235},
  eprinttype    = {arXiv},
  eprint       = {2103.00235},
  timestamp    = {Thu, 04 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-00235.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-03006,
  author       = {Arash Abizadeh and
                  Adrian Vetta},
  title        = {A Recursive Measure of Voting Power that Satisfies Reasonable Postulates},
  journal      = {CoRR},
  volume       = {abs/2105.03006},
  year         = {2021},
  url          = {https://arxiv.org/abs/2105.03006},
  eprinttype    = {arXiv},
  eprint       = {2105.03006},
  timestamp    = {Fri, 14 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2105-03006.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-05142,
  author       = {Jonathan A. Noel and
                  Mashbat Suzuki and
                  Adrian Vetta},
  title        = {Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees},
  journal      = {CoRR},
  volume       = {abs/2105.05142},
  year         = {2021},
  url          = {https://arxiv.org/abs/2105.05142},
  eprinttype    = {arXiv},
  eprint       = {2105.05142},
  timestamp    = {Fri, 14 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2105-05142.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-00841,
  author       = {Vishnu V. Narayan and
                  Mashbat Suzuki and
                  Adrian Vetta},
  title        = {Two Birds With One Stone: Fairness and Welfare via Transfers},
  journal      = {CoRR},
  volume       = {abs/2106.00841},
  year         = {2021},
  url          = {https://arxiv.org/abs/2106.00841},
  eprinttype    = {arXiv},
  eprint       = {2106.00841},
  timestamp    = {Wed, 09 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-00841.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-05175,
  author       = {Jack Dippel and
                  Adrian Vetta},
  title        = {An Improved Bound for the Tree Conjecture in Network Creation Games},
  journal      = {CoRR},
  volume       = {abs/2106.05175},
  year         = {2021},
  url          = {https://arxiv.org/abs/2106.05175},
  eprinttype    = {arXiv},
  eprint       = {2106.05175},
  timestamp    = {Tue, 15 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-05175.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-14654,
  author       = {Vishnu V. Narayan and
                  Gautam Rayaprolu and
                  Adrian Vetta},
  title        = {Risk-Free Bidding in Complement-Free Combinatorial Auctions},
  journal      = {CoRR},
  volume       = {abs/2111.14654},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.14654},
  eprinttype    = {arXiv},
  eprint       = {2111.14654},
  timestamp    = {Wed, 01 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-14654.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/AhunbayLV20,
  author       = {Mete Seref Ahunbay and
                  Brendan Lucier and
                  Adrian Vetta},
  editor       = {Tobias Harks and
                  Max Klimm},
  title        = {Two-Buyer Sequential Multiunit Auctions with No Overbidding},
  booktitle    = {Algorithmic Game Theory - 13th International Symposium, {SAGT} 2020,
                  Augsburg, Germany, September 16-18, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12283},
  pages        = {3--16},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-57980-7\_1},
  doi          = {10.1007/978-3-030-57980-7\_1},
  timestamp    = {Thu, 10 Sep 2020 16:38:24 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/AhunbayLV20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/SuzukiV20,
  author       = {Mashbat Suzuki and
                  Adrian Vetta},
  editor       = {Tobias Harks and
                  Max Klimm},
  title        = {How Many Freemasons Are There? The Consensus Voting Mechanism in Metric
                  Spaces},
  booktitle    = {Algorithmic Game Theory - 13th International Symposium, {SAGT} 2020,
                  Augsburg, Germany, September 16-18, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12283},
  pages        = {322--336},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-57980-7\_21},
  doi          = {10.1007/978-3-030-57980-7\_21},
  timestamp    = {Thu, 10 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/SuzukiV20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/BrustleDNSV20,
  author       = {Johannes Brustle and
                  Jack Dippel and
                  Vishnu V. Narayan and
                  Mashbat Suzuki and
                  Adrian Vetta},
  editor       = {P{\'{e}}ter Bir{\'{o}} and
                  Jason D. Hartline and
                  Michael Ostrovsky and
                  Ariel D. Procaccia},
  title        = {One Dollar Each Eliminates Envy},
  booktitle    = {{EC} '20: The 21st {ACM} Conference on Economics and Computation,
                  Virtual Event, Hungary, July 13-17, 2020},
  pages        = {23--39},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3391403.3399447},
  doi          = {10.1145/3391403.3399447},
  timestamp    = {Fri, 09 Feb 2024 20:36:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sigecom/BrustleDNSV20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/AhunbayV20,
  author       = {Mete Seref Ahunbay and
                  Adrian Vetta},
  editor       = {Xujin Chen and
                  Nikolai Gravin and
                  Martin Hoefer and
                  Ruta Mehta},
  title        = {The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions},
  booktitle    = {Web and Internet Economics - 16th International Conference, {WINE}
                  2020, Beijing, China, December 7-11, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12495},
  pages        = {147--161},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-64946-3\_11},
  doi          = {10.1007/978-3-030-64946-3\_11},
  timestamp    = {Fri, 26 Mar 2021 08:28:34 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/AhunbayV20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-12505,
  author       = {Mashbat Suzuki and
                  Adrian Vetta},
  title        = {How Many Freemasons Are There? The Consensus Voting Mechanism in Metric
                  Spaces},
  journal      = {CoRR},
  volume       = {abs/2005.12505},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.12505},
  eprinttype    = {arXiv},
  eprint       = {2005.12505},
  timestamp    = {Thu, 28 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-12505.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-03142,
  author       = {Mete Seref Ahunbay and
                  Brendan Lucier and
                  Adrian Vetta},
  title        = {Two-Buyer Sequential Multiunit Auctions with No Overbidding},
  journal      = {CoRR},
  volume       = {abs/2006.03142},
  year         = {2020},
  url          = {https://arxiv.org/abs/2006.03142},
  eprinttype    = {arXiv},
  eprint       = {2006.03142},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2006-03142.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-10131,
  author       = {Mete Seref Ahunbay and
                  Adrian Vetta},
  title        = {The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions},
  journal      = {CoRR},
  volume       = {abs/2007.10131},
  year         = {2020},
  url          = {https://arxiv.org/abs/2007.10131},
  eprinttype    = {arXiv},
  eprint       = {2007.10131},
  timestamp    = {Tue, 28 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2007-10131.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BerbegliaRV19,
  author       = {Gerardo Berbeglia and
                  Gautam Rayaprolu and
                  Adrian Vetta},
  title        = {Pricing policies for selling indivisible storable goods to strategic
                  consumers},
  journal      = {Ann. Oper. Res.},
  volume       = {274},
  number       = {1-2},
  pages        = {131--154},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10479-018-2916-x},
  doi          = {10.1007/S10479-018-2916-X},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/anor/BerbegliaRV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AthertonRV19,
  author       = {Juli Atherton and
                  Derek Ruths and
                  Adrian Vetta},
  title        = {Computation in Causal Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {23},
  number       = {2},
  pages        = {317--344},
  year         = {2019},
  url          = {https://doi.org/10.7155/jgaa.00493},
  doi          = {10.7155/JGAA.00493},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/AthertonRV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HunkenschroderV19,
  author       = {Christoph Hunkenschr{\"{o}}der and
                  Santosh S. Vempala and
                  Adrian Vetta},
  title        = {A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph
                  Problem},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {15},
  number       = {4},
  pages        = {55:1--55:28},
  year         = {2019},
  url          = {https://doi.org/10.1145/3341599},
  doi          = {10.1145/3341599},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/HunkenschroderV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/NarayanPV19,
  author       = {Vishnu V. Narayan and
                  Enguerrand Prebet and
                  Adrian Vetta},
  editor       = {Dimitris Fotakis and
                  Evangelos Markakis},
  title        = {The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential
                  Auctions (But Almost Is)},
  booktitle    = {Algorithmic Game Theory - 12th International Symposium, {SAGT} 2019,
                  Athens, Greece, September 30 - October 3, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11801},
  pages        = {109--122},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-30473-7\_8},
  doi          = {10.1007/978-3-030-30473-7\_8},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/NarayanPV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/NarayanRV19,
  author       = {Vishnu V. Narayan and
                  Gautam Rayaprolu and
                  Adrian Vetta},
  editor       = {Dimitris Fotakis and
                  Evangelos Markakis},
  title        = {Risk-Free Bidding in Complement-Free Combinatorial Auctions},
  booktitle    = {Algorithmic Game Theory - 12th International Symposium, {SAGT} 2019,
                  Athens, Greece, September 30 - October 3, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11801},
  pages        = {123--136},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-30473-7\_9},
  doi          = {10.1007/978-3-030-30473-7\_9},
  timestamp    = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/NarayanRV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00853,
  author       = {Vishnu V. Narayan and
                  Enguerrand Prebet and
                  Adrian Vetta},
  title        = {The Declining Price Anomaly is not Universal in Multi-Buyer Sequential
                  Auctions (but almost is)},
  journal      = {CoRR},
  volume       = {abs/1905.00853},
  year         = {2019},
  url          = {http://arxiv.org/abs/1905.00853},
  eprinttype    = {arXiv},
  eprint       = {1905.00853},
  timestamp    = {Mon, 27 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-00853.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-02797,
  author       = {Johannes Brustle and
                  Jack Dippel and
                  Vishnu V. Narayan and
                  Mashbat Suzuki and
                  Adrian Vetta},
  title        = {One Dollar Each Eliminates Envy},
  journal      = {CoRR},
  volume       = {abs/1912.02797},
  year         = {2019},
  url          = {http://arxiv.org/abs/1912.02797},
  eprinttype    = {arXiv},
  eprint       = {1912.02797},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1912-02797.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BerbegliaBV18,
  author       = {Gerardo Berbeglia and
                  Shant Boodaghians and
                  Adrian Vetta},
  editor       = {Xiaotie Deng},
  title        = {Tight Bounds on the Relative Performances of Pricing Mechanisms in
                  Storable Good Markets},
  booktitle    = {Algorithmic Game Theory - 11th International Symposium, {SAGT} 2018,
                  Beijing, China, September 11-14, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11059},
  pages        = {267--271},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-99660-8\_26},
  doi          = {10.1007/978-3-319-99660-8\_26},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/BerbegliaBV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/TourV18,
  author       = {Max Dupr{\'{e}} la Tour and
                  Adrian Vetta},
  editor       = {{\'{E}}va Tardos and
                  Edith Elkind and
                  Rakesh Vohra},
  title        = {The Combinatorial Clock Auction: the Effects of Strategic Behaviour
                  and the Price Increment Rule on Social Welfare},
  booktitle    = {Proceedings of the 2018 {ACM} Conference on Economics and Computation,
                  Ithaca, NY, USA, June 18-22, 2018},
  pages        = {91--108},
  publisher    = {{ACM}},
  year         = {2018},
  url          = {https://doi.org/10.1145/3219166.3219230},
  doi          = {10.1145/3219166.3219230},
  timestamp    = {Tue, 27 Nov 2018 11:56:48 +0100},
  biburl       = {https://dblp.org/rec/conf/sigecom/TourV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/LiV18,
  author       = {Zhentao Li and
                  Adrian Vetta},
  editor       = {George Christodoulou and
                  Tobias Harks},
  title        = {The Fair Division of Hereditary Set Systems},
  booktitle    = {Web and Internet Economics - 14th International Conference, {WINE}
                  2018, Oxford, UK, December 15-17, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11316},
  pages        = {297--311},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-030-04612-5\_20},
  doi          = {10.1007/978-3-030-04612-5\_20},
  timestamp    = {Tue, 14 May 2019 10:00:36 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/LiV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-09561,
  author       = {Zhentao Li and
                  Adrian Vetta},
  title        = {The Fair Division of Hereditary Set Systems},
  journal      = {CoRR},
  volume       = {abs/1812.09561},
  year         = {2018},
  url          = {http://arxiv.org/abs/1812.09561},
  eprinttype    = {arXiv},
  eprint       = {1812.09561},
  timestamp    = {Wed, 02 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1812-09561.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ShepherdV17,
  author       = {F. Bruce Shepherd and
                  Adrian R. Vetta},
  title        = {The Inapproximability of Maximum Single-Sink Unsplittable, Priority
                  and Confluent Flow Problems},
  journal      = {Theory Comput.},
  volume       = {13},
  number       = {1},
  pages        = {1--25},
  year         = {2017},
  url          = {https://doi.org/10.4086/toc.2017.v013a020},
  doi          = {10.4086/TOC.2017.V013A020},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/ShepherdV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BousquetCHV16,
  author       = {Nicolas Bousquet and
                  Yang Cai and
                  Christoph Hunkenschr{\"{o}}der and
                  Adrian Vetta},
  editor       = {Robert Krauthgamer},
  title        = {On the Economic Efficiency of the Combinatorial Clock Auction},
  booktitle    = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages        = {1407--1423},
  publisher    = {{SIAM}},
  year         = {2016},
  url          = {https://doi.org/10.1137/1.9781611974331.ch97},
  doi          = {10.1137/1.9781611974331.CH97},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BousquetCHV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wine/2016,
  editor       = {Yang Cai and
                  Adrian Vetta},
  title        = {Web and Internet Economics - 12th International Conference, {WINE}
                  2016, Montreal, Canada, December 11-14, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10123},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-662-54110-4},
  doi          = {10.1007/978-3-662-54110-4},
  isbn         = {978-3-662-54109-8},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/2016.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/JoretV15,
  author       = {Gwena{\"{e}}l Joret and
                  Adrian Vetta},
  title        = {Reducing the rank of a matroid},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {17},
  number       = {2},
  pages        = {143--156},
  year         = {2015},
  url          = {https://doi.org/10.46298/dmtcs.2135},
  doi          = {10.46298/DMTCS.2135},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/JoretV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AnbalaganHLNVW15,
  author       = {Yogesh Anbalagan and
                  Hao Huang and
                  Shachar Lovett and
                  Sergey Norin and
                  Adrian Vetta and
                  Hehui Wu},
  editor       = {Naveen Garg and
                  Klaus Jansen and
                  Anup Rao and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Large Supports are Required for Well-Supported Nash Equilibria},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
                  NJ, {USA}},
  series       = {LIPIcs},
  volume       = {40},
  pages        = {78--84},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.78},
  doi          = {10.4230/LIPICS.APPROX-RANDOM.2015.78},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/AnbalaganHLNVW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ShepherdVW15,
  author       = {F. Bruce Shepherd and
                  Adrian Vetta and
                  Gordon T. Wilfong},
  editor       = {Venkatesan Guruswami},
  title        = {Polylogarithmic Approximations for the Capacitated Single-Sink Confluent
                  Flow Problem},
  booktitle    = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages        = {748--758},
  publisher    = {{IEEE} Computer Society},
  year         = {2015},
  url          = {https://doi.org/10.1109/FOCS.2015.51},
  doi          = {10.1109/FOCS.2015.51},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/ShepherdVW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BoodaghiansV15,
  author       = {Shant Boodaghians and
                  Adrian Vetta},
  editor       = {Martin Hoefer},
  title        = {The Combinatorial World (of Auctions) According to {GARP}},
  booktitle    = {Algorithmic Game Theory - 8th International Symposium, {SAGT} 2015,
                  Saarbr{\"{u}}cken, Germany, September 28-30, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9347},
  pages        = {125--136},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48433-3\_10},
  doi          = {10.1007/978-3-662-48433-3\_10},
  timestamp    = {Fri, 26 Mar 2021 08:28:34 +0100},
  biburl       = {https://dblp.org/rec/conf/sagt/BoodaghiansV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/BousquetLV15,
  author       = {Nicolas Bousquet and
                  Zhentao Li and
                  Adrian Vetta},
  editor       = {Tim Roughgarden and
                  Michal Feldman and
                  Michael Schwarz},
  title        = {Coalition Games on Interaction Graphs: {A} Horticultural Perspective},
  booktitle    = {Proceedings of the Sixteenth {ACM} Conference on Economics and Computation,
                  {EC} '15, Portland, OR, USA, June 15-19, 2015},
  pages        = {95--112},
  publisher    = {{ACM}},
  year         = {2015},
  url          = {https://doi.org/10.1145/2764468.2764477},
  doi          = {10.1145/2764468.2764477},
  timestamp    = {Fri, 02 Jun 2023 16:54:30 +0200},
  biburl       = {https://dblp.org/rec/conf/sigecom/BousquetLV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BoodaghiansV15,
  author       = {Shant Boodaghians and
                  Adrian Vetta},
  editor       = {Evangelos Markakis and
                  Guido Sch{\"{a}}fer},
  title        = {Testing Consumer Rationality Using Perfect Graphs and Oriented Discs},
  booktitle    = {Web and Internet Economics - 11th International Conference, {WINE}
                  2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9470},
  pages        = {187--200},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48995-6\_14},
  doi          = {10.1007/978-3-662-48995-6\_14},
  timestamp    = {Tue, 04 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/BoodaghiansV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BousquetCV15,
  author       = {Nicolas Bousquet and
                  Yang Cai and
                  Adrian Vetta},
  editor       = {Evangelos Markakis and
                  Guido Sch{\"{a}}fer},
  title        = {Welfare and Rationality Guarantees for the Simultaneous Multiple-Round
                  Ascending Auction},
  booktitle    = {Web and Internet Economics - 11th International Conference, {WINE}
                  2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9470},
  pages        = {216--229},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48995-6\_16},
  doi          = {10.1007/978-3-662-48995-6\_16},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/BousquetCV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BousquetLV15,
  author       = {Nicolas Bousquet and
                  Zhentao Li and
                  Adrian Vetta},
  title        = {Coalition Games on Interaction Graphs: {A} Horticultural Perspective},
  journal      = {CoRR},
  volume       = {abs/1502.07713},
  year         = {2015},
  url          = {http://arxiv.org/abs/1502.07713},
  eprinttype    = {arXiv},
  eprint       = {1502.07713},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BousquetLV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ShepherdV15,
  author       = {F. Bruce Shepherd and
                  Adrian Vetta},
  title        = {The Inapproximability of Maximum Single-Sink Unsplittable, Priority
                  and Confluent Flow Problems},
  journal      = {CoRR},
  volume       = {abs/1504.00627},
  year         = {2015},
  url          = {http://arxiv.org/abs/1504.00627},
  eprinttype    = {arXiv},
  eprint       = {1504.00627},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ShepherdV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AnbalaganHLNVW15,
  author       = {Yogesh Anbalagan and
                  Hao Huang and
                  Shachar Lovett and
                  Sergey Norin and
                  Adrian Vetta and
                  Hehui Wu},
  title        = {Large Supports are required for Well-Supported Nash Equilibria},
  journal      = {CoRR},
  volume       = {abs/1504.03602},
  year         = {2015},
  url          = {http://arxiv.org/abs/1504.03602},
  eprinttype    = {arXiv},
  eprint       = {1504.03602},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AnbalaganHLNVW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoodaghiansV15,
  author       = {Shant Boodaghians and
                  Adrian Vetta},
  title        = {The Combinatorial World (of Auctions) According to {GARP}},
  journal      = {CoRR},
  volume       = {abs/1505.00508},
  year         = {2015},
  url          = {http://arxiv.org/abs/1505.00508},
  eprinttype    = {arXiv},
  eprint       = {1505.00508},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoodaghiansV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BousquetCHV15,
  author       = {Nicolas Bousquet and
                  Yang Cai and
                  Christoph Hunkenschr{\"{o}}der and
                  Adrian Vetta},
  title        = {On the Economic Efficiency of the Combinatorial Clock Auction},
  journal      = {CoRR},
  volume       = {abs/1507.06495},
  year         = {2015},
  url          = {http://arxiv.org/abs/1507.06495},
  eprinttype    = {arXiv},
  eprint       = {1507.06495},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BousquetCHV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoodaghiansV15a,
  author       = {Shant Boodaghians and
                  Adrian Vetta},
  title        = {Testing Consumer Rationality using Perfect Graphs and Oriented Discs},
  journal      = {CoRR},
  volume       = {abs/1507.07581},
  year         = {2015},
  url          = {http://arxiv.org/abs/1507.07581},
  eprinttype    = {arXiv},
  eprint       = {1507.07581},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoodaghiansV15a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerbegliaRV15,
  author       = {Gerardo Berbeglia and
                  Gautam Rayaprolu and
                  Adrian Vetta},
  title        = {The Storable Good Monopoly Problem with Indivisible Demand},
  journal      = {CoRR},
  volume       = {abs/1509.07330},
  year         = {2015},
  url          = {http://arxiv.org/abs/1509.07330},
  eprinttype    = {arXiv},
  eprint       = {1509.07330},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BerbegliaRV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BousquetCV15,
  author       = {Nicolas Bousquet and
                  Yang Cai and
                  Adrian Vetta},
  title        = {Welfare and Rationality Guarantees for the Simultaneous Multiple-Round
                  Ascending Auction},
  journal      = {CoRR},
  volume       = {abs/1510.00295},
  year         = {2015},
  url          = {http://arxiv.org/abs/1510.00295},
  eprinttype    = {arXiv},
  eprint       = {1510.00295},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BousquetCV15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LaekhanukitVW14,
  author       = {Bundit Laekhanukit and
                  Adrian Vetta and
                  Gordon T. Wilfong},
  title        = {Routing Regardless of Network Stability},
  journal      = {Algorithmica},
  volume       = {70},
  number       = {3},
  pages        = {561--593},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00453-014-9908-2},
  doi          = {10.1007/S00453-014-9908-2},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LaekhanukitVW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LiNV14,
  author       = {Zhentao Li and
                  Manikandan Narayanan and
                  Adrian Vetta},
  title        = {The Complexity of the Simultaneous Cluster Problem},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {18},
  number       = {1},
  pages        = {1--34},
  year         = {2014},
  url          = {https://doi.org/10.7155/jgaa.00313},
  doi          = {10.7155/JGAA.00313},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/LiNV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmetrics/BerbegliaSV14,
  author       = {Gerardo Berbeglia and
                  Peter Sloan and
                  Adrian Vetta},
  title        = {Pricing mechanisms for a durable good monopolist},
  journal      = {{SIGMETRICS} Perform. Evaluation Rev.},
  volume       = {41},
  number       = {4},
  pages        = {50},
  year         = {2014},
  url          = {https://doi.org/10.1145/2627534.2627550},
  doi          = {10.1145/2627534.2627550},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/sigmetrics/BerbegliaSV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CheriyanLNV14,
  author       = {Joseph Cheriyan and
                  Bundit Laekhanukit and
                  Guyslain Naves and
                  Adrian Vetta},
  title        = {Approximating Rooted Steiner Networks},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {11},
  number       = {2},
  pages        = {8:1--8:22},
  year         = {2014},
  url          = {https://doi.org/10.1145/2650183},
  doi          = {10.1145/2650183},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/CheriyanLNV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/Alkalay-HoulihanV14,
  author       = {Colleen Alkalay{-}Houlihan and
                  Adrian Vetta},
  editor       = {Carla E. Brodley and
                  Peter Stone},
  title        = {False-Name Bidding and Economic Efficiency in Combinatorial Auctions},
  booktitle    = {Proceedings of the Twenty-Eighth {AAAI} Conference on Artificial Intelligence,
                  July 27 -31, 2014, Qu{\'{e}}bec City, Qu{\'{e}}bec, Canada},
  pages        = {538--544},
  publisher    = {{AAAI} Press},
  year         = {2014},
  url          = {https://doi.org/10.1609/aaai.v28i1.8828},
  doi          = {10.1609/AAAI.V28I1.8828},
  timestamp    = {Mon, 04 Sep 2023 15:06:24 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/Alkalay-HoulihanV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/HuLV14,
  author       = {Huining Hu and
                  Zhentao Li and
                  Adrian R. Vetta},
  editor       = {Zoubin Ghahramani and
                  Max Welling and
                  Corinna Cortes and
                  Neil D. Lawrence and
                  Kilian Q. Weinberger},
  title        = {Randomized Experimental Design for Causal Graph Discovery},
  booktitle    = {Advances in Neural Information Processing Systems 27: Annual Conference
                  on Neural Information Processing Systems 2014, December 8-13 2014,
                  Montreal, Quebec, Canada},
  pages        = {2339--2347},
  year         = {2014},
  url          = {https://proceedings.neurips.cc/paper/2014/hash/e53a0a2978c28872a4505bdb51db06dc-Abstract.html},
  timestamp    = {Mon, 16 May 2022 15:41:51 +0200},
  biburl       = {https://dblp.org/rec/conf/nips/HuLV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BousquetNV14,
  author       = {Nicolas Bousquet and
                  Sergey Norin and
                  Adrian Vetta},
  editor       = {Tie{-}Yan Liu and
                  Qi Qi and
                  Yinyu Ye},
  title        = {A Near-Optimal Mechanism for Impartial Selection},
  booktitle    = {Web and Internet Economics - 10th International Conference, {WINE}
                  2014, Beijing, China, December 14-17, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8877},
  pages        = {133--146},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-13129-0\_10},
  doi          = {10.1007/978-3-319-13129-0\_10},
  timestamp    = {Sun, 18 Dec 2022 19:02:44 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/BousquetNV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BerbegliaSV14,
  author       = {Gerardo Berbeglia and
                  Peter Sloan and
                  Adrian Vetta},
  editor       = {Tie{-}Yan Liu and
                  Qi Qi and
                  Yinyu Ye},
  title        = {Bounds on the Profitability of a Durable Good Monopolist},
  booktitle    = {Web and Internet Economics - 10th International Conference, {WINE}
                  2014, Beijing, China, December 14-17, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8877},
  pages        = {292--293},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-13129-0\_23},
  doi          = {10.1007/978-3-319-13129-0\_23},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/BerbegliaSV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/MehtaTVV14,
  author       = {Ruta Mehta and
                  Nithum Thain and
                  L{\'{a}}szl{\'{o}} A. V{\'{e}}gh and
                  Adrian Vetta},
  editor       = {Tie{-}Yan Liu and
                  Qi Qi and
                  Yinyu Ye},
  title        = {To Save Or Not To Save: The Fisher Game},
  booktitle    = {Web and Internet Economics - 10th International Conference, {WINE}
                  2014, Beijing, China, December 14-17, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8877},
  pages        = {294--307},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-13129-0\_24},
  doi          = {10.1007/978-3-319-13129-0\_24},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/MehtaTVV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BousquetNV14,
  author       = {Nicolas Bousquet and
                  Sergey Norin and
                  Adrian Vetta},
  title        = {A Near-Optimal Mechanism for Impartial Selection},
  journal      = {CoRR},
  volume       = {abs/1407.8535},
  year         = {2014},
  url          = {http://arxiv.org/abs/1407.8535},
  eprinttype    = {arXiv},
  eprint       = {1407.8535},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BousquetNV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerbegliaSV14,
  author       = {Gerardo Berbeglia and
                  Peter Sloan and
                  Adrian Vetta},
  title        = {Bounds on the Profitability of a Durable Good Monopolist},
  journal      = {CoRR},
  volume       = {abs/1409.7979},
  year         = {2014},
  url          = {http://arxiv.org/abs/1409.7979},
  eprinttype    = {arXiv},
  eprint       = {1409.7979},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BerbegliaSV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/AnbalaganNSV13,
  author       = {Yogesh Anbalagan and
                  Sergey Norin and
                  Rahul Savani and
                  Adrian Vetta},
  editor       = {Yiling Chen and
                  Nicole Immorlica},
  title        = {Polylogarithmic Supports Are Required for Approximate Well-Supported
                  Nash Equilibria below 2/3},
  booktitle    = {Web and Internet Economics - 9th International Conference, {WINE}
                  2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8289},
  pages        = {15--23},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45046-4\_2},
  doi          = {10.1007/978-3-642-45046-4\_2},
  timestamp    = {Thu, 12 Aug 2021 18:47:48 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/AnbalaganNSV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AnbalaganNSV13,
  author       = {Yogesh Anbalagan and
                  Sergey Norin and
                  Rahul Savani and
                  Adrian Vetta},
  title        = {Polylogarithmic Supports are required for Approximate Well-Supported
                  Nash Equilibria below 2/3},
  journal      = {CoRR},
  volume       = {abs/1309.7258},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.7258},
  eprinttype    = {arXiv},
  eprint       = {1309.7258},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AnbalaganNSV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BlanchetteKV12,
  author       = {Mathieu Blanchette and
                  Ethan Kim and
                  Adrian Vetta},
  editor       = {David A. Bader and
                  Petra Mutzel},
  title        = {Clique Cover on Sparse Networks},
  booktitle    = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
                  Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
                  16, 2012},
  pages        = {93--102},
  publisher    = {{SIAM} / Omnipress},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611972924.10},
  doi          = {10.1137/1.9781611972924.10},
  timestamp    = {Tue, 29 Dec 2020 18:28:33 +0100},
  biburl       = {https://dblp.org/rec/conf/alenex/BlanchetteKV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LaekhanukitVW12,
  author       = {Bundit Laekhanukit and
                  Adrian Vetta and
                  Gordon T. Wilfong},
  editor       = {Leah Epstein and
                  Paolo Ferragina},
  title        = {Routing Regardless of Network Stability},
  booktitle    = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
                  Slovenia, September 10-12, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7501},
  pages        = {719--730},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-33090-2\_62},
  doi          = {10.1007/978-3-642-33090-2\_62},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/LaekhanukitVW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/MirrokniTV12,
  author       = {Vahab S. Mirrokni and
                  Nithum Thain and
                  Adrian Vetta},
  editor       = {Maria J. Serna},
  title        = {A Theoretical Examination of Practical Game Playing: Lookahead Search},
  booktitle    = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,
                  Barcelona, Spain, October 22-23, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7615},
  pages        = {251--262},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-33996-7\_22},
  doi          = {10.1007/978-3-642-33996-7\_22},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/MirrokniTV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CheriyanLNV12,
  author       = {Joseph Cheriyan and
                  Bundit Laekhanukit and
                  Guyslain Naves and
                  Adrian Vetta},
  editor       = {Yuval Rabani},
  title        = {Approximating rooted Steiner networks},
  booktitle    = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages        = {1499--1511},
  publisher    = {{SIAM}},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611973099.119},
  doi          = {10.1137/1.9781611973099.119},
  timestamp    = {Tue, 02 Feb 2021 17:07:31 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CheriyanLNV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/LaekhanukitNV12,
  author       = {Bundit Laekhanukit and
                  Guyslain Naves and
                  Adrian Vetta},
  editor       = {Paul W. Goldberg},
  title        = {Non-redistributive Second Welfare Theorems},
  booktitle    = {Internet and Network Economics - 8th International Workshop, {WINE}
                  2012, Liverpool, UK, December 10-12, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7695},
  pages        = {227--243},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-35311-6\_17},
  doi          = {10.1007/978-3-642-35311-6\_17},
  timestamp    = {Tue, 14 May 2019 10:00:36 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/LaekhanukitNV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-4134,
  author       = {Vahab S. Mirrokni and
                  Nithum Thain and
                  Adrian Vetta},
  title        = {On the Implications of Lookahead Search in Game Playing},
  journal      = {CoRR},
  volume       = {abs/1202.4134},
  year         = {2012},
  url          = {http://arxiv.org/abs/1202.4134},
  eprinttype    = {arXiv},
  eprint       = {1202.4134},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-4134.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0043,
  author       = {Bundit Laekhanukit and
                  Adrian Vetta and
                  Gordon T. Wilfong},
  title        = {Routing Regardless of Network Stability},
  journal      = {CoRR},
  volume       = {abs/1207.0043},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.0043},
  eprinttype    = {arXiv},
  eprint       = {1207.0043},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-0043.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-4853,
  author       = {Gwena{\"{e}}l Joret and
                  Adrian Vetta},
  title        = {Reducing the rank of a matroid},
  journal      = {CoRR},
  volume       = {abs/1211.4853},
  year         = {2012},
  url          = {http://arxiv.org/abs/1211.4853},
  eprinttype    = {arXiv},
  eprint       = {1211.4853},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1211-4853.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/KimSVB10,
  author       = {Ethan Kim and
                  Ashish Sabharwal and
                  Adrian Vetta and
                  Mathieu Blanchette},
  title        = {Predicting direct protein interactions from affinity purification
                  mass spectrometry data},
  journal      = {Algorithms Mol. Biol.},
  volume       = {5},
  pages        = {34},
  year         = {2010},
  url          = {https://doi.org/10.1186/1748-7188-5-34},
  doi          = {10.1186/1748-7188-5-34},
  timestamp    = {Fri, 13 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/almob/KimSVB10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SonneratV10,
  author       = {Nicolas Sonnerat and
                  Adrian Vetta},
  title        = {Galaxy cutsets in graphs},
  journal      = {J. Comb. Optim.},
  volume       = {19},
  number       = {3},
  pages        = {415--427},
  year         = {2010},
  url          = {https://doi.org/10.1007/s10878-009-9258-1},
  doi          = {10.1007/S10878-009-9258-1},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/SonneratV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LiV10,
  author       = {Zhentao Li and
                  Adrian Vetta},
  title        = {Bounds on the cleaning times of robot vacuums},
  journal      = {Oper. Res. Lett.},
  volume       = {38},
  number       = {1},
  pages        = {69--71},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.orl.2009.09.002},
  doi          = {10.1016/J.ORL.2009.09.002},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/orl/LiV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/NarayananVSZ10,
  author       = {Manikandan Narayanan and
                  Adrian Vetta and
                  Eric E. Schadt and
                  Jun Zhu},
  title        = {Simultaneous Clustering of Multiple Gene Expression and Physical Interaction
                  Datasets},
  journal      = {PLoS Comput. Biol.},
  volume       = {6},
  number       = {4},
  year         = {2010},
  url          = {https://doi.org/10.1371/journal.pcbi.1000742},
  doi          = {10.1371/JOURNAL.PCBI.1000742},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ploscb/NarayananVSZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DrescherV10,
  author       = {Matthew Drescher and
                  Adrian Vetta},
  title        = {An approximation algorithm for the maximum leaf spanning arborescence
                  problem},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {6},
  number       = {3},
  pages        = {46:1--46:18},
  year         = {2010},
  url          = {https://doi.org/10.1145/1798596.1798599},
  doi          = {10.1145/1798596.1798599},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/DrescherV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/NavesSV10,
  author       = {Guyslain Naves and
                  Nicolas Sonnerat and
                  Adrian Vetta},
  editor       = {Maria J. Serna and
                  Ronen Shaltiel and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Maximum Flows on Disjoint Paths},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
                  International Workshop, {RANDOM} 2010, Barcelona, Spain, September
                  1-3, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6302},
  pages        = {326--337},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-15369-3\_25},
  doi          = {10.1007/978-3-642-15369-3\_25},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/NavesSV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KuleshovV10,
  author       = {Volodymyr Kuleshov and
                  Adrian Vetta},
  editor       = {Spyros C. Kontogiannis and
                  Elias Koutsoupias and
                  Paul G. Spirakis},
  title        = {On the Efficiency of Markets with Two-Sided Proportional Allocation
                  Mechanisms},
  booktitle    = {Algorithmic Game Theory - Third International Symposium, {SAGT} 2010,
                  Athens, Greece, October 18-20, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6386},
  pages        = {246--261},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-16170-4\_22},
  doi          = {10.1007/978-3-642-16170-4\_22},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/KuleshovV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SonneratV09,
  author       = {Nicolas Sonnerat and
                  Adrian Vetta},
  title        = {Defending Planar Graphs against Star-Cutsets},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {34},
  pages        = {107--111},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.endm.2009.07.018},
  doi          = {10.1016/J.ENDM.2009.07.018},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/SonneratV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GeelenGRSV09,
  author       = {Jim Geelen and
                  Bert Gerards and
                  Bruce A. Reed and
                  Paul D. Seymour and
                  Adrian Vetta},
  title        = {On the odd-minor variant of Hadwiger's conjecture},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {99},
  number       = {1},
  pages        = {20--29},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.jctb.2008.03.006},
  doi          = {10.1016/J.JCTB.2008.03.006},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/GeelenGRSV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/ThainV09,
  author       = {Nithum Thain and
                  Adrian Vetta},
  editor       = {Stefano Leonardi},
  title        = {Computational Aspects of Multimarket Price Wars},
  booktitle    = {Internet and Network Economics, 5th International Workshop, {WINE}
                  2009, Rome, Italy, December 14-18, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5929},
  pages        = {304--315},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10841-9\_28},
  doi          = {10.1007/978-3-642-10841-9\_28},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/ThainV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/FarzadOV08,
  author       = {Babak Farzad and
                  Neil Olver and
                  Adrian Vetta},
  title        = {A Priority-Based Model of Routing},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {2008},
  year         = {2008},
  url          = {http://cjtcs.cs.uchicago.edu/articles/2008/1/contents.html},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/FarzadOV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FioriniHRV08,
  author       = {Samuel Fiorini and
                  Nadia Hardy and
                  Bruce A. Reed and
                  Adrian Vetta},
  title        = {Planar graph bipartization in linear time},
  journal      = {Discret. Appl. Math.},
  volume       = {156},
  number       = {7},
  pages        = {1175--1180},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.dam.2007.08.013},
  doi          = {10.1016/J.DAM.2007.08.013},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FioriniHRV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KingRV07,
  author       = {Andrew D. King and
                  Bruce A. Reed and
                  Adrian Vetta},
  title        = {An upper bound for the chromatic number of line graphs},
  journal      = {Eur. J. Comb.},
  volume       = {28},
  number       = {8},
  pages        = {2182--2187},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.ejc.2007.04.014},
  doi          = {10.1016/J.EJC.2007.04.014},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/KingRV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenKLRSV07,
  author       = {Jiangzhuo Chen and
                  Robert D. Kleinberg and
                  L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
                  Rajmohan Rajaraman and
                  Ravi Sundaram and
                  Adrian Vetta},
  title        = {(Almost) Tight bounds and existence theorems for single-commodity
                  confluent flows},
  journal      = {J. {ACM}},
  volume       = {54},
  number       = {4},
  pages        = {16},
  year         = {2007},
  url          = {https://doi.org/10.1145/1255443.1255444},
  doi          = {10.1145/1255443.1255444},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/ChenKLRSV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Addario-BerryOV07,
  author       = {Louigi Addario{-}Berry and
                  Neil Olver and
                  Adrian Vetta},
  title        = {A Polynomial Time Algorithm for Finding Nash Equilibria in Planar
                  Win-Lose Games},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {309--319},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00147},
  doi          = {10.7155/JGAA.00147},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/Addario-BerryOV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/ShepherdV07,
  author       = {F. Bruce Shepherd and
                  Adrian Vetta},
  title        = {The Demand-Matching Problem},
  journal      = {Math. Oper. Res.},
  volume       = {32},
  number       = {3},
  pages        = {563--578},
  year         = {2007},
  url          = {https://doi.org/10.1287/moor.1070.0254},
  doi          = {10.1287/MOOR.1070.0254},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/ShepherdV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FioriniHRV07,
  author       = {Samuel Fiorini and
                  Nadia Hardy and
                  Bruce A. Reed and
                  Adrian Vetta},
  title        = {Approximate min-max relations for odd cycles in planar graphs},
  journal      = {Math. Program.},
  volume       = {110},
  number       = {1},
  pages        = {71--91},
  year         = {2007},
  url          = {https://doi.org/10.1007/s10107-006-0063-7},
  doi          = {10.1007/S10107-006-0063-7},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/FioriniHRV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaranyVV07,
  author       = {Imre B{\'{a}}r{\'{a}}ny and
                  Santosh S. Vempala and
                  Adrian Vetta},
  title        = {Nash equilibria in random games},
  journal      = {Random Struct. Algorithms},
  volume       = {31},
  number       = {4},
  pages        = {391--405},
  year         = {2007},
  url          = {https://doi.org/10.1002/rsa.20199},
  doi          = {10.1002/RSA.20199},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/BaranyVV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CheriyanV07,
  author       = {Joseph Cheriyan and
                  Adrian Vetta},
  title        = {Approximation Algorithms for Network Design with Metric Costs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {21},
  number       = {3},
  pages        = {612--636},
  year         = {2007},
  url          = {https://doi.org/10.1137/040621806},
  doi          = {10.1137/040621806},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/CheriyanV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DonovanSVW07,
  author       = {Patrick Donovan and
                  F. Bruce Shepherd and
                  Adrian Vetta and
                  Gordon T. Wilfong},
  editor       = {David S. Johnson and
                  Uriel Feige},
  title        = {Degree-constrained network flows},
  booktitle    = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
                  San Diego, California, USA, June 11-13, 2007},
  pages        = {681--688},
  publisher    = {{ACM}},
  year         = {2007},
  url          = {https://doi.org/10.1145/1250790.1250889},
  doi          = {10.1145/1250790.1250889},
  timestamp    = {Tue, 09 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/DonovanSVW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CheriyanVV06,
  author       = {Joseph Cheriyan and
                  Santosh S. Vempala and
                  Adrian Vetta},
  title        = {Network Design Via Iterative Rounding Of Setpair Relaxations},
  journal      = {Comb.},
  volume       = {26},
  number       = {3},
  pages        = {255--275},
  year         = {2006},
  url          = {https://doi.org/10.1007/s00493-006-0016-z},
  doi          = {10.1007/S00493-006-0016-Z},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/CheriyanVV06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FioriniHRV05,
  author       = {Samuel Fiorini and
                  Nadia Hardy and
                  Bruce A. Reed and
                  Adrian Vetta},
  title        = {Planar graph bipartization in linear time},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {19},
  pages        = {265--271},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.endm.2005.05.036},
  doi          = {10.1016/J.ENDM.2005.05.036},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/FioriniHRV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BaranyVV05,
  author       = {Imre B{\'{a}}r{\'{a}}ny and
                  Santosh S. Vempala and
                  Adrian Vetta},
  title        = {Nash Equilibria in Random Games},
  booktitle    = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
                  2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
  pages        = {123--131},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/SFCS.2005.52},
  doi          = {10.1109/SFCS.2005.52},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BaranyVV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoemansMV05,
  author       = {Michel X. Goemans and
                  Vahab S. Mirrokni and
                  Adrian Vetta},
  title        = {Sink Equilibria and Convergence},
  booktitle    = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
                  2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
  pages        = {142--154},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/SFCS.2005.68},
  doi          = {10.1109/SFCS.2005.68},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GoemansMV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FioriniHRV05,
  author       = {Samuel Fiorini and
                  Nadia Hardy and
                  Bruce A. Reed and
                  Adrian Vetta},
  editor       = {Michael J{\"{u}}nger and
                  Volker Kaibel},
  title        = {Approximate Min-max Relations for Odd Cycles in Planar Graphs},
  booktitle    = {Integer Programming and Combinatorial Optimization, 11th International
                  {IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3509},
  pages        = {35--50},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11496915\_4},
  doi          = {10.1007/11496915\_4},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/FioriniHRV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CheriyanV05,
  author       = {Joseph Cheriyan and
                  Adrian Vetta},
  editor       = {Harold N. Gabow and
                  Ronald Fagin},
  title        = {Approximation algorithms for network design with metric costs},
  booktitle    = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
                  Baltimore, MD, USA, May 22-24, 2005},
  pages        = {167--175},
  publisher    = {{ACM}},
  year         = {2005},
  url          = {https://doi.org/10.1145/1060590.1060616},
  doi          = {10.1145/1060590.1060616},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/CheriyanV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KannanVV04,
  author       = {Ravi Kannan and
                  Santosh S. Vempala and
                  Adrian Vetta},
  title        = {On clusterings: Good, bad and spectral},
  journal      = {J. {ACM}},
  volume       = {51},
  number       = {3},
  pages        = {497--515},
  year         = {2004},
  url          = {https://doi.org/10.1145/990308.990313},
  doi          = {10.1145/990308.990313},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/KannanVV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/ShepherdV04,
  author       = {F. Bruce Shepherd and
                  Adrian Vetta},
  title        = {Lighting fibers in a dark network},
  journal      = {{IEEE} J. Sel. Areas Commun.},
  volume       = {22},
  number       = {9},
  pages        = {1583--1588},
  year         = {2004},
  url          = {https://doi.org/10.1109/JSAC.2004.833850},
  doi          = {10.1109/JSAC.2004.833850},
  timestamp    = {Thu, 02 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsac/ShepherdV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ReedSV04,
  author       = {Bruce A. Reed and
                  Kaleigh Smith and
                  Adrian Vetta},
  title        = {Finding odd cycle transversals},
  journal      = {Oper. Res. Lett.},
  volume       = {32},
  number       = {4},
  pages        = {299--301},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.orl.2003.10.009},
  doi          = {10.1016/J.ORL.2003.10.009},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/orl/ReedSV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MirrokniV04,
  author       = {Vahab S. Mirrokni and
                  Adrian Vetta},
  editor       = {Klaus Jansen and
                  Sanjeev Khanna and
                  Jos{\'{e}} D. P. Rolim and
                  Dana Ron},
  title        = {Convergence Issues in Competitive Games},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
                  and Techniques, 7th International Workshop on Approximation Algorithms
                  for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
                  Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
                  MA, USA, August 22-24, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3122},
  pages        = {183--194},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-27821-4\_17},
  doi          = {10.1007/978-3-540-27821-4\_17},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/MirrokniV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenKLRSV04,
  author       = {Jiangzhuo Chen and
                  Robert D. Kleinberg and
                  L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
                  Rajmohan Rajaraman and
                  Ravi Sundaram and
                  Adrian Vetta},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {(Almost) tight bounds and existence theorems for confluent flows},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {529--538},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007432},
  doi          = {10.1145/1007352.1007432},
  timestamp    = {Tue, 06 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ChenKLRSV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CheriyanVV03,
  author       = {Joseph Cheriyan and
                  Santosh S. Vempala and
                  Adrian Vetta},
  title        = {An Approximation Algorithm for the Minimum-Cost k-Vertex Connected
                  Subgraph},
  journal      = {{SIAM} J. Comput.},
  volume       = {32},
  number       = {4},
  pages        = {1050--1055},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539701392287},
  doi          = {10.1137/S0097539701392287},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CheriyanVV03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Vetta02,
  author       = {Adrian Vetta},
  title        = {Nash Equilibria in Competitive Societies, with Applications to Facility
                  Location, Traffic Routing and Auctions},
  booktitle    = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
                  November 2002, Vancouver, BC, Canada, Proceedings},
  pages        = {416},
  publisher    = {{IEEE} Computer Society},
  year         = {2002},
  url          = {https://doi.org/10.1109/SFCS.2002.1181966},
  doi          = {10.1109/SFCS.2002.1181966},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Vetta02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ShepherdV02,
  author       = {F. Bruce Shepherd and
                  Adrian Vetta},
  editor       = {William J. Cook and
                  Andreas S. Schulz},
  title        = {The Demand Matching Problem},
  booktitle    = {Integer Programming and Combinatorial Optimization, 9th International
                  {IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2337},
  pages        = {457--474},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-47867-1\_32},
  doi          = {10.1007/3-540-47867-1\_32},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/ShepherdV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CheriyanVV02,
  author       = {Joseph Cheriyan and
                  Santosh S. Vempala and
                  Adrian Vetta},
  editor       = {John H. Reif},
  title        = {Approximation algorithms for minimum-cost k-vertex connected subgraphs},
  booktitle    = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
                  May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
  pages        = {306--312},
  publisher    = {{ACM}},
  year         = {2002},
  url          = {https://doi.org/10.1145/509907.509955},
  doi          = {10.1145/509907.509955},
  timestamp    = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/CheriyanVV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Vetta01,
  author       = {Adrian Vetta},
  editor       = {S. Rao Kosaraju},
  title        = {Approximating the minimum strongly connected subgraph via a matching
                  lower bound},
  booktitle    = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
                  January 7-9, 2001, Washington, DC, {USA}},
  pages        = {417--426},
  publisher    = {{ACM/SIAM}},
  year         = {2001},
  url          = {http://dl.acm.org/citation.cfm?id=365411.365493},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Vetta01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/VempalaV00,
  author       = {Santosh S. Vempala and
                  Adrian Vetta},
  editor       = {Klaus Jansen and
                  Samir Khuller},
  title        = {Factor 4/3 approximations for minimum 2-connected subgraphs},
  booktitle    = {Approximation Algorithms for Combinatorial Optimization, Third International
                  Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
                  5-8, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1913},
  pages        = {262--273},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-44436-X\_26},
  doi          = {10.1007/3-540-44436-X\_26},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/VempalaV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/VempalaV00,
  author       = {Ravi Kannan and
                  Santosh S. Vempala and
                  Adrian Vetta},
  title        = {On Clusterings - Good, Bad and Spectral},
  booktitle    = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
                  12-14 November 2000, Redondo Beach, California, {USA}},
  pages        = {367--377},
  publisher    = {{IEEE} Computer Society},
  year         = {2000},
  url          = {https://doi.org/10.1109/SFCS.2000.892125},
  doi          = {10.1109/SFCS.2000.892125},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/VempalaV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics