Alan C. H. Ling

Electron. J. Comb., 2017

2016

Matching divisible designs with block size four.

[BibT_eX]

[DOI]

Tao Feng

Discret. Math., 2016

Resolvable Group Divisible Designs with Large Groups.

[BibT_eX]

[DOI]

Esther R. Lamken

Electron. J. Comb., 2016

Thickly-resolvable block designs.

[BibT_eX]

[DOI]

Amanda Malloch

Australas. J Comb., 2016

2015

Graph Divisible Designs and Packing Constructions.

[BibT_eX]

[DOI]

Graphs Comb., 2015

A finite embedding theorem for partial Steiner 3-designs.

[BibT_eX]

[DOI]

Tao Feng

Finite Fields Their Appl., 2015

Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

2014

Pairwise Balanced Designs with Prescribed Minimum Dimension.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

A Construction of Modular Generalized Sidon Sets.

[BibT_eX]

Charles C. Y. Lam

Ars Comb., 2014

2013

Covering and packing for pairs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2013

2012

Grooming traffic to minimize load.

[BibT_eX]

[DOI]

Discret. Math., 2012

Optimal equitable symbol weight codes for power line communications.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Optical grooming with grooming ratio nine.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization.

[BibT_eX]

[DOI]

Jianxing Yin

IEEE Trans. Inf. Theory, 2010

Linear size optimal q-ary constant-weight codes and constant-composition codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Spectrum of Sizes for Perfect Deletion-Correcting Codes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

On the existence of well-ordered Steiner triple systems.

[BibT_eX]

Ars Comb., 2010

2009

Limit on the Addressability of Fault-Tolerant Nanowire Decoders.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2009

The Existence of r×4 Grid-Block Designs with r=3, 4.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

The Existence of N2 Resolvable Latin Squares.

[BibT_eX]

[DOI]

A. J. Wolfe

SIAM J. Discret. Math., 2009

A recursive construction for perfect hash families.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2009

Linear spaces with small generated subspaces.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2009

Minimum embedding of Steiner triple systems into (K4-e)-designs II.

[BibT_eX]

[DOI]

Gaetano Quattrocchi

Discret. Math., 2009

Maximum uniformly resolvable designs with block sizes 2 and 4.

[BibT_eX]

[DOI]

Peter Danziger

Discret. Math., 2009

Graph designs for the eight-edge five-vertex graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Further results on (v, {5, w*}, 1)-PBDs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Linear hash families and forbidden configurations.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

Optical grooming with grooming ratio eight.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

A Systematic Construction for Radar Arrays.

[BibT_eX]

[DOI]

Ying Miao

IEEE Trans. Inf. Theory, 2008

Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Mining partial periodic correlations in time series.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2008

The Fine Intersection Problem for Steiner Triple Systems.

[BibT_eX]

[DOI]

Hao Shen

Graphs Comb., 2008

Resolvable balanced incomplete block designs with subdesigns of block size 4.

[BibT_eX]

[DOI]

Discret. Math., 2008

Minimum embedding of Steiner triple systems into (K4-e)-designs I.

[BibT_eX]

[DOI]

Gaetano Quattrocchi

Discret. Math., 2008

Constructing strength three covering arrays with augmented annealing.

[BibT_eX]

[DOI]

Myra B. Cohen

Discret. Math., 2008

Note edge-colourings of K n, n with no long two-coloured cycles.

[BibT_eX]

[DOI]

Comb., 2008

2007

The PBD-Closure of Constant-Composition Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

On the Existence of K5 \setminuse-Designs with Application to Optical Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Perfect hash families from transversal designs.

[BibT_eX]

[DOI]

Douglas R. Stinson

Australas. J Comb., 2007

2006

Fault-tolerant routings with minimum optical index.

[BibT_eX]

[DOI]

Douglas R. Stinson

Networks, 2006

Scheduling CCRR tournaments.

[BibT_eX]

[DOI]

Esther R. Lamken

J. Comb. Theory, Ser. A, 2006

A Fast Algorithm for the Constrained Multiple Sequence Alignment Problem.

[BibT_eX]

[DOI]

Dan He

Abdullah N. Arslan

Acta Cybern., 2006

Location-aware key predistribution scheme for wide area wireless sensor networks.

[BibT_eX]

[DOI]

Katerina Simonova

Xiaoyang Sean Wang

Proceedings of the 4th ACM Workshop on Security of ad hoc and Sensor Networks, 2006

Optimal memoryless encoding for low power off-chip data buses.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Conference on Computer-Aided Design, 2006

2005

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Constructions of Quad-Rooted Double Covers.

[BibT_eX]

[DOI]

Graphs Comb., 2005

Embedding path designs into kite systems.

[BibT_eX]

[DOI]

Gaetano Quattrocchi

Discret. Math., 2005

Resolvable Maximum Packings with Quadruples.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

