Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Discrete mathematics for combinatorial chemistry.

A. Kerber, R. Laue, and T. Wieland. Discrete Mathematical Chemistry, volume 51 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 225-234. DIMACS/AMS, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Reinhard Reichel

Fly-By-Wire for CS23 Aircraft - Core Technology for General Aviation and RPASR. Küke, P. Müller, S. Polenz, R. Reichel, F. Pinchetti, J. Stephan, A. Joos, and W. Fichter. (October 2016)

Univ. -Prof. Dr. Reinhard Steiner University of Stuttgart

Hannes Lauer University of Stuttgart

Anja Lauer University of Stuttgart

Peter Lauer University of Stuttgart

Other publications of authors with the same name

t-wise balanced designs.R. Laue. Discrete Applied Mathematics, 157 (9): 2136-2142 (2009)Construction of Discrete Structures, Especially Isomers.R. Grund, A. Kerber, and R. Laue. Discrete Applied Mathematics, 67 (1-3): 115-126 (1996)Large sets of subspace designs.M. Braun, M. Kiermaier, A. Kohnert, and R. Laue. J. Comb. Theory, Ser. A, (2017)New 2-designs over finite fields from derived and residual designs.M. Braun, M. Kiermaier, and R. Laue. Adv. in Math. of Comm., 13 (1): 165-170 (2019)Systematic Construction of q-Analogs of t-(v, k, lambda)-Designs.M. Braun, A. Kerber, and R. Laue. Des. Codes Cryptogr., 34 (1): 55-70 (2005)The Discovery of Simple 7-Designs with Automorphism Group PTL (2, 32).A. Betten, A. Kerber, A. Kohnert, R. Laue, and A. Wassermann. AAECC, volume 948 of Lecture Notes in Computer Science, page 131-145. Springer, (1995)Constrained Generation of Molecular Graphs.R. Laue, T. Grüner, M. Meringer, and A. Kerber. Graphs and Discovery, volume 69 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 319-331. DIMACS/AMS, (2001)Cataloging graphs by generating them uniformly at random.A. Kerber, R. Laue, R. Hager, and W. Weber. Journal of Graph Theory, 14 (5): 559-563 (1990)Simple 8-(40, 11, 1440) Designs.A. Betten, R. Laue, and A. Wassermann. Discrete Applied Mathematics, 95 (1-3): 109-114 (1999)Resolvable t-Designs.R. Laue. Des. Codes Cryptogr., 32 (1-3): 277-301 (2004)