Half-transitivity of some metacirculants. - Mateja Sajna (Discret. Math., 1998)

On the problem of a matching orthogonal to a 2-factorization. - Mateja Sajna (Discret. Math., 2000)

On decomposing Kn-I into cycles of a fixed odd length. - Mateja Sajna (Discret. Math., 2002)

Cycle decompositions IV: complete directed graphs and fixed length directed cycles. - Brian Alspach; Heather Gavlas; Mateja Sajna; Helen Verrall (J. Comb. Theory A, 2003)

Almost self-complementary circulant graphs. - Edward Dobson; Mateja Sajna (Discret. Math., 2004)

Brian Alspach and his work. - Joy Morris; Mateja Sajna (Discret. Math., 2005)

Homogeneously almost self-complementary graphs. - Mateja Sajna; Primoz Potocnik (Electron. Notes Discret. Math., 2005)

On almost self-complementary graphs. - Primoz Potocnik; Mateja Sajna (Discret. Math., 2006)

Mobility of vertex-transitive graphs. - Primoz Potocnik; Mateja Sajna; Gabriel Verret (Discret. Math., 2007)

Self-complementary two-graphs and almost self-complementary double covers. - Primoz Potocnik; Mateja Sajna (Eur. J. Comb., 2007)

A note on transitive permutation groups of degree twice a prime. - Primoz Potocnik; Mateja Sajna (Ars Math. Contemp., 2008)

More on almost self-complementary graphs. - Nevena Francetic; Mateja Sajna (Discret. Math., 2009)

The existence of regular self-complementary 3-uniform hypergraphs. - Primoz Potocnik; Mateja Sajna (Discret. Math., 2009)

Vertex-transitive self-complementary uniform hypergraphs. - Primoz Potocnik; Mateja Sajna (Eur. J. Comb., 2009)

Brick assignments and homogeneously almost self-complementary graphs. - Primoz Potocnik; Mateja Sajna (J. Comb. Theory B, 2009)

Computing transitive closure of bipolar weighted digraphs. - Patrick Niesink; Keven Poulin; Mateja Sajna (Discret. Appl. Math., 2013)

On the Directed Oberwolfach Problem with Equal Cycle Lengths. - Andrea C. Burgess; Mateja Sajna (Electron. J. Comb., 2014)

On Sheehan's Conjecture for Graphs with Symmetry. - Mateja Sajna; Andrew Wagner (J. Graph Theory, 2015)

Quasi-Eulerian Hypergraphs. - M. Amin Bahmanian; Mateja Sajna (Electron. J. Comb., 2017)

Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts. - Yan Steimle; Mateja Sajna (Discret. Math., 2018)

Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach. - M. Amin Bahmanian; Mateja Sajna (CoRR, 2019)

Covering hypergraphs are Eulerian. - Mateja Sajna; Andrew Wagner (J. Graph Theory, 2022)

Using edge cuts to find Euler tours and Euler families in hypergraphs. - Mateja Sajna; Andrew Wagner (Discret. Math., 2023)

ℓ-covering k-hypergraphs are quasi-eulerian. - Mateja Sajna; Andrew Wagner (Discuss. Math. Graph Theory, 2023)

Abstract questionnaires and FS-decision digraphs. - Jiaye Chen; Suzan Kadri; Mateja Sajna; Ioana Schiopu-Kratina (CoRR, 2025)