The Ninth World Microcomputer Chess Championship. - Richard Lang (J. Int. Comput. Games Assoc., 1989)

Local colourings and monochromatic partitions in complete bipartite graphs. - Richard Lang; Maya Stein (Electron. Notes Discret. Math., 2015)

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. - Richard Lang; Oliver Schaudt; Maya Stein (Electron. Notes Discret. Math., 2015)

Chromatic index, treewidth and maximum degree. - Henning Bruhn; Laura Gellert; Richard Lang (Electron. Notes Discret. Math., 2016)

A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3. - Richard Lang (Graphs Comb., 2016)

List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. - Henning Bruhn; Richard Lang; Maya Stein (J. Graph Theory, 2016)

Estimating the distance to a hereditary graph property. - Carlos Hoppen; Yoshiharu Kohayakawa; Richard Lang; Hanno Lefmann; Henrique Stagni (Electron. Notes Discret. Math., 2017)

Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles. - Richard Lang; Oliver Schaudt; Maya Stein (SIAM J. Discret. Math., 2017)

Estimating parameters associated with monotone properties. - Carlos Hoppen; Yoshiharu Kohayakawa; Richard Lang; Hanno Lefmann; Henrique Stagni (Comb. Probab. Comput., 2020)

Monochromatic cycle partitions in random graphs. - Richard Lang; Allan Lo (Comb. Probab. Comput., 2021)

Minimum degree conditions for monochromatic cycle partitioning. - Dániel Korándi; Richard Lang; Shoham Letzter; Alexey Pokrovskiy (J. Comb. Theory B, 2021)

On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. - Carlos Hoppen; Yoshiharu Kohayakawa; Richard Lang; Hanno Lefmann; Henrique Stagni (SIAM J. Discret. Math., 2021)

Resilience for loose Hamilton cycles. - José D. Alvarado; Yoshiharu Kohayakawa; Richard Lang; Guilherme Oliveira Mota; Henrique Stagni (LAGOS, 2023)

An Improved Bound for the Linear Arboricity Conjecture. - Richard Lang; Luke Postle (Comb., 2023)

Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. - Peter Allen 001; Julia Böttcher; Richard Lang; Jozef Skokan; Maya Stein (Eur. J. Comb., 2024)

Edge-colouring graphs with local list sizes. - Marthe Bonamy; Michelle Delcourt; Richard Lang; Luke Postle (J. Comb. Theory B, 2024)

Sufficient conditions for perfect mixed tilings. - Eoin Hurley; Felix Joos; Richard Lang (J. Comb. Theory B, 2025)