Group Divisible Designs with Block Size Four and Group Type gum1 with Minimum m.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

2004

Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares.

[BibT_eX]

[DOI]

Torleiv Kløve

IEEE Trans. Inf. Theory, 2004

A combinatorial error bound for t-point-based sampling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

A systematic approach to some block design constructions.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2004

Splitting systems and separating systems.

[BibT_eX]

[DOI]

Pak Ching Li

G. H. John van Rees

Discret. Math., 2004

A survey on resolvable group divisible designs with block size four.

[BibT_eX]

[DOI]

Discret. Math., 2004

Group divisible designs with block size four and group type gum1 for small g.

[BibT_eX]

[DOI]

Discret. Math., 2004

Grooming in unidirectional rings: K4-e designs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Cover-Free Families and Topology-Transparent Scheduling for MANETs.

[BibT_eX]

[DOI]

Hans-Dietrich O. F. Gronau

Violet R. Syrotiuk

Des. Codes Cryptogr., 2004

Super-simple (v, 5, 2)-designs.

[BibT_eX]

[DOI]

Donald L. Kreher

Discret. Appl. Math., 2004

2003

Constrained Ramsey numbers of graphs.

[BibT_eX]

[DOI]

Robert E. Jamison

Tao Jiang

J. Graph Theory, 2003

Sets of three pairwise orthogonal Steiner triple systems.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2003

An application of splittable 4-frames to coloring of Kn, n.

[BibT_eX]

[DOI]

Discret. Math., 2003

A note on {4}-GDDs of type 210.

[BibT_eX]

[DOI]

Discret. Math., 2003

Complementary partial resolution squares for Steiner triple systems.

[BibT_eX]

[DOI]

Esther R. Lamken

Discret. Math., 2003

Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs.

[BibT_eX]

[DOI]

Discret. Math., 2003

A new construction for Z-cyclic whist tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Skolem-type Difference Sets for Cycle Systems.

[BibT_eX]

[DOI]

Darryn E. Bryant

Heather Gavlas

Electron. J. Comb., 2003

Some applications of combinatorial designs to extremal graph theory.

[BibT_eX]

Ars Comb., 2003

Six New Constant Weight Binary Codes.

[BibT_eX]

Hui Kheng Aw

Ars Comb., 2003

Augmenting Simulated Annealing to Build Interaction Test Suites.

[BibT_eX]

[DOI]

Myra B. Cohen

Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 2003

Topology-transparent scheduling for MANETs using orthogonal arrays.

[BibT_eX]

[DOI]

Violet R. Syrotiuk

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

Steiner Systems for Topology-Transparent Access Control in MANETs.

[BibT_eX]

[DOI]

Violet R. Syrotiuk

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002

Difference triangle sets from affine planes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Kirkman triple systems of order 21 with nontrivial automorphism group.

[BibT_eX]

[DOI]

Math. Comput., 2002

Uniform Group Divisible Designs with Block Sizes Three and n.

[BibT_eX]

[DOI]

Graphs Comb., 2002

Totally magic graphs.

[BibT_eX]

[DOI]

Geoffrey Exoo

John P. McSorley

Nicholas C. K. Phillips

Walter D. Wallis

Discret. Math., 2002

The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs.

[BibT_eX]

Des. Codes Cryptogr., 2002

Construction of optimal quality control for oligo arrays.

[BibT_eX]

[DOI]

Martin Tompa

Bioinform., 2002

A direct construction of transversal covers using group divisible designs.

[BibT_eX]

Brett Stevens

Eric Mendelsohn

Ars Comb., 2002

Packings with block size five and index one: v \equiv 2 (mod 4).

[BibT_eX]

Ars Comb., 2002

2001

Equireplicate Balanced Binary Codes for Oligo Arrays.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

Slope packings and coverings, and generic algorithms for the discrete logarithm problem.

[BibT_eX]

[DOI]

M. A. Chateauneuf

Douglas R. Stinson

IACR Cryptol. ePrint Arch., 2001

The existence of referee squares.

[BibT_eX]

[DOI]

Discret. Math., 2001

(M, S)-optimal designs with block size three.

[BibT_eX]

[DOI]

Australas. J Comb., 2001

2000

Quorums from difference covers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Modified group divisible designs with block size four.

[BibT_eX]

[DOI]

Discret. Math., 2000

Asymptotically optimal erasure-resilient codes for large disk arrays.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

Kirkman school project designs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Balanced sampling plans with block size four excluding contiguous units.

[BibT_eX]

[DOI]

Australas. J Comb., 1999

1998

Point Code Minimum Steiner Triple Systems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1998

Deleting Lines in Projective Planes.

[BibT_eX]

Ars Comb., 1998

1997

Pairwise Balanced Designs with Block Sizes 8, 9, and 10.

[BibT_eX]

[DOI]