| 2017 | Front Matter, Table of Contents, Preface, Organization, List of Authors. | |
| 2017 | A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time. | Andreas Wiese |
| 2017 | Fast and Powerful Hashing Using Tabulation (Invited Talk). | Mikkel Thorup |
| 2017 | A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry. | Pascal Schweitzer |
| 2017 | Edge-Orders. | Lena Schlipf, Jens M. Schmidt |
| 2017 | Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder. | Aviad Rubinstein |
| 2017 | Local Computation Algorithms (Invited Talk). | Ronitt Rubinfeld |
| 2017 | Separation of AC^0[oplus] Formulas and Circuits. | Benjamin Rossman, Srikanth Srinivasan |
| 2017 | Subspace-Invariant AC^0 Formulas. | Benjamin Rossman |
| 2017 | Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment. | Fabian Reiter |
| 2017 | A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model. | Mikhail A. Raskin |
| 2017 | On the Bit Complexity of Sum-of-Squares Proofs. | Prasad Raghavendra, Benjamin Weitz |
| 2017 | Tighter Hard Instances for PPSZ. | Pavel Pudlk, Dominik Scheder, Navid Talebanfard |
| 2017 | Fast Regression with an $ell_infty$ Guarantee. | Eric Price, Zhao Song, David P. Woodruff |
| 2017 | Non-Uniform Attacks Against Pseudoentropy. | Krzysztof Pietrzak, Maciej Skorski |
| 2017 | On Fast Decoding of High-Dimensional Signals from One-Bit Measurements. | Vasileios Nakos |
| 2017 | Online Covering with Sum of $ell_q$-Norm Objectives. | Viswanath Nagarajan, Xiangkun Shen |
| 2017 | Testable Bounded Degree Graph Properties Are Random Order Streamable. | Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler |
| 2017 | On the Transformation Capability of Feasible Mechanisms for Programmable Matter. | Othon Michail, George Skretas, Paul G. Spirakis |
| 2017 | Rerouting Flows When Links Fail. | Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo |
| 2017 | A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. | Pasin Manurangsi, Prasad Raghavendra |
| 2017 | Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis. | Pasin Manurangsi |
| 2017 | Relaxations of Graph Isomorphism. | Laura Mancinska, David E. Roberson, Robert Smal, Simone Severini, Antonios Varvitsiotis |
| 2017 | Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. | Tung Mai, Ioannis Panageas, Vijay V. Vazirani |
| 2017 | Packing Cycles Faster Than Erdos-Posa. | Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi |