Journal: Fundamenta Informaticae

Volume 125, Issue 3-4

0 -- 0Paolo Dulio, Andrea Frosini, Grzegorz Rozenberg. Preface
223 -- 237Hilde Segers, Willem Jan Palenstijn, Kees Joost Batenburg, Jan Sijbers. Discrete Tomography in MRI: a Simulation Study
239 -- 259Kees Joost Batenburg, Wagner Fortes, Robert Tijdeman. Approximate Discrete Reconstruction Algorithm
261 -- 272Rodolfo A. Fiorini, Giuseppe Laguteta. Discrete Tomography Data Footprint Reduction by Information Conservation
273 -- 284Rodolfo A. Fiorini, Andrea Condorelli, Giuseppe Laguteta. Discrete Tomography Data Footprint Reduction via Natural Compression
285 -- 312Stefania Petra, Christoph Schnörr, Andreas Schröder. Critical Parameter Values and Reconstruction Properties of Discrete Tomography: Application to Experimental Fluid Dynamics
313 -- 328Elena Barcucci, Stefano Brocchi. Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge
329 -- 342Stefano Bilotta, Simone Rinaldi, Samanta Socci. Polygons Drawn from Permutations
343 -- 359Norbert Hantos, Péter Balázs. The Reconstruction of Polyominoes from Horizontal and Vertical Projections and Morphological Skeleton is NP-complete
361 -- 376Roberto Fedele, Antonia Ciani, Luca Galantucci, Matteo Bettuzzi, Luca Andena. A Regularized, Pyramidal Multi-grid Approach to Global 3D-Volume Digital Image Correlation Based on X-ray Micro-tomography

Volume 125, Issue 2

101 -- 133Vincent Aravantinos, Mnacho Echenim, Nicolas Peltier. A Resolution Calculus for First-order Schemata
135 -- 152Jianwu Dong, Feng Chen, Yanyan Huo, Hong Liu. Decomposition and Approximation of Loopy Bayesian Networks
153 -- 160Rija Erves, Janez Zerovnik. Wide-diameter of Product Graphs
161 -- 181Maciej Grzeskowiak. Algorithms for Relatively Cyclotomic Primes
183 -- 222Piotr Kosiuczenko. On the Validation of Invariants at Runtime

Volume 125, Issue 1

1 -- 20Chiheb Ameur Abid, Belhassen Zouari. Local Verification Using a Distributed State Space
21 -- 49Mariusz Felisiak. Computer Algebra Technique for Coxeter Spectral Study of Edge-bipartite Graphs and Matrix Morsifications of Dynkin Type $\mathbb{A}_n$
51 -- 70Norihiro Kamide, Ken Kaneiwa. Reasoning about Resources and Information: A Linear Logic Approach
71 -- 94Armand Stefan Rotaru, Sorin Iftene. A Complete Generalization of Atkin's Square Root Algorithm
95 -- 99Apoloniusz Tyszka. Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set?