| 2019 | Eventually Dendric Shifts. | Francesco Dolce, Dominique Perrin |
| 2019 | Belga B-Trees. | Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman |
| 2019 | Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. | Bireswar Das, Shivdutt Sharma |
| 2019 | Approximations of Schatten Norms via Taylor Expansions. | Vladimir Braverman |
| 2019 | On Induced Online Ramsey Number of Paths, Cycles, and Trees. | Vclav Blazej, Pavel Dvork, Toms Valla |
| 2019 | Quantum Algorithm for Distribution-Free Junta Testing. | Aleksandrs Belovs |
| 2019 | A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization. | Mahdi Belbasi, Martin Frer |
| 2019 | Reconstructing a Convex Polygon from Its \omega ω -cloud. | Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot |
| 2019 | The Non-hardness of Approximating Circuit Size. | Eric Allender, Rahul Ilango, Neekon Vafa |
| 2019 | Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. | Yousef M. Alhamdan, Alexander V. Kononov |
| 2019 | Undecidable Word Problem in Subshift Automorphism Groups. | Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier |
| 2018 | A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract). | Ning Xie, Shuai Xu, Yekun Xu |
| 2018 | On Strong NP-Completeness of Rational Problems. | Dominik Wojtczak |
| 2018 | Online Labeling: Algorithms, Lower Bounds and Open Questions. | Michael E. Saks |
| 2018 | On Emptiness and Membership Problems for Set Automata. | Alexander A. Rubtsov, Mikhail N. Vyalyi |
| 2018 | On the Decision Trees with Symmetries. | Artur Riazanov |
| 2018 | Facility Location on Planar Graphs with Unreliable Links. | N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan |
| 2018 | Slopes of 3-Dimensional Subshifts of Finite Type. | Etienne Moutot, Pascal Vanier |
| 2018 | Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. | Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi |
| 2018 | Lower Bounds for Unrestricted Boolean Circuits: Open Problems. | Alexander S. Kulikov |
| 2018 | Recognizing Read-Once Functions from Depth-Three Formulas. | Alexander Kozachinskiy |
| 2018 | On Vertex Coloring Without Monochromatic Triangles. | Michal Karpinski, Krzysztof Piecuch |
| 2018 | Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. | Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra |
| 2018 | Maximum Colorful Cycles in Vertex-Colored Graphs. | Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham |
| 2018 | Operations on Boolean and Alternating Finite Automata. | Michal Hospodr, Galina Jirskov, Ivana Krajnkov |