Reinhard Laue - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2019

New 2-designs over finite fields from derived and residual designsMichael Braun, Michael Kiermaier, Reinhard Laue. amco, 13(1):165-170, 2019. [doi]

2018

A new series of large sets of subspace designs over the binary fieldMichael Kiermaier, Reinhard Laue, Alfred Wassermann. dcc, 86(2):251-268, 2018. [doi]

2017

Large sets of subspace designsMichael Braun, Michael Kiermaier, Axel Kohnert, Reinhard Laue. JCT, 147:155-185, 2017. [doi]

2016

EditorialAdalbert Kerber, Michael Kiermaier, Reinhard Laue, Mario-Osvin Pavcevic, Alfred Wassermann. amco, 10(3), 2016. [doi]

2015

Derived and residual subspace designsMichael Kiermaier, Reinhard Laue. amco, 9(1):105-115, 2015. [doi]

2013

Mathematical Chemistry and Chemoinformatics - Structure Generation, Elucidation and Quantitative Structure-Property RelationshipsAdalbert Kerber, Reinhard Laue, Markus Meringer, Christoph Rücker, Emma Schymanski. de Gruyter, 2013. [doi]

2011

Unifying some known infinite families of combinatorial 3-designsMasakazu Jimbo, Yuta Kunihara, Reinhard Laue, Masanori Sawa. JCT, 118(3):1072-1085, 2011. [doi]

2010

Large sets of t-designs from t-homogeneous groupsReinhard Laue, Gholam Reza Omidi, Behruz Tayfeh-Rezaie. arscom, 97, 2010.

2009

t-wise balanced designsReinhard Laue. DAM, 157(9):2136-2142, 2009. [doi]

2008

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. DM, 308(2-3):166-174, 2008. [doi]

2007

Molecules in Silico: A Graph Description of Chemical ReactionsAdalbert Kerber, Reinhard Laue, Markus Meringer, Christoph Rücker. jcisd, 47(3):805-817, 2007. [doi]

Bounds for the minimum diameter of integral point setsSascha Kurz, Reinhard Laue. ajc, 39:233-240, 2007. [doi]

2006

t-Wise Balanced DesignsReinhard Laue. endm, 27:67, 2006. [doi]

2005

Systematic Construction of ::::q::::-Analogs of ::::t::::-(::::v::::, ::::k::::, lambda)-DesignsMichael Braun, Adalbert Kerber, Reinhard Laue. dcc, 34(1):55-70, 2005. [doi]

2004

MOLGEN-CID - A Canonizer for Molecules and Graphs Accessible through the InternetJoachim Braun, Ralf Gugisch, Adalbert Kerber, Reinhard Laue, Markus Meringer, Christoph Rücker. jcisd, 44(2):542-548, 2004. [doi]

Resolvable ::::t::::-DesignsReinhard Laue. dcc, 32(1-3):277-301, 2004. [doi]

2001

Constrained Generation of Molecular GraphsReinhard Laue, Thomas Grüner, Markus Meringer, Adalbert Kerber. dimacs 2005: 319-332

1999

New t-designs and large sets of t-designsAnton Betten, Reinhard Laue, Alfred Wassermann. DM, 197-198:111-121, 1999. [doi]

Graphical t-designs via polynomial Kramer-Mesner matricesAnton Betten, Mikhail H. Klin, Reinhard Laue, Alfred Wassermann. DM, 197-198:83-109, 1999. [doi]

Simple 8-(40, 11, 1440) DesignsAnton Betten, Reinhard Laue, Alfred Wassermann. DAM, 95(1-3):109-114, 1999. [doi]

1998

Simple 8-Designs with Small ParametersAnton Betten, Adalbert Kerber, Reinhard Laue, Alfred Wassermann. dcc, 15(1):5-27, 1998.

Discrete mathematics for combinatorial chemistryAdalbert Kerber, Reinhard Laue, Thomas Wieland. dimacs 2000: 225-234

1996

Construction of Discrete Structures, Especially IsomersRoland Grund, Adalbert Kerber, Reinhard Laue. DAM, 67(1-3):115-126, 1996. [doi]

Principles of the Generation of Constitutional and Configurational IsomersThomas Wieland, Adalbert Kerber, Reinhard Laue. jcisd, 36(3):413-419, 1996. [doi]

1995

1990

Cataloging graphs by generating them uniformly at randomAdalbert Kerber, Reinhard Laue, Ralf Hager, Wolfgang Weber. jgt, 14(5):559-563, 1990. [doi]

1982

Computing Double Coset Representatives for the Generation of Solvable GroupsReinhard Laue. eurocal 1982: 65-70

Decomposing Data for Comparison in Systolic (VLSI) ArraysReinhard Laue. wg 1983: 129-136

Sign in or sign up to see more results.

runs on WebDSL