| 2017 | Sequentialization Using Timestamps. | Anand Yeolekar, Kumar Madhukar, Dipali Bhutada, R. Venkatesh |
| 2017 | Fast Searching on Cartesian Products of Graphs. | Yuan Xue, Boting Yang |
| 2017 | Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. | Mingyu Xiao, Shaowei Kou |
| 2017 | Degrees of Word Problem for Algebras Without Finitely Presented Expansions. | Guohua Wu, Huishan Wu |
| 2017 | An All-or-Nothing Flavor to the Church-Turing Hypothesis. | Stefan Wolf |
| 2017 | Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems. | Xuehou Tan, Bo Jiang |
| 2017 | On the Complexity of Breaking Pseudoentropy. | Maciej Skrski |
| 2017 | A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. | Maciej Skrski |
| 2017 | Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs. | Yangguang Shi, Fa Zhang, Zhiyong Liu |
| 2017 | From Nonstandard Analysis to Various Flavours of Computability Theory. | Sam Sanders |
| 2017 | The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. | Heiko Rglin, Clemens Rsner |
| 2017 | Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). | Mozhgan Pourmoradnasseri, Dirk Oliver Theis |
| 2017 | On Complexity of Total Vertex Cover on Subcubic Graphs. | Sheung-Hung Poon, Wei-Lin Wang |
| 2017 | On the Conjecture of the Smallest 3-Cop-Win Planar Graph. | Photchchara Pisantechakool, Xuehou Tan |
| 2017 | A Density Theorem for Hierarchies of Limit Spaces over Separable Metric Spaces. | Iosif Petrakis |
| 2017 | Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. | Danil Paulusma, Christophe Picouleau, Bernard Ries |
| 2017 | qPCF: A Language for Quantum Circuit Computations. | Luca Paolini, Margherita Zorzi |
| 2017 | Bchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order. | Arthur Milchior |
| 2017 | Parameterized Complexity of Fair Deletion Problems. | Toms Masark, Toms Toufar |
| 2017 | On Choice Rules in Dependent Type Theory. | Maria Emilia Maietti |
| 2017 | Bounding the Dimension of Points on a Line. | Neil Lutz, Donald M. Stull |
| 2017 | An O(n | Minming Li, Frances F. Yao, Hao Yuan |
| 2017 | Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. | Andrzej Lingas, Mia Persson, Dzmitry Sledneu |
| 2017 | Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. | Andrzej Lingas |
| 2017 | Cognitive Reasoning and Trust in Human-Robot Interactions. | Marta Kwiatkowska |