Some strategies for higher dimensional animal achievement games. - Immanuel Halupczok; Jan-Christoph Schlage-Puchta (Discret. Math., 2008)

Lower Bounds for q-ary Codes with Large Covering Radius. - Wolfgang Haas; Immanuel Halupczok; Jan-Christoph Schlage-Puchta (Electron. J. Comb., 2009)

Lower bounds on covering codes via partition matrices. - Wolfgang Haas; Jan-Christoph Schlage-Puchta; Jörn Quistorff (J. Comb. Theory A, 2009)

Covering and radius-covering arrays: Constructions and classification. - Charles J. Colbourn; Gerzson Kéri; P. P. Rivas Soriano; Jan-Christoph Schlage-Puchta (Discret. Appl. Math., 2010)

Completely Multiplicative Automatic Functions. - Jan-Christoph Schlage-Puchta (Integers, 2011)

Zero-sum free sets with small sum-set. - Gautami Bhowmik; Immanuel Halupczok; Jan-Christoph Schlage-Puchta (Math. Comput., 2011)

Streamlined subrecursive degree theory. - Lars Kristiansen; Jan-Christoph Schlage-Puchta; Andreas Weiermann (Ann. Pure Appl. Log., 2012)

Applications of character estimates to statistical problems for the symmetric group. - Jan-Christoph Schlage-Puchta (Comb., 2012)

Ramsey Numbers R(K3, G) for Graphs of Order 10. - Gunnar Brinkmann; Jan Goedgebeur; Jan-Christoph Schlage-Puchta (Electron. J. Comb., 2012)

Ramsey numbers R(K3,G) for graphs of order 10 - Gunnar Brinkmann; Jan Goedgebeur; Jan-Christoph Schlage-Puchta (CoRR, 2012)

Optimal integer partitions. - Konrad Engel; Tadeusz Radzik; Jan-Christoph Schlage-Puchta (Eur. J. Comb., 2014)

Complete graphs with no rainbow tree. - Jan-Christoph Schlage-Puchta; Peter Wagner 002 (J. Graph Theory, 2020)