| 2020 | The Normalized Algorithmic Information Distance Can Not Be Approximated. | Bruno Bauwens, Ilya Blinnikov |
| 2020 | An Improvement to Chvtal and Thomassen's Upper Bound for Oriented Diameter. | Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka |
| 2020 | Faster 2-Disjoint-Shortest-Paths Algorithm. | Maxim Akhmedov |
| 2020 | Parameterized Analysis of Art Gallery and Terrain Guarding. | Akanksha Agrawal, Meirav Zehavi |
| 2020 | Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations. | Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev |
| 2019 | AND Protocols Using only Uniform Shuffles. | Suthee Ruangwises, Toshiya Itoh |
| 2019 | Unpopularity Factor in the Marriage and Roommates Problems. | Suthee Ruangwises, Toshiya Itoh |
| 2019 | Sybil-Resilient Conductance-Based Community Growth. | Ouri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon |
| 2019 | A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs. | Denis K. Ponomaryov |
| 2019 | Transition Property for Cube-Free Words. | Elena A. Petrova, Arseny M. Shur |
| 2019 | The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. | Neeldhara Misra, Piyush Rathi |
| 2019 | On the Parameterized Complexity of Edge-Linked Paths. | Neeldhara Misra, Fahad Panolan, Saket Saurabh |
| 2019 | Uniform CSP Parameterized by Solution Size is in W[1]. | Ruhollah Majdoddin |
| 2019 | On the Complexity of Mixed Dominating Set. | Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh |
| 2019 | On the Complexity of Restarting. | Jan-Hendrik Lorenz |
| 2019 | On the Quantum and Classical Complexity of Solving Subtraction Games. | Dmitry Kravchenko, Kamil Khadiev, Danil Serov |
| 2019 | Computational Complexity of Real Powering and Improved Solving Linear Differential Equations. | Ivan Koswara, Svetlana Selivanova, Martin Ziegler |
| 2019 | Forward Looking Huffman Coding. | Shmuel Tomi Klein, Shoham Saadia, Dana Shapira |
| 2019 | Parameterized Complexity of Conflict-Free Set Cover. | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman |
| 2019 | Notes on Resolution over Linear Equations. | Svyatoslav Gryaznov |
| 2019 | Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. | Andreas Goerdt |
| 2019 | On Tseitin Formulas, Read-Once Branching Programs and Treewidth. | Ludmila Glinskih, Dmitry Itsykson |
| 2019 | Derandomization for Sliding Window Algorithms with Strict Correctness. | Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2019 | Minimizing Branching Vertices in Distance-Preserving Subgraphs. | Kshitij Gajjar, Jaikumar Radhakrishnan |
| 2019 | On Decidability of Regular Languages Theories. | Sergey M. Dudakov, Boris Karlov |