Packing of nonuniform hypergrahs- product and sum of sizes conditions. - Pawel Naroski (Discuss. Math. Graph Theory, 2009)

On Tours that Contain All Edges of a Hypergraph. - Zbigniew Lonc; Pawel Naroski (Electron. J. Comb., 2010)

A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph. - Zbigniew Lonc; Pawel Naroski (Discret. Math. Theor. Comput. Sci., 2012)

Tight Euler tours in uniform hypergraphs - computational aspects. - Zbigniew Lonc; Pawel Naroski; Pawel Rzazewski (Discret. Math. Theor. Comput. Sci., 2017)