Author of the publication

An algorithm for the reconstruction of discrete sets from two projections in presence of absorption.

, , and . Discret. Appl. Math., 151 (1-3): 21-35 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reconstruction of discrete sets from two absorbed projections: an algorithm., , and . Electron. Notes Discret. Math., (2003)Exhaustive generation of combinatorial objects by ECO., , , and . Acta Inf., 40 (8): 585-602 (2004)A Construction for Enumerating k-coloured Motzkin Paths., , , and . COCOON, volume 959 of Lecture Notes in Computer Science, page 254-263. Springer, (1995)PCIF: An Algorithm for Lossless True Color Image Compression., , and . IWCIA, volume 5852 of Lecture Notes in Computer Science, page 224-237. Springer, (2009)Strings from linear recurrences and permutations: A Gray code., , and . Theor. Comput. Sci., (2022)Random Generation of Trees and Other Combinatorial Objects., , and . Theor. Comput. Sci., 218 (2): 219-232 (1999)Steep polyominoes, q-Motzkin numbers and q-Bessel functions., , , and . Discret. Math., 189 (1-3): 21-42 (1998)A Strong Non-overlapping Dyck Code., , and . DLT, volume 12811 of Lecture Notes in Computer Science, page 43-53. Springer, (2021)Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths., , and . RAIRO Theor. Informatics Appl., (2024)Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections., , , and . DGCI, volume 10502 of Lecture Notes in Computer Science, page 147-158. Springer, (2017)