- Nick Bezhanishvili, Laura Bussi, Vincenzo Ciancia, David Gabelaia, Mamuka Jibladze, Diego Latella, Mieke Massink, Erik P. de Vink. Weak Simplicial Bisimilarity and Minimisation for Polyhedral Model Checking. Logical Methods in Computer Science, 22(1), 2026.
- Dan R. Ghica, George Kaye. Rewriting Modulo Traced Comonoid Structure. Logical Methods in Computer Science, 22(1), 2026.
- Achim Blumensath. Simple Classes of Automatic Structures. Logical Methods in Computer Science, 22(1), 2026.
- Lars Fritsche, Alexander Lauer, Maximilian Kratz, Andy Schürr, Gabriele Taentzer. Using weakest application conditions to rank graph transformations for graph repair. Logical Methods in Computer Science, 22(1), 2026.
- Luidnel Maignan, Antoine Spicher. Causal Graph Dynamics and Kan Extensions. Logical Methods in Computer Science, 22(1), 2026.
- Matthias Barkowsky, Holger Giese. Localized RETE for Incremental Graph Queries with Nested Graph Conditions. Logical Methods in Computer Science, 22(1), 2026.
- Jörg Endrullis, Roy Overbeek. Termination of Graph Transformation Systems via Generalized Weighted Type Graphs. Logical Methods in Computer Science, 22(1), 2026.
- Alberto Bombardelli, Stefano Tonetta. Asynchronous Composition of LTL Properties over Infinite and Finite Traces. Logical Methods in Computer Science, 22(1), 2026.
- Guilhem Gamard, Aliénor Goubault-Larrecq, Pierre Guillon 0001, Pierre Ohlmann, Kévin Perrot, Guillaume Theyssier. Hardness of monadic second-order formulae over succinct graphs. Logical Methods in Computer Science, 22(1), 2026.
- Flavien Breuvart, Marie Kerjean, Simon Mirwasser. Unifying Graded Linear Logic and Differential Operators. Logical Methods in Computer Science, 22(1), 2026.