Ph.D. thesis (1999):
Algebraic and algorithmic properties of brick codes (at Jagiellonian University).
theory of codes, brick codes, polyominoes
Brick codes, in: C.L.Nehaniv, M.Ito, Algebraic Engineering, World Scientific, (1999), 230-237.
Brick codes: families, properties, relations, International Journal of Computer Mathematics, 74 (2000), 133-150.
Decidability of simple brick codes, in: M.Drmota, P.Flajolet et al., Algorithms, Trees, Combinatorics and Probabilities, Trends in Mathematics, Birkhauser, (2004), 541-542 (with M. Moczurad).
Some open problems in decidability of brick (labelled polyomino) codes, Lecture Notes in Computer Science 3106 (2004), 72-81 (with M. Moczurad).
Asymptotic density of brick and word codes, Ars Combinatoria, accepted (with M. Moczurad).