| 2017 | Making Metric Temporal Logic Rational. | Shankara Narayanan Krishna, Khushraj Madnani, Paritosh K. Pandya |
| 2017 | Communication Complexity of Pairs of Graph Families with Applications. | Sudeshna Kolay, Fahad Panolan, Saket Saurabh |
| 2017 | The Complexity of Quantum Disjointness. | Hartmut Klauck |
| 2017 | One-Dimensional Logic over Trees. | Emanuel Kieronski, Antti Kuusisto |
| 2017 | Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. | Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa |
| 2017 | Undecidable Problems for Probabilistic Network Programming. | David M. Kahn |
| 2017 | Time Complexity of Constraint Satisfaction via Universal Algebra. | Peter Jonsson, Victor Lagerkvist, Biman Roy |
| 2017 | ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics. | Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, Quanlong Wang |
| 2017 | Does Looking Inside a Circuit Help?. | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani |
| 2017 | On Multidimensional and Monotone k-SUM. | Chloe Ching-Yun Hsu, Chris Umans |
| 2017 | Model Checking and Validity in Propositional and Modal Inclusion Logics. | Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema |
| 2017 | Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. | Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou |
| 2017 | Domains for Higher-Order Games. | Matthew Hague, Roland Meyer, Sebastian Muskalla |
| 2017 | Counting Problems for Parikh Images. | Christoph Haase, Stefan Kiefer, Markus Lohrey |
| 2017 | Parameterized Algorithms and Kernels for Rainbow Matching. | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2017 | The Power of Programs over Monoids in DA. | Nathan Grosshans, Pierre McKenzie, Luc Segoufin |
| 2017 | Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. | Ludmila Glinskih, Dmitry Itsykson |
| 2017 | Variations on Inductive-Recursive Definitions. | Neil Ghani, Conor McBride, Fredrik Nordvall Forsberg, Stephan Spahn |
| 2017 | The Complexity of Boolean Surjective General-Valued CSPs. | Peter Fulla, Stanislav Zivn |
| 2017 | Structured Connectivity Augmentation. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2017 | Lossy Kernels for Hitting Subgraphs. | Eduard Eiben, Danny Hermelin, M. S. Ramanujan |
| 2017 | Attainable Values of Reset Thresholds. | Michalina Dzyga, Robert Ferens, Vladimir V. Gusev, Marek Szykula |
| 2017 | On the Expressive Power of Quasiperiodic SFT. | Bruno Durand, Andrei Romashchenko |
| 2017 | Weighted Operator Precedence Languages. | Manfred Droste, Stefan Dck, Dino Mandrioli, Matteo Pradella |
| 2017 | On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. | Palash Dey, Neeldhara Misra |