| 2026 | A Practical Algorithm for 3-Admissibility. Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl |
| 2026 | A Quadratic Lower Bound for 2dfas Against One-Way Liveness. Kehinde Adeogun, Christos Kapoutsis |
| 2026 | Algorithms and Complexity Results for K-Theoretic Persistent Homology. Yoshihiro Maruyama |
| 2026 | Asymptotically Optimal Representation of Palindromic Structure. Michael Itzhaki |
| 2026 | Bounds and Hardness Results for Conflict-Free Choosability. Shiwali Gupta, Rogers Mathew |
| 2026 | Clique-Free t-Matchings in Degree-Bounded Graphs. Katarzyna E. Paluch, Mateusz Wasylkiewicz |
| 2026 | Complexity Aspects of Homomorphisms of Ordered Graphs. Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski |
| 2026 | Counting Large Patterns in Degenerate Graphs. Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl |
| 2026 | Distribution Testing Meets Sum Estimation. Sampriti Roy |
| 2026 | Edge-Constrained Hamiltonian Paths on a Point Set. Todor Antic, Aleksa Dzuklevski, Jirí Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, Johannes Zink |
| 2026 | Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries. Souta Kobayashi, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2026 | Efficient Trace Frequency Queries in Sparse Graphs. Christine Awofeso, Pål Grønås Drange, Patrick Greaves, Oded Lachish, Felix Reidl |
| 2026 | Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree. Christian Komusiewicz, Diptapriyo Majumdar |
| 2026 | Enumeration With Nice Roman Domination Properties. Kevin Mann |
| 2026 | Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth. Nicolas El Maalouly, Kostas Lakis |
| 2026 | Exploiting Low Scanwidth to Resolve Soft Polytomies. Sebastian Bruchhold, Mathias Weller |
| 2026 | Face-Hitting Dominating Sets in Plane Graphs: Alternative Proof and Linear-Time Algorithm. Therese Biedl |
| 2026 | Finding a HIST: Chordality, Structural Parameters, and Diameter. Tesshu Hanaka, Hironori Kiya, Hirotaka Ono |
| 2026 | Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs. Sabine Cornelsen, Henry Förster, Siddharth Gupta, Stephen G. Kobourov, Johannes Zink |
| 2026 | Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model. Kunanon Burathep, Thomas Erlebach, William K. Moses Jr. |
| 2026 | Limitations of Density-Based Heuristics and an Alternative Approach for Pinwheel Scheduling with Durations. Yosuke Kusano |
| 2026 | Maintaining a Kingdom in a Tournament. Oren Weimann, Raphael Yuster |
| 2026 | Minimum Length Word-Representants of Treelike Permutation Graphs. Tithi Dwary, Kanduru V. Krishna |
| 2026 | Mutually Abelian-Bordered Binary Words. Anuran Maity, Kanduru V. Krishna |
| 2026 | On Strictly Output-Sensitive Color Frequency Reporting. Erwin Glazenburg, Frank Staals |
| 2026 | On the Complexity of Capacitated Vehicle Routing with Order Restrictions. Steven Miltenburg, Tim Oosterwijk, René Sitters |
| 2026 | On the Complexity of Constrained Reconfiguration and Motion Planning. Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad, Naomi Nishimura |
| 2026 | On the Order-Diameter Ratio of Girth-Diameter Cages. Stijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede |
| 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 | Optimal-Length Labeling Schemes and Fast Algorithms for k-Gathering and k-Broadcasting. Adam Ganczorz, Tomasz Jurdzinski |
| 2026 | Overlapping Biclustering. Matthias Bentert, Pål Grønås Drange, Erlend Haugen |
| 2026 | Parameterized Algorithms for Locally Minimal Defensive Alliance. Ajinkya Gaikwad, Soumen Maity, Saket Saurabh |
| 2026 | Pinwheel Scheduling with Real Periods. Hiroshi Fujiwara, Kota Miyagi, Katsuhisa Ouchi |
| 2026 | Private Graph Colouring with Limited Defectiveness. Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe |
| 2026 | Quantified Colouring and H-Free Algorithmics. Kristina Asimi, Tala Eagling-Vose, Santiago Guzmán-Pro, Barnaby Martin, Yiming Qiu |
| 2026 | Reverse Mathematics for Neural Networks. Yoshihiro Maruyama |
| 2026 | SOFSEM 2026: Theory and Practice of Computer Science - 51st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2026, Kraków, Poland, February 9-13, 2026, Proceedings Jakub Kozik, Alexander Wolff |
| 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 | Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes. Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction. Nader H. Bshouty |
| 2026 | Sublinear Work Parallel Quantum Algorithms for Computational Geometry. Shion Fukuzawa, Michael T. Goodrich, Sandy Irani |
| 2026 | The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts. Niklas Haas, Sören Schmitt, Rob van Stee |
| 2026 | The Rectilinear Steiner Forest Arborescence. Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski |
| 2026 | Towards an Algebraic Approach to the Reconfiguration CSP. Kei Kimura |
| 2026 | Using Ray-Shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs. Therese Biedl, Prashant Gokhale |
| 2026 | Vertical-Horizontal Full Compatibility of One-Dimensional Subshifts. Arthur Mittelstaedt, Gaétan Richard |
| 2026 | Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder. Jannik Schestag |
| 2026 | k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs. Petr Hlinený, Jan Jedelský |