On the number of indecomposable block designs. - Martin Grüttmüller (Australas. J Comb., 1996)

On the PBD-closure of Sets Containing 3. - Martin Grüttmüller (Discret. Appl. Math., 1999)

On Orthogonal Double Covers of Graphs. - Hans-Dietrich O. F. Gronau; Martin Grüttmüller; Sven Hartmann; Uwe Leck; Volker Leck (Des. Codes Cryptogr., 2002)

Completing partial latin squares with two cyclically generated prescribed diagonals. - Martin Grüttmüller (J. Comb. Theory A, 2003)

Orthogonal double covers of Kn, n by small graphs. - Ramadan A. El-Shanawany; Hans-Dietrich O. F. Gronau; Martin Grüttmüller (Discret. Appl. Math., 2004)

Completing partial latin squares with prescribed diagonals. - Martin Grüttmüller (Discret. Appl. Math., 2004)

The minimum number of blocks in pairwise balanced designs with maximum block size 4: the final cases. - Martin Grüttmüller; Ian T. Roberts; Sue D'Arcy; Judith Egan (Australas. J Comb., 2006)

Enumeration of Super-simple Cyclic Block Designs of Small Order. - Martin Grüttmüller (Electron. Notes Discret. Math., 2006)

Pan-orientable block designs. - Martin Grüttmüller; Sven Hartmann (Australas. J Comb., 2008)

Mandatory representation designs I with k=2mod3. - Gennian Ge; Martin Grüttmüller; Sven Hartmann; Rolf S. Rees (Discret. Math., 2008)

Maximal Flat Antichains of Minimum Weight. - Martin Grüttmüller; Sven Hartmann; Thomas Kalinowski; Uwe Leck; Ian T. Roberts (Electron. J. Comb., 2009)

On the number of minimal completely separating systems and antichains in a Boolean lattice. - Ian T. Roberts; Leanne J. Rylands; Terry Montag; Martin Grüttmüller (Australas. J Comb., 2010)

Antichains and completely separating systems - A catalogue and applications. - Martin Grüttmüller; Ian T. Roberts; Leanne J. Rylands (Discret. Appl. Math., 2014)

Recommending Mathematical Tasks Based on Reinforcement Learning and Item Response Theory. - Matteo Orsoni; Alexander Pögelt; Nghia Duong-Trung; Mariagrazia Benassi; Milos Kravcik; Martin Grüttmüller (ITS, 2023)

Individualised Mathematical Task Recommendations Through Intended Learning Outcomes and Reinforcement Learning. - Alexander Pögelt; Katja Ihsberner; Norbert Pengel; Milos Kravcik; Martin Grüttmüller; Wolfram Hardt (ITS (1), 2024)