| 2022 | Almost Optimal Proper Learning and Testing Polynomials. | Nader H. Bshouty |
| 2022 | On the Zombie Number of Various Graph Classes. | Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer |
| 2022 | Local Routing Algorithms on Euclidean Spanners with Small Diameter. | Nicolas Bonichon, Prosenjit Bose, Yan Garito |
| 2022 | Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. | Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlickov, Arash Rafiey |
| 2022 | A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schrder Trees. | Olivier Bodini, Antoine Genitrini, Mehdi Naima |
| 2022 | List Homomorphism: Beyond the Known Boundaries. | Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma |
| 2022 | A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center. | Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa |
| 2022 | Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). | Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi |
| 2022 | Piercing Pairwise Intersecting Convex Shapes in the Plane. | Saman Bazargani, Ahmad Biniaz, Prosenjit Bose |
| 2022 | Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. | Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini |
| 2022 | On the Zero-Sum Ramsey Problem over $\mathbb {Z}_2^d$. | Jos D. Alvarado, Lucas Colucci, Roberto Parente, Victor Souza |
| 2022 | Exact Learning of Multitrees and Almost-Trees Using Path Queries. | Ramtin Afshar, Michael T. Goodrich |
| 2022 | Multidimensional Manhattan Preferences. | Jiehua Chen, Martin Nllenburg, Sofia Simola, Anas Villedieu, Markus Wallinger |
| 2022 | Elastic-Degenerate String Matching with 1 Error. | Giulia Bernardini, Estban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba |
| 2022 | Obtaining Approximately Optimal and Diverse Solutions via Dispersion. | Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang |
| 2020 | Exponential-Time Quantum Algorithms for Graph Coloring Problems. | Kazuya Shimizu, Ryuhei Mori |
| 2020 | Thresholds in the Lattice of Subspaces of $\mathbb {F}_q^n$. | Benjamin Rossman |
| 2020 | The Hardness of Sampling Connected Subgraphs. | Andrew Read-McFarland, Daniel Stefankovic |
| 2020 | Tractable Unordered 3-CNF Games. | Md Lutfar Rahman, Thomas Watson |
| 2020 | Rectilinear Convex Hull of Points in 3D. | Pablo Prez-Lantero, Carlos Seara, Jorge Urrutia |
| 2020 | A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. | Lehilton L. C. Pedrosa, Hugo K. K. Rosado |
| 2020 | Approximating Routing and Connectivity Problems with Multiple Distances. | Lehilton L. C. Pedrosa, Greis Y. O. Quesqun |
| 2020 | Simple Intrinsic Simulation of Cellular Automata in Oritatami Molecular Folding Model. | Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Yuki Ubukata |
| 2020 | On Symmetry and Initialization for Neural Networks. | Ido Nachum, Amir Yehudayoff |
| 2020 | Hardness of Variants of the Graph Coloring Game. | Thiago Marcilon, Nicolas Almeida Martins, Rudini Menezes Sampaio |