| 1 | -- | 43 | Mong-Jen Kao, Han-Lin Chen, Der-Tsai Lee. Capacitated Domination: Problem Complexity and Approximation Algorithms |
| 44 | -- | 82 | John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis. Enforcing Efficient Equilibria in Network Design Games via Subsidies |
| 83 | -- | 98 | Pankaj K. Agarwal, R. Sharathkumar. Streaming Algorithms for Extent Problems in High Dimensions |
| 99 | -- | 125 | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk. Modifying a Graph Using Vertex Elimination |
| 126 | -- | 147 | Joseph Cheriyan, Zachary Friggstad, Zhihan Gao. Approximating Minimum-Cost Connected T-Joins |
| 148 | -- | 166 | Amotz Bar-Noy, Ben Baumer. Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges |
| 167 | -- | 190 | Niv Buchbinder, Rica Gonen. Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach |
| 191 | -- | 192 | Avrim Blum, Philip M. Long. Special Issue on New Theoretical Challenges in Machine Learning |
| 193 | -- | 214 | Anima Anandkumar, Dean P. Foster, Daniel Hsu, Sham M. Kakade, Yi-Kai Liu. A Spectral Algorithm for Latent Dirichlet Allocation |
| 215 | -- | 236 | Sanjeev Arora, Rong Ge, Ankur Moitra, Sushant Sachdeva. Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders |
| 237 | -- | 263 | Sanjoy Dasgupta, Kaushik Sinha. Randomized Partition Trees for Nearest Neighbor Search |
| 316 | -- | 357 | Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio. Learning Poisson Binomial Distributions |