| 2017 | A Strategy for Dynamic Programs: Start over and Muddle Through. | Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume |
| 2017 | On Reversible Transducers. | Luc Dartois, Paulin Fournier, Ismal Jecker, Nathan Lhote |
| 2017 | On Problems Equivalent to (min, +)-Convolution. | Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk |
| 2017 | Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. | Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas |
| 2017 | The Infinite Server Problem. | Christian Coester, Elias Koutsoupias, Philip Lazos |
| 2017 | Efficient Quantum Algorithms for Simulating Lindblad Evolution. | Richard Cleve, Chunhao Wang |
| 2017 | Regular Separability of Parikh Automata. | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2017 | Saving Critical Nodes with Firefighters is FPT. | Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan |
| 2017 | On the Complexity of Quantified Integer Programming. | Dmitry Chistikov, Christoph Haase |
| 2017 | Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. | Shahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz |
| 2017 | A Counterexample to Thiagarajan's Conjecture on Regular Event Structures. | Jrmie Chalopin, Victor Chepoi |
| 2017 | Randomized Load Balancing on Networks with Stochastic Inputs. | Leran Cai, Thomas Sauerwald |
| 2017 | Continuity and Rational Functions. | Michal Cadilhac, Olivier Carton, Charles Paperman |
| 2017 | On Finding the Jaccard Center. | Marc Bury, Chris Schwiegelshohn |
| 2017 | Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. | Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger |
| 2017 | A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. | Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer |
| 2017 | Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. | Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala |
| 2017 | A Universal Ordinary Differential Equation. | Olivier Bournez, Amaury Pouly |
| 2017 | The Parameterized Complexity of Positional Games. | douard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rmmele, Abdallah Saffidine |
| 2017 | Emptiness of Zero Automata Is Decidable. | Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi |
| 2017 | Which Classes of Origin Graphs Are Generated by Transducers. | Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle |
| 2017 | Orbit-Finite Sets and Their Algorithms (Invited Talk). | Mikolaj Bojanczyk |
| 2017 | An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. | Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo |
| 2017 | Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. | Toni Bhnlein, Stefan Kratsch, Oliver Schaudt |
| 2017 | Approximate Bounded Indistinguishability. | Andrej Bogdanov, Christopher Williamson |