Computing Double Coset Representatives for the Generation of Solvable Groups. - Reinhard Laue (EUROCAM, 1982)

Decomposing Data for Comparison in Systolic (VLSI) Arrays. - Reinhard Laue (WG, 1982)

Cataloging graphs by generating them uniformly at random. - Adalbert Kerber; Reinhard Laue; Ralf Hager; Wolfgang Weber (J. Graph Theory, 1990)

Chemical Isomerism, a Challenge for Algebraic Combinatorics and for Computer Science. - Christof Benecke; Roland Grund; Reinard Hohberger; Adalbert Kerber; Reinhard Laue; Thomas Wieland (AAECC, 1995)

The Discovery of Simple 7-Designs with Automorphism Group PTL (2, 32). - Anton Betten; Adalbert Kerber; Axel Kohnert; Reinhard Laue; Alfred Wassermann (AAECC, 1995)

Algorithms for group actions applied to graph generation. - Thomas Grüner; Reinhard Laue; Markus Meringer (Groups and Computation, 1995)

Construction of Discrete Structures, Especially Isomers. - Roland Grund; Adalbert Kerber; Reinhard Laue (Discret. Appl. Math., 1996)

Principles of the Generation of Constitutional and Configurational Isomers. - Thomas Wieland; Adalbert Kerber; Reinhard Laue (J. Chem. Inf. Comput. Sci., 1996)

Discrete mathematics for combinatorial chemistry. - Adalbert Kerber; Reinhard Laue; Thomas Wieland (Discrete Mathematical Chemistry, 1998)

Simple 8-Designs with Small Parameters. - Anton Betten; Adalbert Kerber; Reinhard Laue; Alfred Wassermann (Des. Codes Cryptogr., 1998)

Simple 8-(40, 11, 1440) Designs. - Anton Betten; Reinhard Laue; Alfred Wassermann (Discret. Appl. Math., 1999)

A Steiner 5-Design on 36 Points. - Anton Betten; Reinhard Laue; Alfred Wassermann (Des. Codes Cryptogr., 1999)

Graphical t-designs via polynomial Kramer-Mesner matrices. - Anton Betten; Mikhail H. Klin; Reinhard Laue; Alfred Wassermann (Discret. Math., 1999)

New t-designs and large sets of t-designs. - Anton Betten; Reinhard Laue; Alfred Wassermann (Discret. Math., 1999)

Constrained Generation of Molecular Graphs. - Reinhard Laue; Thomas Grüner; Markus Meringer; Adalbert Kerber (Graphs and Discovery, 2001)

Resolvable t-Designs. - Reinhard Laue (Des. Codes Cryptogr., 2004)

MOLGEN-CID - A Canonizer for Molecules and Graphs Accessible through the Internet. - Joachim Braun; Ralf Gugisch; Adalbert Kerber; Reinhard Laue; Markus Meringer; Christoph Rücker (J. Chem. Inf. Model., 2004)

Systematic Construction of q-Analogs of t-(v, k, lambda)-Designs. - Michael Braun; Adalbert Kerber; Reinhard Laue (Des. Codes Cryptogr., 2005)

Bounds for the minimum diameter of integral point sets. - Sascha Kurz; Reinhard Laue (Australas. J Comb., 2007)

Molecules in Silico: A Graph Description of Chemical Reactions. - Adalbert Kerber; Reinhard Laue; Markus Meringer; Christoph Rücker (J. Chem. Inf. Model., 2007)

Simple 8-(31, 12, 3080), 8-(40, 12, 16200) and 8-(40, 12, 16520) designs from PSL(3, 5) and PSL(4, 3). - Reinhard Laue; Alfred Wassermann (Discret. Math., 2008)

t-wise balanced designs. - Reinhard Laue (Discret. Appl. Math., 2009)

Large sets of t-designs from t-homogeneous groups. - Reinhard Laue; Gholam Reza Omidi; Behruz Tayfeh-Rezaie (Ars Comb., 2010)

Unifying some known infinite families of combinatorial 3-designs. - Masakazu Jimbo; Yuta Kunihara; Reinhard Laue; Masanori Sawa (J. Comb. Theory A, 2011)

Mathematical Chemistry and Chemoinformatics - Structure Generation, Elucidation and Quantitative Structure-Property Relationships. - Adalbert Kerber; Reinhard Laue; Markus Meringer; Christoph Rücker; Emma Schymanski (de Gruyter, 2013)

Derived and residual subspace designs. - Michael Kiermaier; Reinhard Laue (Adv. Math. Commun., 2015)

Editorial. - Adalbert Kerber; Michael Kiermaier; Reinhard Laue; Mario-Osvin Pavcevic; Alfred Wassermann (Adv. Math. Commun., 2016)

Large sets of subspace designs. - Michael Braun; Michael Kiermaier; Axel Kohnert; Reinhard Laue (J. Comb. Theory A, 2017)

A new series of large sets of subspace designs over the binary field. - Michael Kiermaier; Reinhard Laue; Alfred Wassermann (Des. Codes Cryptogr., 2018)

New 2-designs over finite fields from derived and residual designs. - Michael Braun; Michael Kiermaier; Reinhard Laue (Adv. Math. Commun., 2019)