Themen
- J. Garg, P. Kulkarni, R. Kulkarni: Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. SODA 2020.
- I. Caragiannis, D. Kurokawa, H. Moulin, A. Procaccia, N. Shah, J. Wang: The Unreasonable Fairness of Maximum Nash Welfare. EC 2016.
- S. Brandt, K. Foerster, B. Richner, R. Wattenhofer: Wireless evacuation on m rays with k searchers. Theoretical Computer Science 811 (2020).
- R. Bredereck, E. Elkind, A. Igarashi: Hedonic Diversity Games. AAMAS 2019
- F. Eberle, N. Megow, K. Schewior: Optimally Handling Commitment Issues in Online Throughput Maximization. ESA 2020
- R. Levi, M. Medina: Distributed Testing of Graph Isomorphism in the CONGEST Model. Approx/Random 2020
- V. Conitzer, D. Panigrahi, H. Zhang: Learning Opinions in Social Networks ICML 2020
- R. Curticapean, H. Dell, and D. Marx: Homomorphisms Are a Good Basis for Counting Small Subgraphs STOC 2017. Siehe auch: Working paper version hier. Nur Abschnitt 1-4.