| 2018 | Generalized Budgeted Submodular Set Function Maximization. | Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj |
| 2018 | On Randomized Generation of Slowly Synchronizing Automata. | Costanza Catalano, Raphal M. Jungers |
| 2018 | Optimal Strategies in Pushdown Reachability Games. | Arnaud Carayol, Matthew Hague |
| 2018 | Linking Focusing and Resolution with Selection. | Guillaume Burel |
| 2018 | Consensus Strings with Small Maximum Distance and Small Distance Sum. | Laurent Bulteau, Markus L. Schmid |
| 2018 | On W[1]-Hardness as Evidence for Intractability. | Ralph Christian Bottesch |
| 2018 | The Complexity of Disjunctive Linear Diophantine Constraints. | Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet |
| 2018 | Pricing Problems with Buyer Preselection. | Vittorio Bil, Michele Flammini, Gianpiero Monaco, Luca Moscardelli |
| 2018 | Complexity of Preimage Problems for Deterministic Finite Automata. | Mikhail V. Berlinkov, Robert Ferens, Marek Szykula |
| 2018 | Balanced Connected Partitioning of Unweighted Grid Graphs. | Cedric Berenger, Peter Niebert, Kvin Perrot |
| 2018 | Average Case Analysis of Leaf-Centric Binary Tree Sources. | Louisa Seelbach Benkner, Markus Lohrey |
| 2018 | Give Me Some Slack: Efficient Network Measurements. | Ran Ben-Basat, Gil Einziger, Roy Friedman |
| 2018 | New Results on Directed Edge Dominating Set. | Rmy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis |
| 2018 | Collective Fast Delivery by Energy-Efficient Agents. | Andreas Brtschi, Daniel Graf, Mats Mihalk |
| 2018 | Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. | Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri |
| 2018 | Timed Network Games with Clocks. | Guy Avni, Shibashis Guha, Orna Kupferman |
| 2018 | Plain Stopping Time and Conditional Complexities Revisited. | Mikhail Andreev, Gleb Posobin, Alexander Shen |
| 2018 | Depth Two Majority Circuits for Majority and List Expanders. | Kazuyuki Amano |
| 2018 | On Efficiently Solvable Cases of Quantum k-SAT. | Marco Aldi, Niel de Beaudrap, Sevag Gharibian, Seyran Saeedi |
| 2018 | Maximum Area Axis-Aligned Square Packings. | Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tth |
| 2018 | Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. | Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh |
| 2018 | Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph. | Hasan Abasi |
| 2018 | Counting Homomorphisms to Trees Modulo a Prime. | Andreas Gbel, J. A. Gregor Lagodzinski, Karen Seidel |
| 2018 | Online Maximum Matching with Recourse. | Spyros Angelopoulos, Christoph Drr, Shendan Jin |
| 2017 | The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis. | Tomoyuki Yamakami |