| 2017 | A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Maciej Skórski |
| 2017 | A Density Theorem for Hierarchies of Limit Spaces over Separable Metric Spaces. Iosif Petrakis |
| 2017 | A Note on Effective Categoricity for Linear Orderings. Nikolay Bazhenov |
| 2017 | Algorithmic Aspects of the Maximum Colorful Arborescence Problem. Guillaume Fertin, Julien Fradin, Géraldine Jean |
| 2017 | An All-or-Nothing Flavor to the Church-Turing Hypothesis. Stefan Wolf |
| 2017 | An O(n Minming Li, Frances F. Yao, Hao Yuan |
| 2017 | Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. Daniël Paulusma, Christophe Picouleau, Bernard Ries |
| 2017 | Bounding the Dimension of Points on a Line. Neil Lutz, Donald M. Stull |
| 2017 | Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model. Andrzej Lingas, Mia Persson, Dzmitry Sledneu |
| 2017 | Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order. Arthur Milchior |
| 2017 | Cognitive Reasoning and Trust in Human-Robot Interactions. Marta Kwiatkowska |
| 2017 | Continuous Firefighting on Infinite Square Grids. Xujin Chen, Xiaodong Hu, Changjun Wang, Ying Zhang |
| 2017 | Counting Minimal Dominating Sets. Mamadou Moustapha Kanté, Takeaki Uno |
| 2017 | Covering Polygons with Rectangles. Roland Glück |
| 2017 | Degrees of Word Problem for Algebras Without Finitely Presented Expansions. Guohua Wu, Huishan Wu |
| 2017 | Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems. Xuehou Tan, Bo Jiang |
| 2017 | Fast Searching on Cartesian Products of Graphs. Yuan Xue, Boting Yang |
| 2017 | From Nonstandard Analysis to Various Flavours of Computability Theory. Sam Sanders |
| 2017 | Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed Graphs. Yangguang Shi, Fa Zhang, Zhiyong Liu |
| 2017 | Incompleteness Theorems, Large Cardinals, and Automata over Finite Words. Olivier Finkel |
| 2017 | Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. Mingyu Xiao, Shaowei Kou |
| 2017 | Learning AC Ning Ding, Yanli Ren, Dawu Gu |
| 2017 | Mediated Population Protocols: Leader Election and Applications. Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta |
| 2017 | Multi-interval Pairwise Compatibility Graphs - (Extended Abstract). Shareef Ahmed, Md. Saidur Rahman |
| 2017 | Natural Language Processing, Moving from Rules to Data. Adrian-Horia Dediu, Joana M. Matos, Carlos Martín-Vide |
| 2017 | Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract). Mozhgan Pourmoradnasseri, Dirk Oliver Theis |
| 2017 | On Choice Rules in Dependent Type Theory. Maria Emilia Maietti |
| 2017 | On Complexity of Total Vertex Cover on Subcubic Graphs. Sheung-Hung Poon, Wei-Lin Wang |
| 2017 | On Resource-Bounded Versions of the van Lambalgen Theorem. Diptarka Chakraborty, Satyadev Nandakumar, Himanshu Shukla |
| 2017 | On the Complexity of Breaking Pseudoentropy. Maciej Skórski |
| 2017 | On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. Hans Kleine Büning, Piotr Wojciechowski, K. Subramani |
| 2017 | On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen |
| 2017 | On the Conjecture of the Smallest 3-Cop-Win Planar Graph. Photchchara Pisantechakool, Xuehou Tan |
| 2017 | On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One. Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier |
| 2017 | On the Maximum Weight Minimal Separator. Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono |
| 2017 | On the Shortest Common Superstring of NGS Reads. Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru |
| 2017 | Parameterized Complexity of Fair Deletion Problems. Tomás Masarík, Tomás Toufar |
| 2017 | Parikh Images of Matrix Ins-Del Systems. Henning Fernau, Lakshmanan Kuppusamy |
| 2017 | Pebble Games over Ordered Structural Abstractions. Yuguo He |
| 2017 | Scheduling Fully Parallel Jobs with Integer Parallel Units. Vincent Chau, Minming Li, Kai Wang |
| 2017 | Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity. Ken C. K. Fong, Minming Li, Yungao Li, Sheung-Hung Poon, Weiwei Wu, Yingchao Zhao |
| 2017 | Sequentialization Using Timestamps. Anand Yeolekar, Kumar Madhukar, Dipali Bhutada, R. Venkatesh |
| 2017 | The Complexity of Perfect Packings in Dense Graphs. Jie Han |
| 2017 | The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. Heiko Röglin, Clemens Rösner |
| 2017 | The Strength of the SCT Criterion. Emanuele Frittaion, Silvia Steila, Keita Yokoyama |
| 2017 | Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings T. V. Gopal, Gerhard Jäger, Silvia Steila |
| 2017 | Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution. Andrzej Lingas |
| 2017 | Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis. Faisal N. Abu-Khzam, Shaowei Cai, Judith Egan, Peter Shaw, Kai Wang |
| 2017 | Vector Ambiguity and Freeness Problems in SL (2, ℤ). Sang-Ki Ko, Igor Potapov |
| 2017 | qPCF: A Language for Quantum Circuit Computations. Luca Paolini, Margherita Zorzi |