UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Algorithms in Combinatorial Design Theory

1, 1985

Volltextzugriff (PDF)

Concerning the complexity of deciding isomorphism of block designs

Discrete Applied Mathematics, 1981-01, Vol.3 (3), p.155-162

1981

Volltextzugriff (PDF)

Recursive constructions for cyclic block designs

Journal of statistical planning and inference, 1984-01, Vol.10 (1), p.97-103

1984

Volltextzugriff (PDF)

Graph isomorphism and self-complementary graphs

SIGACT news, 1978-04, Vol.10 (1), p.25-29

1978

Volltextzugriff (PDF)

Algorithmic aspects of combinatorial designs: a survey

North-Holland mathematics studies, 1985, Vol.114 (26), p.67-136

COLBOURN, M. J

1985

Volltextzugriff (PDF)

The computational complexity of recognizing critical sets

Graph Theory Singapore 1983, 2006, p.248-253

2006

Volltextzugriff (PDF)

On the Existence of Strong Kirkman Cubes of Order 39 and Block Size 3

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.309-319

1985

Volltextzugriff (PDF)

Computation of Some Parameters of Lie Geometries

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.1-48

1985

Volltextzugriff (PDF)

The Computational Complexity of Finding Subdesigns in Combinatorial Designs

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.59-65

1985

Volltextzugriff (PDF)

Four Orthogonal One-Factorizations on Ten Points

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.143-149

1985

Volltextzugriff (PDF)

Algorithmic Aspects of Combinatorial Designs: A Survey

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.67-136

1985

Volltextzugriff (PDF)

Constructive Enumeration of Incidence Systems

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.227-246

1985

Volltextzugriff (PDF)

Tables of Parameters of BIBDs with r⩽41 including Existence, Enumeration, and Resolvability Results

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.275-307

1985

Volltextzugriff (PDF)

Construction Procedures for t-designs and the Existence of New Simple 6–designs

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.247-273

1985

Volltextzugriff (PDF)

Greedy Colourings of Steiner Triple Systems

North-Holland Mathematics Studies, 1983, Vol.78, p.201-207

1983

Volltextzugriff (PDF)

Directing Cyclic Triple Systems

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.221-225

1985

Volltextzugriff (PDF)

Algorithms to Find Directed Packings

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.137-141

1985

Volltextzugriff (PDF)

A Survey of Results on the Number of t-(v,k,λ) Designs

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.209-219

1985

Volltextzugriff (PDF)

A Problem of Lines and Intersections With an Application to Switching Networks

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.151-163

1985

Volltextzugriff (PDF)

Derived Steiner Triple Systems of Order 15

Algorithms in Combinatorial Design Theory, 1985, Vol.114, p.183-208

1985

Volltextzugriff (PDF)

The computational complexity of finding subdesigns in combinatorial designs

North-Holland mathematics studies, 1985, Vol.114 (26), p.59-65

1985

Volltextzugriff (PDF)

Every twofold triple system can be directed

Journal of combinatorial theory. Series A, 1983-01, Vol.34 (3), p.375-378

1983

Volltextzugriff (PDF)

Some new upper bounds for constant weight codes (Corresp.)

IEEE transactions on information theory, 1980-07, Vol.26 (4), p.478-478

Colbourn, M.

1980

Volltextzugriff (PDF)

A census of orthogonal Steiner triple systems of order

Algorithms in Combinatorial Design Theory, 1985, Vol.26

1985

Volltextzugriff (PDF)

Performance of subset generating aorithms

Algorithms in Combinatorial Design Theory, 1985, Vol.26

1985

Volltextzugriff (PDF)

1 – 25 von 146

Menü

Weitere Dienste

Einstellungen

Algorithms in Combinatorial Design Theory

Concerning the complexity of deciding isomorphism of block designs

Recursive constructions for cyclic block designs

Graph isomorphism and self-complementary graphs

Algorithmic aspects of combinatorial designs: a survey

The computational complexity of recognizing critical sets

On the Existence of Strong Kirkman Cubes of Order 39 and Block Size 3

Computation of Some Parameters of Lie Geometries

The Computational Complexity of Finding Subdesigns in Combinatorial Designs

Four Orthogonal One-Factorizations on Ten Points

Algorithmic Aspects of Combinatorial Designs: A Survey

Constructive Enumeration of Incidence Systems

Tables of Parameters of BIBDs with r⩽41 including Existence, Enumeration, and Resolvability Results

Construction Procedures for t-designs and the Existence of New Simple 6–designs

Greedy Colourings of Steiner Triple Systems

Directing Cyclic Triple Systems

Algorithms to Find Directed Packings

A Survey of Results on the Number of t-(v,k,λ) Designs

A Problem of Lines and Intersections With an Application to Switching Networks

Derived Steiner Triple Systems of Order 15

The computational complexity of finding subdesigns in combinatorial designs

Every twofold triple system can be directed

Some new upper bounds for constant weight codes (Corresp.)

A census of orthogonal Steiner triple systems of order

Performance of subset generating aorithms

Suchergebnisse filtern