From post

Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections.

, , , и . DGCI, том 10502 из Lecture Notes in Computer Science, стр. 147-158. Springer, (2017)

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.

 

Другие публикации лиц с тем же именем

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