| 2026 | A Complexity Analysis of the c-Closed Vertex Deletion Problem. Lisa Lehner, Christian Komusiewicz, Luca Pascal Staus |
| 2026 | Approximating the Average-Case Graph Search Problem with Non-uniform Costs. Michal Szyfelbein |
| 2026 | Can One Flip Spoil it All? Pragya Arora, Palash Dey, Neeldhara Misra |
| 2026 | Cartesian Forest Matching. Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq |
| 2026 | Complexity and Algorithms for Arc-Kayles and Non-disconnecting Arc-Kayles. Kyle Burke, Antoine Dailly, Nacim Oijid |
| 2026 | Complexity of Perfect (1, 2)-Dominating Sets in Low-Degree Graphs. Urszula Bednarz, Jan Kratochvíl, Adrian Michalski |
| 2026 | Computing Beyond-Planar Crossing Numbers via Forbidden Crossing Patterns. Markus Chimani, Mirko H. Wagner |
| 2026 | Computing Power Indices in Weighted Majority Games with Formal Power Series. Naonori Kakimura, Yoshihiko Terai |
| 2026 | Disjoint Tours and the Price of Diversity. Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma |
| 2026 | Engineering Algorithms for ℓ-Isolated Maximal Clique Enumeration. Marco D'Elia, Irene Finocchi, Maurizio Patrignani |
| 2026 | Enumerating All Graph Colorings Using Zero-Suppressed Binary Decision Diagrams. Ryohei Okuda, Jun Kawahara, Shin-ichi Minato |
| 2026 | Enumeration of Bases in Matroid with Exponentially Large Ground Set. Yuki Nishimura, Kazuya Haraguchi |
| 2026 | Finding Order-Preserving Subgraphs. Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden |
| 2026 | Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited. Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk |
| 2026 | Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path. Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato |
| 2026 | Fundamentals of Computing Continuous Dynamic Time Warping in 2D Under Different Norms. Kevin Buchin, Maike Buchin, Jan Erik Swiadek, Sampson Wong |
| 2026 | Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion. Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff |
| 2026 | Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and Locally. Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedlicková |
| 2026 | Graph Irregularity via Edge Deletions. Julien Bensmail, Noémie Catherinot, Foivos Fioravantes, Clara Marcille, Nacim Oijid |
| 2026 | Hardness and Approximation Results for Extending Unique Neighborhood Networks. Siam Habib, Debajyoti Mondal, Sadia Sharmin, Md. Saidur Rahman |
| 2026 | Hardness and Parameterized Tractability of the Weak Graph Distance. Maike Buchin, Wolf Kißler, Fabian Kubon |
| 2026 | How to Reconfigure Your Alliances. Henning Fernau, Kevin Mann |
| 2026 | Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs. Marco D'Elia, Fabrizio Frati |
| 2026 | Linear Time Small Coresets for k-Mean Clustering of Segments with Applications. David Denisov, Shlomi Dolev, Dan Feldman, Michael Segal |
| 2026 | Minimizing Vertical Length in Linked Bar Charts. Steven van den Broek, Marc J. van Kreveld, Wouter Meulemans, Arjen Simons |
| 2026 | Minimum-Weight Outerplane Laman Graphs. Oswin Aichholzer, Yuya Higashikawa, Joachim Orthaber, Daniel Perz, Birgit Vogtenhuber, Alexandra Weinberger |
| 2026 | On Compaction and Realizability of Almost Convex Octilinear Representations. Henry Förster, Giacomo Ortali, Lena Schlipf |
| 2026 | On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs. Kazuhiro Kurita, Kevin Mann |
| 2026 | On the Computational Complexity of Covering Multi-Interface Networks. Cristina Bazgan, Morgan Chopin, André Nichterlein, Camille Richer |
| 2026 | On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum. Afrouz Jabal Ameli, Faezeh Motiei, Morteza Saghafian |
| 2026 | Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths. Rin Saito, Takehiro Ito |
| 2026 | Shortcutting the Diameter of a Polygon. Taekang Eom, Taehoon Ahn, Minju Song, Hee-Kap Ahn |
| 2026 | Space Efficient Algorithms for Parameterised Problems. Sheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip |
| 2026 | Streaming Algorithms for Products of Probabilities. Markus Lohrey, Leon Rische, Louisa Seelbach Benkner, Julio Xochitemol |
| 2026 | Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets. Malory Marin |
| 2026 | The Gate-Cover Problem. Esther M. Arkin, Alon Efrat, Omrit Filtser, Stephen G. Kobourov, Jan Kratochvíl, Joseph S. B. Mitchell, Ariel Rosenberg |
| 2026 | Tile Reconfiguration by a Finite Automaton. Jonas Friemel, David Liedtke, Christian Scheffer |
| 2026 | Trajectory Visibility at First Sight. Mohammad Ali Abam, Mohammad Ghodsi, Seyed Mohammad Hussein Kazemi |
| 2026 | WALCOM: Algorithms and Computation - 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4-6, 2026, Proceedings Emilio Di Giacomo, Debajyoti Mondal |