| 2018 | Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. | Sren Henning, Klaus Jansen, Malin Rau, Lars Schmarje |
| 2018 | Complexity of Generation. | Vladimir Gurvich |
| 2018 | Structural Parameterizations of Dominating Set Variants. | Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman |
| 2018 | Closure Under Reversal of Languages over Infinite Alphabets. | Daniel Genkin, Michael Kaminski, Liat Peterfreund |
| 2018 | Complement for Two-Way Alternating Automata. | Viliam Geffert |
| 2018 | Grammar-Based Compression of Unranked Trees. | Adri Gascn, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber |
| 2018 | Periodicity in Data Streams with Wildcards. | Funda Ergn, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou |
| 2018 | Can We Create Large k-Cores by Adding Few Edges? | Rajesh Chitnis, Nimrod Talmon |
| 2018 | A Tight Lower Bound for Steiner Orientation. | Rajesh Chitnis, Andreas Emil Feldmann |
| 2018 | The Clever Shopper Problem. | Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stphane Vialette |
| 2018 | Distributed Symmetry-Breaking Algorithms for Congested Cliques. | Leonid Barenboim, Victor Khazanov |
| 2018 | Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. | Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti |
| 2018 | Quadratically Tight Relations for Randomized Query Complexity. | Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs |
| 2017 | On a Generalization of Horn Constraint Systems. | Piotr Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani |
| 2017 | The Descriptive Complexity of Subgraph Isomorphism Without Numerics. | Oleg Verbitsky, Maksim Zhukovskii |
| 2017 | Dag-Like Communication and Its Applications. | Dmitry Sokolov |
| 2017 | On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem. | Alexander V. Seliverstov |
| 2017 | Can We Locally Compute Sparse Connected Subgraphs? | Ronitt Rubinfeld |
| 2017 | The (Minimum) Rank of Typical Fooling-Set Matrices. | Mozhgan Pourmoradnasseri, Dirk Oliver Theis |
| 2017 | Concatenation Hierarchies: New Bottle, Old Wine. | Thomas Place, Marc Zeitoun |
| 2017 | Edit Distance Neighbourhoods of Input-Driven Pushdown Automata. | Alexander Okhotin, Kai Salomaa |
| 2017 | Popularity in the Generalized Hospital Residents Setting. | Meghana Nasre, Amit Rawat |
| 2017 | On Algorithmic Statistics for Space-Bounded Algorithms. | Alexey Milovanov |
| 2017 | The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$. | Alexei Miasnikov, Svetla Vassileva, Armin Wei |
| 2017 | Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs. | Andrew McGregor |