| 2026 | On Strictly Output-Sensitive Color Frequency Reporting. | Erwin Glazenburg, Frank Staals |
| 2026 | Optimal-Length Labeling Schemes and Fast Algorithms for k-Gathering and k-Broadcasting. | Adam Ganczorz, Tomasz Jurdzinski |
| 2026 | Parameterized Algorithms for Locally Minimal Defensive Alliance. | Ajinkya Gaikwad, Soumen Maity, Saket Saurabh |
| 2026 | Sublinear Work Parallel Quantum Algorithms for Computational Geometry. | Shion Fukuzawa, Michael T. Goodrich, Sandy Irani |
| 2026 | Pinwheel Scheduling with Real Periods. | Hiroshi Fujiwara, Kota Miyagi, Katsuhisa Ouchi |
| 2026 | Minimum Length Word-Representants of Treelike Permutation Graphs. | Tithi Dwary, Kanduru V. Krishna |
| 2026 | Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs. | Sabine Cornelsen, Henry Frster, Siddharth Gupta, Stephen G. Kobourov, Johannes Zink |
| 2026 | Private Graph Colouring with Limited Defectiveness. | Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe |
| 2026 | Complexity Aspects of Homomorphisms of Ordered Graphs. | Michal Certk, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski |
| 2026 | On the Order-Diameter Ratio of Girth-Diameter Cages. | Stijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede |
| 2026 | Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model. | Kunanon Burathep, Thomas Erlebach, William K. Moses Jr. |
| 2026 | Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction. | Nader H. Bshouty |
| 2026 | Exploiting Low Scanwidth to Resolve Soft Polytomies. | Sebastian Bruchhold, Mathias Weller |
| 2026 | On the Complexity of Constrained Reconfiguration and Motion Planning. | Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad, Naomi Nishimura |
| 2026 | Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs. | Therese Biedl, Prashant Gokhale |
| 2026 | Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time Algorithm. | Therese Biedl |
| 2026 | Overlapping Biclustering. | Matthias Bentert, Pl Grns Drange, Erlend Haugen |
| 2026 | Counting Large Patterns in Degenerate Graphs. | Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl |
| 2026 | A Practical Algorithm for 3-Admissibility. | Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl |
| 2026 | Efficient Trace Frequency Queries in Sparse Graphs. | Christine Awofeso, Pl Grns Drange, Patrick Greaves, Oded Lachish, Felix Reidl |
| 2026 | Quantified Colouring and H-Free Algorithmics. | Kristina Asimi, Tala Eagling-Vose, Santiago Guzmn-Pro, Barnaby Martin, Yiming Qiu |
| 2026 | Edge-Constrained Hamiltonian Paths on a Point Set. | Todor Antic, Aleksa Dzuklevski, Jir Fiala, Jan Kratochvl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink |
| 2026 | A Quadratic Lower Bound for 2dfas Against One-Way Liveness. | Kehinde Adeogun, Christos A. Kapoutsis |
| 2025 | Maximal α-Gapped Repeats in a Fibonacci String. | Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, Takashi Horiyama |
| 2025 | Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere. | Reuben Tate, Stephan J. Eidenbenz |