| 2026 | Maintaining a Kingdom in a Tournament. | Oren Weimann, Raphael Yuster |
| 2026 | Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder. | Jannik Schestag |
| 2026 | Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set. | Rin Saito, Anouk Sommer, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura |
| 2026 | Distribution Testing Meets Sum Estimation. | Sampriti Roy |
| 2026 | Clique-Free t-Matchings in Degree-Bounded Graphs. | Katarzyna E. Paluch, Mateusz Wasylkiewicz |
| 2026 | Vertical-Horizontal Full Compatibility of One-Dimensional Subshifts. | Arthur Mittelstaedt, Gatan Richard |
| 2026 | On the Complexity of Capacitated Vehicle Routing with Order Restrictions. | Steven Miltenburg, Tim Oosterwijk, Ren Sitters |
| 2026 | The Rectilinear Steiner Forest Arborescence. | Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski |
| 2026 | Reverse Mathematics for Neural Networks. | Yoshihiro Maruyama |
| 2026 | Algorithms and Complexity Results for K-Theoretic Persistent Homology. | Yoshihiro Maruyama |
| 2026 | Enumeration With Nice Roman Domination Properties. | Kevin Mann |
| 2026 | On the Sprague-Grundy Values of Games with a Pass. | Hikaru Manabe, Ryohei Miyadera, Koki Suetsugu |
| 2026 | Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes. | Nadym Mallek, Kirill Simonov |
| 2026 | Mutually Abelian-Bordered Binary Words. | Anuran Maity, Kanduru V. Krishna |
| 2026 | Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth. | Nicolas El Maalouly, Kostas Lakis |
| 2026 | Limitations of Density-Based Heuristics and an Alternative Approach for Pinwheel Scheduling with Durations. | Yosuke Kusano |
| 2026 | Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. | Christian Komusiewicz, Diptapriyo Majumdar |
| 2026 | Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes. | Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries. | Souta Kobayashi, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2026 | Towards an Algebraic Approach to the Reconfiguration CSP. | Kei Kimura |
| 2026 | Asymptotically Optimal Representation of Palindromic Structure. | Michael Itzhaki |
| 2026 | k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs. | Petr Hlinen, Jan Jedelsk |
| 2026 | Finding a HIST: Chordality, Structural Parameters, and Diameter. | Tesshu Hanaka, Hironori Kiya, Hirotaka Ono |
| 2026 | The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts. | Niklas Haas, Sren Schmitt, Rob van Stee |
| 2026 | Bounds and Hardness Results for Conflict-Free Choosability. | Shiwali Gupta, Rogers Mathew |