| 2022 | Graph Parameters, Implicit Representations and Factorial Properties. | Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev |
| 2022 | Perfect Matchings with Crossings. | Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber |
| 2022 | Distance from Triviality 2.0: Hybrid Parameterizations. | Akanksha Agrawal, M. S. Ramanujan |
| 2022 | Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model. | Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal |
| 2021 | Search for Combinatorial Objects Using Lattice Algorithms - Revisited. | Alfred Wassermann |
| 2021 | Heuristically Enhanced IPO Algorithms for Covering Array Generation. | Michael Wagner, Ludwig Kampel, Dimitris E. Simos |
| 2021 | Backtrack Search for Parallelisms of Projective Spaces. | Svetlana Topalova, Stela Zhelezova |
| 2021 | New Approximations and Hardness Results for Submodular Partitioning Problems. | Richard Santiago |
| 2021 | Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs. | Rahnuma Islam Nishat, Srinivasan Venkatesh, Sue Whitesides |
| 2021 | Knigsberg Sightseeing: Eulerian Walks in Temporal Graphs. | Andrea Marino, Ana Silva |
| 2021 | A Study on the Existence of Null Labelling for 3-Hypergraphs. | Niccol Di Marco, Andrea Frosini, William Lawrence Kocay |
| 2021 | Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations. | Yoshifumi Manabe, Hibiki Ono |
| 2021 | Non-preemptive Tree Packing. | Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf |
| 2021 | Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. | Soh Kumabe, Takanori Maehara |
| 2021 | Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. | Martin Kucera, Ondrej Such |
| 2021 | Disjoint Paths and Connected Subgraphs for H-Free Graphs. | Walter Kern, Barnaby Martin, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2021 | Intersecting Disks Using Two Congruent Disks. | Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn |
| 2021 | Isomorphic Unordered Labeled Trees up to Substitution Ciphering. | Florian Ingels, Romain Azas |
| 2021 | Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k. | Toru Hasunuma |
| 2021 | Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract). | Konstantinos Georgiou, Somnath Kundu, Pawel Pralat |
| 2021 | Complexity and Algorithms for MUL-Tree Pruning. | Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk |
| 2021 | Piercing All Translates of a Set of Axis-Parallel Rectangles. | Adrian Dumitrescu, Josef Tkadlec |
| 2021 | An Efficient Noisy Binary Search in Graphs via Median Approximation. | Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski |
| 2021 | On an Ordering Problem in Weighted Hypergraphs. | Peter Damaschke |
| 2021 | Vertex Cover at Distance on H-Free Graphs. | Clment Dallard, Mirza Krbezlija, Martin Milanic |