| 2020 | Maximizing Happiness in Graphs of Bounded Clique-Width. | Ivan Bliznets, Danil Sagunov |
| 2020 | On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. | Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov |
| 2020 | Computing Balanced Convex Partitions of Lines. | Sergey Bereg |
| 2020 | On the Collection of Fringe Subtrees in Random Binary Trees. | Louisa Seelbach Benkner, Stephan G. Wagner |
| 2020 | Batched Predecessor and Sorting with Size-Priced Information in External Memory. | Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas |
| 2020 | An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures. | Frank Bauernppel, Anil Maheshwari, Jrg-Rdiger Sack |
| 2020 | Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. | Gill Barequet, Mira Shalah |
| 2020 | On Minimal-Perimeter Lattice Animals. | Gill Barequet, Gil Ben-Shachar |
| 2020 | Lower Bounds for Testing Complete Positivity and Quantum Separability. | Costin Badescu, Ryan O'Donnell |
| 2020 | Dynamically Optimal Self-adjusting Single-Source Tree Networks. | Chen Avin, Kaushik Mondal, Stefan Schmid |
| 2020 | Flips in Higher Order Delaunay Triangulations. | Elena Arseneva, Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira |
| 2020 | Transmitting once to Elect a Leader on Wireless Networks. | Ny Aina Andriambolamalala, Vlady Ravelomanana |
| 2020 | How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. | Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn |
| 2020 | Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques. | Sancrey Rodrigues Alves, Fernanda Couto, Lurbio Faria, Sylvain Gravier, Sulamita Klein, Uverton S. Souza |
| 2020 | Binary Decision Diagrams: From Tree Compaction to Sampling. | Julien Clment, Antoine Genitrini |
| 2018 | Quadratic Simulations of Merlin-Arthur Games. | Thomas Watson |
| 2018 | On Counting Perfect Matchings in General Graphs. | Daniel Stefankovic, Eric Vigoda, John Wilmes |
| 2018 | Analysis of the Continued Logarithm Algorithm. | Pablo Rotondo, Brigitte Valle, Alfredo Viola |
| 2018 | Transition Operations over Plane Trees. | Torrie L. Nichols, Alexander Pilz, Csaba D. Tth, Ahad N. Zehmakan |
| 2018 | Rapid Mixing of k-Class Biased Permutations. | Sarah Miracle, Amanda Pascoe Streib |
| 2018 | A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs. | Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms |
| 2018 | Mutants and Residents with Different Connection Graphs in the Moran Process. | Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2018 | Two-Dimensional Knapsack for Circles. | Carla Negri Lintzmayer, Flvio Keidi Miyazawa, Eduardo Candido Xavier |
| 2018 | Satisfying Neighbor Preferences on a Circle. | Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende |
| 2018 | A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game. | Yoshiharu Kohayakawa, Flvio Keidi Miyazawa, Yoshiko Wakabayashi |