- Jan Mielniczuk, Adam Wawrzenczyk. Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios. Fundamenta Informaticae, 193(1-4):29-45, 2025.
- Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni. All Graphs with at Most 8 Nodes are 2-interval-PCGs. Fundamenta Informaticae, 193(1-4):1-9, 2025.
- Xiaorui Li, Baolei Cheng, Jianxi Fan, Yan Wang 0078, Dajin Wang. On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes. Fundamenta Informaticae, 193(1-4):11-28, 2025.
- Ali Gholami Rudi. Maximum Centre-Disjoint Mergeable Disks. Fundamenta Informaticae, 193(1-4):47-67, 2025.
- Nick Würdemann, Thomas Chatain, Stefan Haar, Lukas Panneke. Taking Complete Finite Prefixes To High Level, Symbolically. Fundamenta Informaticae, 192(3-4):313-361, 2024.
- Robert Lorenz, Slawomir Lasota 0001. Preface. Fundamenta Informaticae, 192(3-4), 2024.
- Vesa Halava, Jarkko Kari, Tero Laihonen. Preface. Fundamenta Informaticae, 191(3-4), 2024.
- Pyry Herva, Tero Laihonen, Tuomo Lehtilä. Optimal Local Identifying and Local Locating-dominating Codes. Fundamenta Informaticae, 191(3-4):351-378, 2024.
- Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny. Elimination Distance to Bounded Degree on Planar Graphs Preprint. Fundamenta Informaticae, 191(2):129-140, 2024.
- Walter Guttmann. Relation-Algebraic Verification of Disjoint-Set Forests. Fundamenta Informaticae, 192(1):77-120, 2024.