default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReinhard Laue
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j23]Michael Braun, Michael Kiermaier, Reinhard Laue:
New 2-designs over finite fields from derived and residual designs. Adv. Math. Commun. 13(1): 165-170 (2019)- 2018
- [j22]Michael Kiermaier, Reinhard Laue, Alfred Wassermann:
A new series of large sets of subspace designs over the binary field. Des. Codes Cryptogr. 86(2): 251-268 (2018) - 2017
- [j21]Michael Braun, Michael Kiermaier, Axel Kohnert, Reinhard Laue:
Large sets of subspace designs. J. Comb. Theory A 147: 155-185 (2017) - 2016
- [j20]Adalbert Kerber, Michael Kiermaier, Reinhard Laue, Mario-Osvin Pavcevic
, Alfred Wassermann:
Editorial. Adv. Math. Commun. 10(3): i-ii (2016) - 2015
- [j19]Michael Kiermaier, Reinhard Laue:
Derived and residual subspace designs. Adv. Math. Commun. 9(1): 105-115 (2015) - 2013
- [b1]Adalbert Kerber, Reinhard Laue, Markus Meringer, Christoph Rücker, Emma Schymanski:
Mathematical Chemistry and Chemoinformatics - Structure Generation, Elucidation and Quantitative Structure-Property Relationships. de Gruyter 2013, ISBN 978-3-11-030007-9, pp. I-XXIX, 1-491 - 2011
- [j18]Masakazu Jimbo, Yuta Kunihara, Reinhard Laue, Masanori Sawa:
Unifying some known infinite families of combinatorial 3-designs. J. Comb. Theory A 118(3): 1072-1085 (2011) - 2010
- [j17]Reinhard Laue, Gholam Reza Omidi, Behruz Tayfeh-Rezaie:
Large sets of t-designs from t-homogeneous groups. Ars Comb. 97 (2010)
2000 – 2009
- 2009
- [j16]Reinhard Laue:
t-wise balanced designs. Discret. Appl. Math. 157(9): 2136-2142 (2009) - 2008
- [j15]Reinhard Laue, Alfred Wassermann:
Simple 8-(31, 12, 3080), 8-(40, 12, 16200) and 8-(40, 12, 16520) designs from PSL(3, 5) and PSL(4, 3). Discret. Math. 308(2-3): 166-174 (2008) - 2007
- [j14]Sascha Kurz, Reinhard Laue:
Bounds for the minimum diameter of integral point sets. Australas. J Comb. 39: 233-240 (2007) - [j13]Adalbert Kerber, Reinhard Laue, Markus Meringer, Christoph Rücker:
Molecules in Silico: A Graph Description of Chemical Reactions. J. Chem. Inf. Model. 47(3): 805-817 (2007) - 2006
- [j12]Reinhard Laue:
t-Wise Balanced Designs. Electron. Notes Discret. Math. 27: 67 (2006) - 2005
- [j11]Michael Braun, Adalbert Kerber, Reinhard Laue:
Systematic Construction of q-Analogs of t-(v, k, lambda)-Designs. Des. Codes Cryptogr. 34(1): 55-70 (2005) - 2004
- [j10]Reinhard Laue:
Resolvable t-Designs. Des. Codes Cryptogr. 32(1-3): 277-301 (2004) - [j9]Joachim Braun, Ralf Gugisch, Adalbert Kerber, Reinhard Laue, Markus Meringer, Christoph Rücker:
MOLGEN-CID - A Canonizer for Molecules and Graphs Accessible through the Internet. J. Chem. Inf. Model. 44(2): 542-548 (2004) - 2001
- [c7]Reinhard Laue, Thomas Grüner, Markus Meringer, Adalbert Kerber:
Constrained Generation of Molecular Graphs. Graphs and Discovery 2001: 319-331
1990 – 1999
- 1999
- [j8]Anton Betten, Reinhard Laue, Alfred Wassermann:
Simple 8-(40, 11, 1440) Designs. Discret. Appl. Math. 95(1-3): 109-114 (1999) - [j7]Anton Betten, Reinhard Laue, Alfred Wassermann:
A Steiner 5-Design on 36 Points. Des. Codes Cryptogr. 17(1-3): 181-186 (1999) - [j6]Anton Betten, Mikhail H. Klin, Reinhard Laue, Alfred Wassermann:
Graphical t-designs via polynomial Kramer-Mesner matrices. Discret. Math. 197-198: 83-109 (1999) - [j5]Anton Betten, Reinhard Laue, Alfred Wassermann:
New t-designs and large sets of t-designs. Discret. Math. 197-198: 111-121 (1999) - 1998
- [j4]Anton Betten, Adalbert Kerber, Reinhard Laue, Alfred Wassermann:
Simple 8-Designs with Small Parameters. Des. Codes Cryptogr. 15(1): 5-27 (1998) - [c6]Adalbert Kerber, Reinhard Laue, Thomas Wieland:
Discrete mathematics for combinatorial chemistry. Discrete Mathematical Chemistry 1998: 225-234 - 1996
- [j3]Roland Grund, Adalbert Kerber, Reinhard Laue:
Construction of Discrete Structures, Especially Isomers. Discret. Appl. Math. 67(1-3): 115-126 (1996) - [j2]Thomas Wieland, Adalbert Kerber, Reinhard Laue:
Principles of the Generation of Constitutional and Configurational Isomers. J. Chem. Inf. Comput. Sci. 36(3): 413-419 (1996) - 1995
- [c5]Christof Benecke, Roland Grund, Reinard Hohberger, Adalbert Kerber, Reinhard Laue, Thomas Wieland:
Chemical Isomerism, a Challenge for Algebraic Combinatorics and for Computer Science. AAECC 1995: 4-20 - [c4]Anton Betten, Adalbert Kerber, Axel Kohnert, Reinhard Laue, Alfred Wassermann:
The Discovery of Simple 7-Designs with Automorphism Group PTL (2, 32). AAECC 1995: 131-145 - [c3]Thomas Grüner, Reinhard Laue, Markus Meringer:
Algorithms for group actions applied to graph generation. Groups and Computation 1995: 113-122 - 1990
- [j1]Adalbert Kerber, Reinhard Laue, Ralf Hager, Wolfgang Weber:
Cataloging graphs by generating them uniformly at random. J. Graph Theory 14(5): 559-563 (1990)
1980 – 1989
- 1982
- [c2]Reinhard Laue:
Computing Double Coset Representatives for the Generation of Solvable Groups. EUROCAM 1982: 65-70 - [c1]Reinhard Laue:
Decomposing Data for Comparison in Systolic (VLSI) Arrays. WG 1982: 129-136
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
