| 2023 | Deciding the Erdős-Psa Property in 3-Connected Digraphs. | Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva |
| 2023 | Odd Chromatic Number of Graph Classes. | Rmy Belmonte, Ararat Harutyunyan, Noleen Khler, Nikolaos Melissinos |
| 2023 | Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. | Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter |
| 2023 | Reconstructing Graphs from Connected Triples. | Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen |
| 2023 | Proportionally Fair Matching with Multiple Groups. | Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov |
| 2023 | Approximating Bin Packing with Conflict Graphs via Maximization Techniques. | Ilan Doron-Arad, Hadas Shachnai |
| 2022 | Minimum Weight Euclidean (1+ε )-Spanners. | Csaba D. Tth |
| 2022 | Linearizing Partial Search Orders. | Robert Scheffler |
| 2022 | Classifying Subset Feedback Vertex Set for H-Free Graphs. | Giacomo Paesani, Danil Paulusma, Pawel Rzazewski |
| 2022 | Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. | Barnaby Martin, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2022 | Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. | Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini |
| 2022 | Algorithmic Aspects of Small Quasi-Kernels. | Hlne Langlois, Frdric Meunier, Romeo Rizzi, Stphane Vialette |
| 2022 | The Complexity of Contracting Bipartite Graphs into Small Cycles. | R. Krithika, Roohani Sharma, Prafullkumar Tale |
| 2022 | Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2022 | On Fully Diverse Sets of Geometric Objects and Graphs. | Fabian Klute, Marc J. van Kreveld |
| 2022 | Computing List Homomorphisms in Geometric Intersection Graphs. | Sndor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski |
| 2022 | On Anti-stochastic Properties of Unlabeled Graphs. | Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii |
| 2022 | Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. | Hugo Jacob, Marcin Pilipczuk |
| 2022 | The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. | Ina Goemann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink |
| 2022 | Parameterized Complexity of Weighted Multicut in Trees. | Esther Galby, Dniel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale |
| 2022 | Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates. | Mathew C. Francis, Atrayee Majumder, Rogers Mathew |
| 2022 | Extending Partial Representations of Circular-Arc Graphs. | Jir Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman |
| 2022 | Generalized k-Center: Distinguishing Doubling and Highway Dimension. | Andreas Emil Feldmann, Tung Anh Vu |
| 2022 | On the Lossy Kernelization for Connected Treedepth Deletion Set. | Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2022 | On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy. | Gabriel L. Duarte, Uverton S. Souza |