| 2026 | Minimizing Vertical Length in Linked Bar Charts. | Steven van den Broek, Marc J. van Kreveld, Wouter Meulemans, Arjen Simons |
| 2026 | Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and Locally. | Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedlickov |
| 2026 | Disjoint Tours and the Price of Diversity. | Mark de Berg, Andrs Lpez Martnez, Frits C. R. Spieksma |
| 2026 | Graph Irregularity via Edge Deletions. | Julien Bensmail, Nomie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid |
| 2026 | Complexity of Perfect (1, 2)-Dominating Sets in Low-Degree Graphs. | Urszula Bednarz, Jan Kratochvl, Adrian Michalski |
| 2026 | On the Computational Complexity of Covering Multi-Interface Networks. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer |
| 2026 | Cartesian Forest Matching. | Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq |
| 2026 | Can One Flip Spoil it All? | Pragya Arora, Palash Dey, Neeldhara Misra |
| 2026 | The Gate-Cover Problem. | Esther M. Arkin, Alon Efrat, Omrit Filtser, Stephen G. Kobourov, Jan Kratochvl, Joseph S. B. Mitchell, Ariel Rosenberg |
| 2026 | On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum. | Afrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian |
| 2026 | Space Efficient Algorithms for Parameterised Problems. | Sheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip |
| 2026 | Minimum-Weight Outerplane Laman Graphs. | Oswin Aichholzer, Yuya Higashikawa, Joachim Orthaber, Daniel Perz, Birgit Vogtenhuber, Alexandra Weinberger |
| 2026 | Trajectory Visibility at First Sight. | Mohammad Ali Abam, Mohammad Ghodsi, Seyed Mohammad Hussein Kazemi |
| 2025 | The Connected k-Vertex One-Center Problem on Graphs. | Jingru Zhang |
| 2025 | Online Contention Resolution Schemes for Size-Stochastic Knapsacks. | Toru Yoshinaga, Yasushi Kawase |
| 2025 | Dag-Like Unit Refutations in UTVPI Constraint Systems. | Piotr Wojciechowski, K. Subramani |
| 2025 | A Unified Model of Congestion Games with Priorities - Two-Sided Markets with Ties, Finite and Non-affine Delay Functions, and Pure Nash Equilibria. | Kenjiro Takazawa |
| 2025 | Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules. | Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2025 | Abelian and Stochastic Sandpile Models on Complete Bipartite Graphs. | Thomas Selig, Haoyue Zhu |
| 2025 | NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger. | Suthee Ruangwises |
| 2025 | Maximize the Rightmost Digit:Gray Codes for Restricted Growth Strings. | Yuan Qiu, Joe Sawada, Aaron Williams |
| 2025 | Min-Sum Disjoint Paths on Subclasses of Chordal Graphs. | Bar Menashe, Meirav Zehavi |
| 2025 | Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems. | Jingyi Liu, Xian Chen, Yicheng Zheng, Jianxin Wang, Feng Shi |
| 2025 | Reconfiguration Using Generalized Token Jumping. | Jan Matys Kristan, Jakub Svoboda |
| 2025 | Approximation Algorithms for Non-sequential Star Packing Problems. | Mengyuan Hu, An Zhang, Yong Chen, Mingyang Gong, Guohui Lin |